#include <iostream>
#include <vector>
#include <list>
#include <algorithm>
#include <string>
#include <stack>
#include <iomanip>
#include <numeric>
#include <queue>
#include <climits>
#include <complex>
#include <cmath>
#include <map>
using namespace std;
using ll = long long;
#define MOD 1000000007
#define INF 1LL << 59

int arr[20010];
int main()
{
    std::ios::sync_with_stdio(false);
    std::cin.tie(0);
    //cout << fixed << setprecision(3);
    int l[10];
    int v1, v2;
    char c;
    while (cin >> l[0] >> c >> l[1] >> c >> l[2] >> c >> l[3] >> c >> l[4] >> c >> l[5] >> c >> l[6] >> c >> l[7] >> c >> l[8] >> c >> l[9])
    {
        cin >> c >> v1 >> c >> v2;

        int sum = 0;
        double c = (double)v1 / (v1 + v2);

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

        int partsum = 0;

        for (int i = 0; i < 10; ++i)
        {
            partsum += l[i];
            if ((double)partsum / sum >= c)
            {
                cout << i + 1 << endl;
                break;
            }
        }
    }
    return 0;
}
