Go: package main

import (
	"bufio"
	"os"
	"strings"
	"strconv"
	"fmt"
)

func main() {
	scanner := bufio.NewScanner(os.Stdin)
	a := make([]float64, 10)
	for scanner.Scan() {
		info := strings.Split(scanner.Text(), ",")
		for j := 0; j < 10; j++ {
			a[j], _ = strconv.ParseFloat(info[j], 64)
		}
		v1, _ := strconv.ParseFloat(info[10], 64)
		v2, _ := strconv.ParseFloat(info[11], 64)
		sum := 0.0
		for i := 0; i < 10; i++ {
			sum += a[i]
		}
		match := v1 * ((sum/(v1+v2)))
		if match == 0 {
			fmt.Println(1)
		} else {
			sum = 0
			for k := 0; k < 10; k++ {
				sum += a[k]
				if match <= sum {
					fmt.Println(k+1)
					break
				}
			}
		}
	}
}

Python: while True:
    try:
        l1,l2,l3,l4,l5,l6,l7,l8,l9,l10,v1,v2=map(int,input().split(","))
        kyo=0
        for i in l1,l2,l3,l4,l5,l6,l7,l8,l9,l10:
            kyo +=i
        v=v1+v2
        x=kyo/v
        ans=v1*x
        flag=0
        for j in l1,l2,l3,l4,l5,l6,l7,l8,l9,l10:
            if ans>0:
                ans -=j
                flag +=1
            elif ans==0:
                print(flag)
                break
            elif ans<0:
                print(flag)
                break
    except:break

Python: while True:
  try:
    data = list(map(int,input().split(",")))
  except EOFError:
    break
  dist = 0.0
  for i in range(10):
    dist += data[i]
  time = dist / float(data[10]+data[11])
  pos = data[10] * time
  tmp = 0.0
  for i in range(10):
    tmp += data[i]
    if tmp >= pos:
      print(i+1)
      break

Python: while True :
	try:
		x=[int(i) for i in input().split(",")]
		Len=x[:-2]
		ve=x[len(x)-2:]
		sum_ve=sum(ve)
		k=sum(Len)/sum_ve
		count=0
		for i in range(len(Len)):
			count+=Len[i]
			if count>=k*ve[0]:
				print(i+1)
				break
	except EOFError:
		break

Python: import sys

for line in sys.stdin:
    ll = list(map(int, line.split(',')))
    s = ll[:10]
    v1, v2 = ll[10], ll[11]
    p = sum(s) / (v1 + v2) * v1

    ss = 0
    for i, l in enumerate(s):
        ss += l
        if ss >= p:
            print(i + 1)
            break

Python: while True:
    try:
        a = list(map(int, input().split(',')))
    except EOFError:
        break
    v1, v2 = a[10], a[11]
    d = [0]
    for i in range(10): d.append(a[i] + d[-1])
    x = d[10] * v1 / (v1 + v2)
    for i in range(10):
        if d[i] < x <= d[i + 1]:
            print(i + 1)
            break

Python: while True:
    try:
        l = list(map(int, input().split(',')))
    except:
        break
    d = sum(l[:10]) * l[10] / (l[10] + l[11])
    for i in range(1,11):
        if sum(l[:i]) >= d:
            break
    print(i)

Python: #!/usr/bin/env python3
# -*- coding: utf-8 -*-

import array
import sys


def solve(ls, v1, v2):
    lsum = sum(ls)
    d1 = v1 * lsum / (v1 + v2)
    d = 0.0
    for i in range(len(ls)):
        d += ls[i]
        if d >= d1:
            break
        else:
            continue
    return i + 1


if __name__ == "__main__":
    for line in sys.stdin:
        vals = array.array("d", map(float, line.split(",")))
        ls = vals[:10]
        v1, v2 = vals[-2:]
        print(solve(ls, v1, v2))

Python: while True:
    try:
        s = list(map(int, input().split(',')))
    except:
        break
    arrL = [s[i] for i in range(10)]
    v1, v2 = s[10], s[11]
    l = sum(arrL) * (v1 / (v1 + v2))
    total = 0
    ans = 0
    while total < l:
        total += arrL[ans]
        ans += 1
    print(ans)

Python: while True:
    try:
        l = list(map(int, input().split(",")))
    except:
        break
    sum_l = sum(l[:10])
    M = sum_l*l[10]/(l[10] + l[11])
    for i in range(10):
        if M <= 0:
            print(i)
            break
        M -= l[i]

