#define _CRT_SECURE_NO_WARNINGS #define _SILENCE_CXX17_C_HEADER_DEPRECATION_WARNING #include using namespace std; #define CRP(t, x) const t &x #define OPX(op, t, x) operator op(CRP(t, x)) #define OPL(t, x) bool OPX(<, t, x) const #define FIL(x, v) memset(x, v, sizeof(x)) #define CLR(x) FIL(x, 0) #define NE1(x) FIL(x, -1) #define INF(x) FIL(x, 0x3f) #ifndef _DEBUG #define _DEBUG 0 #endif // !_DEBUG #define IFD if (_DEBUG) typedef int64_t ll, i64; typedef uint64_t ull, u64; template using comtype = typename common_type::type; template using enable_if_arithmetic = typename enable_if::value>::type; template using enable_if_integral = typename enable_if::value>::type; inline char getchar(int) { static char buf[64 << 20], *S = buf, *T = buf; if (S == T) T = fread(S = buf, 1, 64 << 20, stdin) + buf; return S == T ? EOF : *S++; } template > inline bool read(T &x) { int ch = x = 0, f = 1; while (!isdigit(ch = getchar())) if (ch == EOF) return false; else if (ch == '-') f = 0; for (; isdigit(ch); ch = getchar()) x = x * 10 + ch - '0'; return x = f ? x : -x, true; } template > inline bool read(T &x, Args &... args) { return read(x) && read(args...); } template > inline TResult mmin(CRP(T1, v1), CRP(T2, v2)) { return min(v1, v2); } template > inline TResult mmin(CRP(T, v), const Args &... args) { return min(v, mmin(args...)); } template > inline TResult mmax(CRP(T1, v1), CRP(T2, v2)) { return max(v1, v2); } template > inline TResult mmax(CRP(T, v), const Args &... args) { return max(v, mmax(args...)); } inline ll gcd(ll a, ll b) { for (; b; swap(a, b)) a = a % b; return a; } inline ll fpow(ll a, ll b, ll m) { ll r = 1; for (; b; b >>= 1, a = a * a % m) if (b & 1) r = r * a % m; return r; } constexpr double eps = 1e-8; inline int sgn(double x) { return x > eps ? 1 : x < -eps ? -1 : 0; } const int N = 2e5 + 50; char s[N]; int prv[N]; int main() { int t; read(t); while (t--) { scanf("%s", s + 1); int n = strlen(s + 1), ans = 0; for (int i = 1; i <= n; i++) prv[i] = s[i] == '1' ? i : prv[i - 1]; for (int l = 1; l <= n; l++) if (s[l] == '1') for (int r = l, cur = 0; r <= n && r - l < 20; r++) if ((cur = cur << 1 | (s[r] - '0')) <= r - prv[l - 1]) ans++; printf("%d\n", ans); } return 0; }