#include<iostream>
using namespace std;

#define N 10	// üHÌ

int main()
{
	double l[N], v[2];
	double sum[N];
	double position;
	int i;

	while (scanf("%lf,%lf,%lf,%lf,%lf,%lf,%lf,%lf,%lf,%lf,%lf,%lf",&l[0],&l[1],&l[2],&l[3],&l[4],&l[5],&l[6],&l[7],&l[8],&l[9],&v[0],&v[1]) != EOF) {
		sum[0] = l[0];
		for (i = 1; i < N; i++)
			sum[i] = sum[i-1]+l[i];
		position = v[0] * sum[9] / (v[0]+v[1]);
		for (i = 0; i < N; i++)
			if (sum[i]>=position)
				break;
		i++;

		cout<<i<<endl;
	}

	return 0;
}
#include <iostream>

using namespace std;

int main()
{
	double l[10], sum, v1, v2;
	char c;

	while (1) {
		for (int i = 0; i < 10; i++) {
			cin >> l[i] >> c;
		}
		if (cin.eof())	break;

		cin >> v1 >> c >> v2;

		sum = 0;
		for (int i = 0; i < 10; i++) {
			sum += l[i];
		}

		sum *= v1 / (v1 + v2);

		for (int i = 0; i < 10; i++) {
			sum -= (double)l[i];
			
			if (sum <= 0) {
				cout << i + 1 << endl;
				break;
			}
		}
	}

	return 0;
}