#include <bits/stdc++.h>
using namespace std;
const int N = 2e7 + 7;
const int dx[] = {-1, 1, 0, 0};
const int dy[] = {0, 0, -1, 1};
vector<char> binary(62);
vector<char> binary1(62);
inline void bin(long long int n) {
  if (n > 1) bin(n / 2);
  long long int a = n % 2;
  binary.push_back(a + '0');
}
inline void bin1(long long int n) {
  if (n > 1) bin1(n / 2);
  long long int a = n % 2;
  binary1.push_back(a + '0');
}
long long int mod = 1e9 + 7;
long long int power(long long int x, long long int n) {
  long long int res = 1;
  while (n) {
    if (n & 1) res = (res * x);
    x = (x * x);
    n >>= 1;
  }
  return res;
}
long long int powermod(long long x, long long n, long long mod) {
  long long res = 1;
  x %= mod;
  while (n) {
    if (n & 1) res = (res * x) % mod;
    x = (x * x) % mod;
    n >>= 1;
  }
  return res;
}
inline long long int maximum(long long int a, long long int b) {
  if (a > b)
    return a;
  else
    return b;
}
inline long long int minimum(long long int a, long long int b) {
  if (a > b)
    return b;
  else
    return a;
}
inline bool isPrime(long long int x) {
  if (x < 2) return false;
  for (long long int y = 2; y * y <= x; y++)
    if (x % y == 0) return false;
  return true;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int t;
  cin >> t;
  while (t--) {
    string s;
    cin >> s;
    int A[s.size()];
    vector<int> freq;
    int cnt1 = 0;
    for (int i = 0; i < s.size(); i++) {
      A[i] = s.at(i) - '0';
    }
    for (int i = 0; i < s.size(); i++) {
      if (i < s.size() - 1 && A[i] == 1 && A[i + 1] == 1) {
        cnt1++;
        continue;
      } else {
        if (cnt1 != 0) {
          freq.push_back(cnt1 + 1);
          cnt1 = 0;
        } else if (i < s.size() - 1 && A[i] == 1 && A[i + 1] == 0) {
          freq.push_back(1);
        }
      }
    }
    if (s.size() > 1 && A[s.size() - 1] == 1 && A[s.size() - 2] == 0)
      freq.push_back(1);
    if (s.size() == 1 && A[0] == 1) freq.push_back(1);
    sort(freq.rbegin(), freq.rend());
    int ans = 0;
    for (int i = 0; i < freq.size(); i += 2) {
      ans += freq[i];
    }
    cout << ans << '\n';
  }
  return 0;
}
