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

using namespace std;

typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int,int> PII;
typedef long long ll;
typedef unsigned long long ull;

#define REP( i, m, n ) for ( int i = (int)( m ); i < (int)( n ); i++ )
#define UREP( i, m, n ) for ( unsigned int i = (unsigned int)( m ); i < (unsigned int)( n ); i++ )

#define ITER( c ) __typeof( (c).begin() )
#define IREP( c, it ) for ( ITER(c) it = c.begin(); it != c.end(); ++it )
#define ALL( c ) (c).begin(), (c).end()
#define RALL( c ) (c).rbegin(), (c).rend()

#define PB( n ) push_back( n )
#define MP( a, b ) make_pair( ( a ), ( b ) )
#define EXIST( c, e ) ( (c).find( e ) != (c).end() )

#define fst first
#define snd second

#define DUMP( x ) cerr << #x << " = " << ( x ) << endl
#define DEBUG( x ) cerr << __FILE__ << ":" << __LINE__ << ": " << #x << " = " << ( x ) << endl

int main()
{
	string buffer;

	while ( getline( cin, buffer ) )
	{
		UREP( i, 0, buffer.length() )
		{
			if ( buffer[i] == ',' )
			{
				buffer[i] = ' ';
			}
		}

		vector<int> l;
		l.PB( 0 );
		istringstream iss( buffer );

		REP( i, 0, 10 )
		{
			int input;
			iss >> input;
			l.PB( l.back() + input );
		}

		int v1, v2, res;
		iss >> v1 >> v2;

		UREP( i, 0, 11 )
		{
			if ( l[i] / (double)v1 < ( l.back() - l[i] ) / (double)v2 )
			{
				res = i;
			}
			else
			{
				res++;
				break;
			}
		}

		cout << res << endl;
	}

	return 0;
}
#include<iostream>
#include<vector>
#include<string>
#include<sstream>
using namespace  std;
vector<string> split(const string &s, char delimiter)
{
	vector<string> ret;
	size_t now = 0, find;
	while ((find = s.find_first_of(delimiter, now)) != string::npos)
	{
		ret.push_back(string(s, now, find - now));
		now = find + 1;
	}
	ret.push_back(string(s, now, s.size() - now));
	return ret;
}
int main()
{
	string in;
	while (cin >> in)
	{
		vector<string> v = split(in, ',');
		int disSum = 0;
		int dis[10];
		int sp[2];
		for (int i = 0; i < v.size(); i++)
		{
			stringstream ss;
			ss << v[i];
			if (i < 10)
			{
				ss >> dis[i];
				disSum += dis[i];
			}
			else
			{
				ss >> sp[i - 10];
			}
		}
		double a = disSum * sp[0] / (sp[0] + sp[1]);
		double b = disSum * sp[1] / (sp[0] + sp[1]);

		double fromStart = 0.0;
		double fromEnd = 0.0;
		int i = 0, j = 0;
		for (i = 0; i < 10; i++)
		{
			if (fromStart >= a)
			{
				break;
			}
			fromStart += dis[i];
		}
		for (j = 9; j >= 0; j--)
		{
			if (fromEnd >= b)
			{
				break;
			}
			fromEnd += dis[j];
		}
		/*cout << i << " " << j << endl;
		cout << a << " " << b << " " << fromStart << " " << fromEnd << endl;*/
		if (fromStart == a && fromEnd == b)
		{
			cout << i << endl;
		}
		else
		{
			if (fromStart == fromEnd)i++;
			cout << i << endl;
		}




	}
	return 0;
}