#include <iostream>
#include <algorithm>
#include <map>
#include <vector>
#include <string>
#include <cstdio>
#include <cmath>

using namespace std;

int main(void)
{
    int l[10];
    int a,b;
    while(~scanf("%d,", &l[0])) {
        double sum = 0;
        for(int i=1; i<10; i++) scanf("%d,", &l[i]);
        scanf("%d,%d",&a,&b);
        for(int i=0; i<10; i++) sum += (double)l[i];

        double c=0, d=0;
        int i;
        for(i=0; i<10; i++) {
            c += l[i];
            d += (double)l[i]/a * b;
            if(c + d >= sum) break;
        }

        printf("%d\n", i+1);
    }

    return 0;
}
#include<cstdio>
#include<iostream>
using namespace std;
int main(){
	int a[10];
	int v1,v2;
	while(scanf("%d",a)!=EOF){
		for(int i=1;i<10;i++){
			scanf(",%d",&a[i]);
			a[i] += a[i-1];
		}
		scanf(",%d,%d\n",&v1,&v2);
		int ans;
		for(int i=9;i>=0;i--){
			if(v1*a[9] <= a[i]*(v1+v2))ans=i;
		}
		cout<<ans+1<<endl;
	}
	return 0;
}