#include <bits/stdc++.h>
using namespace std;
template <class T>
inline T BM(T p, T e, T M) {
  long long int ret = 1;
  for (; e > 0; e >>= 1) {
    if (e & 1) ret = (ret * p) % M;
    p = (p * p) % M;
  }
  return (T)ret;
}
template <class T>
inline T mul(T p, T e, T M) {
  long long int ret = 0;
  for (; e > 0; e >>= 1) {
    if (e & 1) ret = (ret + p);
    p = (p + p);
    if (ret >= M) ret -= M;
    if (p >= M) p -= M;
  }
  return (T)ret;
}
template <class T>
inline T gcd(T a, T b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
template <class T>
inline T mdINV(T a, T M) {
  return BM(a, M - 2, M);
}
template <class T>
inline T PW(T p, T e) {
  long long int ret = 1;
  for (; e > 0; e >>= 1) {
    if (e & 1) ret = (ret * p);
    p = (p * p);
  }
  return (T)ret;
}
template <class T>
bool ISLEFT(T a, T b, T c) {
  if (((a.first.first - b.first.first) * (b.second.second - c.second.second) -
       (b.first.first - c.first.first) * (a.second.second - b.second.second)) <
      0.0)
    return 1;
  else
    return 0;
}
int mp[2][200007 * 9 + 2];
int main() {
  int tc;
  scanf("%d", &tc);
  while (tc--) {
    string s;
    cin >> s;
    vector<int> ans;
    int cnt = 0;
    for (int i = 0; i < s.size(); i++) {
      if (s[i] == '1') {
        cnt++;
      } else {
        if (cnt != 0) ans.push_back(cnt);
        cnt = 0;
      }
    }
    if (cnt) ans.push_back(cnt);
    sort(ans.begin(), ans.end());
    reverse(ans.begin(), ans.end());
    int res = 0;
    for (int i = 0; i < ans.size(); i += 2) res += ans[i];
    printf("%d", res), printf("\n");
  }
  return 0;
}
