#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<int, int> PII;

#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#define MP make_pair
#define PB push_back
#define MOD 1000000007
#define INF (1LL<<30)
#define LLINF (1LL<<60)
#define PI 3.14159265359
#define EPS 1e-12
#define int ll

vector<string> split(const string &str, char sep)
{
  vector<string> v;
  auto first = str.begin();
  while( first != str.end() ) {
    auto last = first;
    while( last != str.end() && *last != sep ) ++last;
    v.push_back(std::string(first, last));
    if( last != str.end() ) ++last;
    first = last;
  }
  return v;
}

signed main(void)
{
  string s;
  while(cin >> s) {
    vector<string> v = split(s, ',');
    int l1[11] = {0}, l2[11] = {0}, v1, v2;
    REP(i, v.size()) {
      if(i<10) {
        l1[i+1] = stoi(v[i]);
        l2[i] = l1[i+1];
      }
      else if(i == 10) v1 = stoi(v[i]);
      else if(i == 11) v2 = stoi(v[i]);
    }
    FOR(i, 1, 11) l1[i] += l1[i-1];
    for(int i=8; i>=0; --i) l2[i] += l2[i+1];
    double t1[11], t2[11];
    REP(i, 11) {
      t1[i] = (double)l1[i]/v1;
      t2[i] = (double)l2[i]/v2;
    }
    //REP(i, 11) cout << t1[i] << " "; cout << endl;
    //REP(i, 11) cout << t2[i] << " "; cout << endl;
    REP(i, 10) {
      if((t1[i] < t2[i] && t2[i] <= t1[i+1]) ||
      (t1[i] < t2[i+1] && t2[i+1] <= t1[i+1])) {
        cout << i+1 << endl;
        break;
      }
    }
  }

  return 0;
}