
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <cassert>
#include <iostream>
#include <cctype>
#include <sstream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <utility>
#include <numeric>
#include <algorithm>
#include <bitset>
#include <complex>
#include <fstream>
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
typedef vector<int> vint;
typedef pair<int, int> pint;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for(int i = x; i < n; i++)
template<class T> T RoundOff(T a){ return int(a+.5-(a<0)); }
template<class T, class C> void chmax(T& a, C b){ if(a < b) a = b; }
template<class T, class C> void chmin(T& a, C b){ if(b < a) a = b; }
template<class T, class C> pair<T, C> mp(T a, C b){ return make_pair(a, b); }


vector<string> split(string str, string delim)
{
    vector<string> result;
    int cutAt;
    while( (cutAt = str.find_first_of(delim)) != str.npos )
    {
        if(cutAt > 0)
        {
            result.push_back(str.substr(0, cutAt));
        }
        str = str.substr(cutAt + 1);
    }
    if(str.length() > 0)
    {
        result.push_back(str);
    }
	return result;
}


int main()
{
	vint line(10);
	float v1, v2;
	string str;

	while(cin >> str)
	{
		vector<string> ss = split(str, ",");

		rep(i, 10)
		{
			line[i] = 0;
			rep(j, ss[i].size())
			{
				line[i] += pow((double)10, (double)ss[i].size() - j -1) * (ss[i][j] - '0');
			}
		}

		v1 = v2 = 0;

		rep(j, ss[10].size())
			v1 += pow((double)10, (double)ss[10].size() - j -1) * (ss[10][j] - '0');
		rep(j, ss[10].size())
			v2 += pow((double)10, (double)ss[11].size() - j -1) * (ss[11][j] - '0');


		float sum = accumulate(ALL(line), 0);

		float cross = sum / (v1 + v2) * v1;

		partial_sum(ALL(line), line.begin());

		rep(i, 10)
			if(cross <= line[i])
			{
				cout << i + 1 << endl;
				break;
			}
	}
}