#include <bits/stdc++.h>
using namespace std;
const long long M = 1e9 + 7;
long long add(long long a, long long b) {
  (a += b) %= M;
  (a += M) %= M;
  return a;
}
long long mul(long long a, long long b) {
  (a *= b) %= M;
  (a += M) %= M;
  return a;
}
long long fastpo(long long a, long long x) {
  if (x == 0) return 1ll;
  if (x == 1) return a;
  long long y = fastpo(a, x / 2);
  if (x % 2 == 0) {
    return y * y;
  }
  return y * y * a;
}
long long inv(long long a, long long M) { return fastpo(a, M - 2); }
long long gcdExtended(long long a, long long b, long long *x, long long *y) {
  if (a == 0) {
    *x = 0, *y = 1;
    return b;
  }
  long long x1, y1;
  long long gcd = gcdExtended(b % a, a, &x1, &y1);
  *x = y1 - (b / a) * x1;
  *y = x1;
  return gcd;
}
long long modInverse(long long a, long long m) {
  long long x, y;
  long long g = gcdExtended(a, m, &x, &y);
  if (g != 1)
    return -1;
  else {
    long long res = (x % m + m) % m;
    return res;
  }
}
long long gcd(long long a, long long b) {
  if (a == 0) {
    return b;
  }
  return gcd(b % a, a);
}
long long lcm(long long a, long long b) { return (a * b) / gcd(a, b); }
void print(vector<int> &a) {
  int n = a.size();
  for (int i = 0; i < n; i++) {
    cout << a[i] << " ";
  }
  cout << endl;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int t;
  cin >> t;
  while (t--) {
    string s;
    cin >> s;
    int n = s.length();
    vector<int> a;
    int block = 0;
    bool bl = false;
    for (int i = 0; i < n; i++) {
      if (s[i] == '1') {
        block++;
      } else {
        if (block > 0) {
          a.push_back(block);
        }
        block = 0;
      }
    }
    if (block > 0) a.push_back(block);
    sort(a.begin(), a.end(), greater<int>());
    int ans = 0;
    for (int i = 0; i < a.size(); i++) {
      if (i % 2 == 0) {
        ans += a[i];
      }
    }
    cout << ans << endl;
  }
  return 0;
}
