#include <iostream>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <string>
#include <map>
#include <vector>
#include <stack>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)

int main(void)
{
    int l[10], v1, v2, x;
    double d, t;
    
    while (~scanf("%d,%d,%d,%d,%d,%d,%d,%d,%d,%d,%d,%d", l, l+1, l+2, l+3, l+4, l+5, l+6, l+7, l+8, l+9, &v1, &v2)) {
        x = 0;
        rep(i, 10)
            x += l[i];
        t = (double)x / (v1+v2);
        d = (double)v1 * t;
        x = 0;
        rep(i, 10) {
            x += l[i];
            if (x >= d) {
                cout << i + 1 << endl;
                break;
            }
        }
    }
    
    return 0;
}