#include <iostream>
#include <queue>
#include <stack>
#include <vector>
#include <stdio.h>
#include <algorithm>
#include <string.h>
#include <string>
#include <cmath>
using namespace std;

#define rep(i,n) for(int i=0;i<int(n);++i)

int l[10];
int v1,v2;
char t;
int len;
double tim;
double L;

int main(){
	while(cin>>l[0]){
		rep(i,9){
			cin>>t>>l[i+1];
		}
		cin>>t>>v1>>t>>v2;
		v2+=v1;
		len = 0;
		rep(i,10) len+=l[i];
		tim = (double)len / v2;
		L = v1*tim;
		rep(i,10){
			if(L<=l[i]){
				l[0] = i;
				break;
			}
			else{
				L-=l[i];
			}
		}
		cout<<l[0]+1<<endl;
	}
	return 0;
}