Python: import sys

def solve():
    for line in sys.stdin:
        inputs = list(map(int, line.split(',')))
        L = inputs[:10]
        v1, v2 = inputs[10], inputs[11]
        dL = sum(L)
        dv = v1 + v2
        hour = dL / dv
        distance = v1 * hour
        idx = 0
        while True:
            distance -= L[idx]
            if distance <= 0:
                print(idx+1)
                break
            idx += 1

if __name__ == "__main__":
    solve()

Python: from bisect import bisect_left as bl
while True:
    try:
        *l, v1, v2 = map(int, input().split(','))
        a = [l[0]] + [0] * 9
        for i in range(1, 10):
            a[i] = a[i-1] + l[i]
        print(bl(a,a[9]/(v1+v2)*v1) + 1)
    except:
        break

Python: while True:
    try:
        inp = list(map(int, input().split(",")))
        l = inp[0:10]
        l_all = sum(l)
        v1 = inp[10]
        v2 = inp[11]
        l_pass = l_all*v1/(v1 + v2)
        for i in range(10):
            if sum(l[:i]) >= l_pass:
                print(i)
                break
    except:
        break

Python: import sys
readlines = sys.stdin.readlines
write = sys.stdout.write
def solve():
    N = 10
    for line in readlines():
        *L, v1, v2 = map(int, line.split(","))
        LS = sum(L)
        vs = v1 + v2
        s = 0
        for i in range(N):
            l = L[i]
            if s * vs <= v1 * LS <= (s + l) * vs:
                write("%d\n" % (i+1))
                break
            s += l
solve()

Python: while True:
    try:
        n = list(map(int, input().split(',')))
        v2, v1 = n.pop(), n.pop()
        dist = sum(n) * (v1 / (v1 + v2))
        total = 0
        ans = 0
        while total < dist:
            total += n[ans]
            ans += 1
        print(ans)
    except:
        break

Python: while True:
    try:
        line = input()
        l = list(map(int, line.split(',')))[0:10]
        v1, v2 = list(map(int, line.split(',')))[10:12]
    except:
        break
    l = list(map(lambda x: x / sum(l), l))
    x = v1 / (v1 + v2)
    for i in range(10):
        if x <= sum(l[:i + 1]):
            print(i + 1)
            break

Python: while 1:
    try:l=list(map(int,input().split(',')))
    except:break
    b,a=l.pop(),l.pop()
    t=a*(sum(l)/(a+b))
    m=0
    for i in range(10):
        if 0<t-m<l[i]:i+=1;break
        elif not t-m:break
        else:m+=l[i]
    print(i)

Python: import sys
for line in sys.stdin:
    v = list(map(int, line.split(",")))
    k = [sum(v[:i]) for i,j in enumerate(v[:-1])]
    l = v[-2]/(v[-1]+v[-2]) * k[-1]
    n = [a-l if a-l >= 0 else 1e10 for a in k]
    print(n.index(min(n)))

Python: while 1:
    try:
        a = list(map(float, input().split(',')))
        dis = sum(a[:10])
        x = a[10] * dis / (a[10] + a[11])
        for i in range(0, 11):
            if x <= sum(a[:i]):
                print(i)
                break
    except:
        break

Python: import sys
a=[]
for i in range(10):
    a.append(-1)

for line in sys.stdin.readlines():
    a[0], a[1], a[2], a[3], a[4], a[5], a[6], a[7], a[8], a[9], s1, s2=map(int,line.split(','))
    time=sum(a)/(s1+s2)
    if(s1<=s2):
        d=s1*time
        for i in range(10):
            if(d>0):
                d=d-a[i]
            else:
                print(i)
                break
    else:
        d=s2*time

        for i in range(9,0,-1):
            if(d>0):
                d=d-a[i]
               # print("d:",d)
            else:
                print(i+2)
                break

Python: while True:
    try:
        l1,l2,l3,l4,l5,l6,l7,l8,l9,l10,v1,v2=map(int,input().split(","))
        kyo=0
        for i in l1,l2,l3,l4,l5,l6,l7,l8,l9,l10:
            kyo +=i
        v=v1+v2
        x=kyo/v
        ans=v1*x
        flag=0
        for j in l1,l2,l3,l4,l5,l6,l7,l8,l9,l10:
            if ans>0:
                ans -=j
                flag +=1
            elif ans<=0:
                print(flag)
                break
    except:break