#include <algorithm>
#include <cmath>
#include <climits>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <cassert>
#include <functional>

using namespace std;

#define LOG(...) printf(__VA_ARGS__)
//#define LOG(...)
#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define REP(i,n) for(int i=0;i<(int)(n);++i)
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define RSORT(c) sort((c).rbegin(),(c).rend())
#define CLR(a) memset((a), 0 ,sizeof(a))

typedef long long ll;
typedef unsigned long long ull;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vb> vvb;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int dx[] = { -1, 0, 1, 0 }; const int dy[] = { 0, 1, 0, -1 };

int main() {
	int length[10];
	int v1;
	int v2;
	char comma;
	while (cin>>length[0]>>comma>> length[1]>>comma>> length[2]>>comma>> length[3]>>comma>> length[4]>>comma>> length[5]>>comma>> length[6]>>comma>> length[7]>>comma>> length[8]>>comma>>length[9]>>comma>>v1>>comma>>v2){
	double sum=0;
	REP(i,10)
		sum += length[i];
	double time = sum / (double)(v1+v2);
	double go=time*(double)v1;
	REP(i,10){
		if (go <= (double)length[i] + 1e-10){
		cout<<(i+1)<<endl;
		break;
		}else
			go -= (double)length[i];
	}
	}
	return 0;
}
#include <iostream>
using namespace std;

int main(){
	double t[10], a, b;
	char c;
	while(cin >> t[0] >> c){
		for(int i = 1;i< 10;i++){cin >> t[i] >> c;t[i] += t[i-1];}
		cin >> a >> c >> b;
		double tmp = t[9]/(a+b)*a;
		int ans = 1;
		while(tmp > t[ans-1])ans++;
		cout << ans << endl;
	}
	return 0;
}