// includes
#include <cstdio>
#include <cstdint>
#include <iostream>
#include <iomanip>
#include <string>
#include <queue>
#include <stack>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <utility>
#include <functional>
#include <cmath>
#include <climits>
#include <bitset>

// macros
#define ll long long int
#define pb push_back
#define mk make_pair
#define pq priority_queue
#define FOR(i, a, b) for(int i=(a); i<(b);++i)
#define rep(i, n) FOR(i, 0, n)

using namespace std;

//  types
typedef pair<int, int> P;
typedef pair<ll, int> Pl;
typedef pair<ll, ll> Pll;
typedef pair<double, double> Pd;
 
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;

// solve

int main(int argc, char const* argv[])
{
  string s;
  int l[12];
  while(cin >> s){
    s += ",";
    string tmp = "";
    int ati = 0;
    rep(i, s.size()){
      if(s[i] == ','){
        l[ati] = stoi(tmp);
        ati++;
        tmp = "";
      }else{
        tmp += s[i];
      }
    }
    double lsum = 0.;
    rep(i, 10)lsum += (double)l[i];
    double h = lsum / (double)(l[10] + l[11]);
    h = h * (double)l[10];
    double at = 0.;
    rep(i, 10){
      if(at <= h && h <= at + l[i]){
        cout << i+1 << endl;
        break;
      }
      at += l[i];
    }
  }
	return 0;
}

