#include <bits/stdc++.h>
void merge(int arr[], int l, int m, int r) {
  int i, j, k;
  int n1 = m - l + 1;
  int n2 = r - m;
  int L[n1], R[n2];
  for (i = 0; i < n1; i++) L[i] = arr[l + i];
  for (j = 0; j < n2; j++) R[j] = arr[m + 1 + j];
  i = 0;
  j = 0;
  k = l;
  while (i < n1 && j < n2) {
    if (L[i] <= R[j]) {
      arr[k] = L[i];
      i++;
    } else {
      arr[k] = R[j];
      j++;
    }
    k++;
  }
  while (i < n1) {
    arr[k] = L[i];
    i++;
    k++;
  }
  while (j < n2) {
    arr[k] = R[j];
    j++;
    k++;
  }
}
void mergeSort(int arr[], int l, int r) {
  if (l < r) {
    int m = l + (r - l) / 2;
    mergeSort(arr, l, m);
    mergeSort(arr, m + 1, r);
    merge(arr, l, m, r);
  }
}
int main() {
  int t, i, j, l, c, f, a[100], sum, sum1;
  char s[200];
  scanf("%d", &t);
  for (i = 0; i < t; i++) {
    scanf(" %s", s);
    l = strlen(s);
    c = 0;
    for (j = 0; j < l; j++) {
      if (s[j] == '1') {
        f = j;
        a[c] = 0;
        while (s[f] == s[j] && f < l) {
          a[c]++;
          f++;
        }
        c++;
        j = f - 1;
      }
    }
    sum = 0;
    sum1 = 0;
    mergeSort(a, 0, c - 1);
    for (j = c - 1; j >= 0; j--) {
      if ((c - 1 - j) % 2 == 0) sum = sum + a[j];
    }
    printf("%d\n", sum);
  }
  return 0;
}
