Problem:
 Score : 100 points    Problem Statement We have five variables x_1, x_2, x_3, x_4, and x_5 .  The variable x_i was initially assigned a value of i .  Snuke chose one of these variables and assigned it 0 .  You are given the values of the five variables after this assignment.  Find out which variable Snuke assigned 0 .      Constraints  The values of x_1, x_2, x_3, x_4, and x_5 given as input are a possible outcome of the assignment by Snuke.         Input Input is given from Standard Input in the following format:  x_1  x_2  x_3  x_4  x_5       Output If the variable Snuke assigned 0 was x_i , print the integer i .        Sample Input 1 0 2 3 4 5      Sample Output 1 1  In this case, Snuke assigned 0 to x_1 , so we should print 1 .       Sample Input 2 1 2 0 4 5      Sample Output 2 3

Solution (Python):
x = list(map(int,input().split()))
for i in range(5):
    if x[i] == 0:
        print(i+1)

Solution (Python):
A = list(map(int, input().split()))

print(A.index(0) + 1)

Solution (Python):


from typing import *
import itertools
import math
import sys

INF = float('inf')


def solve(x: "List[int]"):
    return x.index(0) + 1


def main():

    sys.setrecursionlimit(10 ** 6)

    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    x = [int(next(tokens)) for _ in range(5)]  
    print(solve(x))


if __name__ == '__main__':
    main()

Solution (Python):
x=list(input().split())
print(x.index("0")+1)

Solution (Python):
x = [int(xi) for xi in input().split()]

print(x.index(0) + 1)

Solution (Python):
x = list(map(int,input().split()))

print(15-x[0]-x[1]-x[2]-x[3]-x[4])

Solution (Python):
x = list(map(int,input().split()))
for i in range(5):
    if x[i] ==0:
        ans = i+1
    
print(ans)

Solution (Python):
xlist = list(map(int,input().split()))
cnt = 0
for i in xlist:
    cnt += 1
    if i == 0:
        print(cnt)

Solution (Python):
xlist = list(map(int,input().split()))
cnt = 0
for i in xlist:
    cnt = cnt +1
    if i == 0:
        print(cnt)

Solution (Python):

from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]
dy8, dx8 = [0, -1, 0, 1, 1, -1, -1, 1], [1, 0, -1, 0, 1, 1, -1, -1]


def inside(y, x, H, W):
    return 0 <= y < H and 0 <= x < W


def ceil(a, b):
    return (a + b - 1) // b


def sum_of_arithmetic_progression(s, d, n):
    return n * (2 * s + (n - 1) * d) // 2


def gcd(a, b):
    if b == 0:
        return a
    return gcd(b, a % b)


def lcm(a, b):
    g = gcd(a, b)
    return a / g * b


def solve():
    l = list(map(int, input().split()))
    print(l.index(0) + 1)
    

def main():
    solve()


if __name__ == '__main__':
    main()

Solution (Python):
import sys
X=map(int, sys.stdin.readline().split())
print X.index(0)+1

Solution (Python):
x=list(map(int,input().split()))
print(x.index(0)+1)

Solution (Python):
S=list(map(int,input().split()))
for i in range(5):
    if S[i]==0:
        print(i+1)

Solution (Python):
X = list(map(int, input().split()))

ans = None
for i, xi in enumerate(X):
    if xi == 0:
        ans = i + 1

print(ans)

Solution (Python):
Xlist=list(map(int,input().split()))

ans=1
for X in Xlist:
	if X==0:
		print(ans)
	else:
		ans=ans + 1

Solution (Python):
x=list(map(int,input().split()))
for i in range(len(x)):
    if x[i]==0:
        print(i+1)
        break

Solution (Python):
X = input().split()
for i in range(5):
	if X[i] == '0':
		print(i+1)

Solution (Python):
xs = list(map(int, input().split()))
print(xs.index(0) + 1)

Solution (Python):
a=list(map(int, input().split()))
print(a.index(0)+1)

Solution (Python):
x = list(map(int, input().split()))
for i in range(5):
  if x[i] == 0:
    print(i+1)
    break

Solution (Python):
i_list = i = list(map(int, input().split()))
print(i_list.index(0) + 1)

Solution (Python):
import math
import sys
readline = sys.stdin.readline


def main():
    print(list(map(int, readline().rstrip().split())).index(0) + 1)


if __name__ == '__main__':
    main()

Solution (Python):
s = input()
lst = list(map(int,s.split()))
res = lst.index(0)
print(res+1)

Solution (Python):
array = list(map(int, input().split()))
print(array.index(0)+1)

Solution (Python):
x = list(map(int, input().split()))

print(x.index(0) + 1)

Solution (Python):
x = list(map(int,input().split()))
print(15-sum(x))

Solution (Python):
s=list(input().split())
for i in range(5):
  if s[i]=="0":
    print(i+1)
    exit()

Solution (Python):
class place:

    def __init__(self, a):
        b = len(a)
        
        for i in range(len(a)):
            if(a[i] == 0):
                print(i + 1)
                break



a = list(map(int,input().split()))
place(a)

Solution (Python):

def main():
    xls = list(map(int, input().split()))
    i = 1
    for _ in xls:
        if _ == 0:
            break
        else:
            i += 1

    print(i)



main()

Solution (Python):
x=list(map(int,input().split()))
print(x.index(0)+1)

Solution (Python):
l=list(map(int, input().split()))
print(l.index(0)+1)

Solution (Python):
a = list(map(int,input().split()))

T = a.index(0)
print(T+1)

Solution (Python):
x=list(map(int,input().split()))
print(15-sum(x))

Solution (Python):
X=list(map(int,input().split()))
for i in range(5):
    if X[i]==0:
        print(i+1)
        break

Solution (Python):
x=list(map(int,input().split()))
sum=0
for i in x:
    sum+=i
print(15-sum)

Solution (Python):
X=list(map(int,input().split()))
for i in range(5):
  if X[i]==0:
    print(i+1)

Solution (Python):
L = input().split()

for i in range(5):
    if L[i] == '0' :
        print(i+1)
        exit()

Solution (Python):
lis = input().split()
i = lis.index('0')

if i==0:
    ans = int(lis[1])-1
    print(ans)
else:
    ans = int(lis[i-1])+1
    print(ans)

Solution (Python):
S = sum(map(int, input().split()))

print(15 - S)

Solution (Python):
x = list(map(int,input().split()))

for i in range(5):
    if x[i] == 0:
        print(i + 1)

Solution (Python):
X = input().split()

for i in range(len(X)):
  if X[i] == '0' :
    print(i+1)
    exit()

Solution (Python):
x1, x2, x3, x4, x5 = map(int, input().split())
if x1 == 0:
    print(1)
elif x2 == 0:
    print(2)
elif x3 == 0:
    print(3)
elif x4 == 0:
    print(4)
else:
    print(5)

Solution (Python):
nList = list(map(int, input().split()))

print(nList.index(0) + 1)

Solution (Python):
a = [int(x) for x in input().split(" ")]
for i, x in enumerate(a):
	if x == 0:
		print(i+1)

Solution (Python):
import sys
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def I(): return int(sys.stdin.buffer.readline())
def LS(): return sys.stdin.buffer.readline().rstrip().decode('utf-8').split()
def S(): return sys.stdin.buffer.readline().rstrip().decode('utf-8')
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def LSR(n): return [LS() for i in range(n)]
def SRL(n): return [list(S()) for i in range(n)]
def MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]
mod = 10 ** 9 + 7

li = LI()



print(15-sum(li))

Solution (Python):
arr = list(map(int, input().split()))
print(arr.index(0) + 1)

Solution (Python):
a = list(map(int, input().split()))

for i in range(5):
    if a[i] == 0:
        print(i+1)

Solution (Python):
x = list(map(int, input().split()))

cnt = 0
for xx in x:
	cnt += 1
	if xx == 0:
		print(cnt)

Solution (Python):
import sys
import numpy as np
from heapq import heappush, heappop 
from bisect import bisect_left as bi_l, bisect_right as bi_r
from collections import deque, Counter, defaultdict
from itertools import combinations, product
inf = float('inf')
MOD = 10**9+7



class ABC001():
  def A():
    h1, h2 = map(int, sys.stdin.read().split())
    print(h1-h2)

  def B(): pass
  def C(): pass 
  def D(): pass 


class ABC002():
  def A():
    x, y = map(int, sys.stdin.readline().split())
    print(max(x, y))

  def B():
    vowels = set('aeiou')
    s = sys.stdin.readline().rstrip() 
    t = ''
    for c in s:
      if c in vowels: continue 
      t += c 
    print(t)

  def C():
    *coords, = map(int, sys.stdin.readline().split())
    def triangle_area(x0, y0, x1, y1, x2, y2):
      x1 -= x0; x2 -= x0; y1 -= y0; y2 -= y0;
      return abs(x1*y2 - x2*y1) / 2
    print(triangle_area(*coords))

  def D():
    n, m = map(int, sys.stdin.readline().split())
    edges = set()
    for _ in range(m):
      x, y = map(int, sys.stdin.readline().split())
      x -= 1; y -= 1
      edges.add((x, y))
    cand = []
    for i in range(1, 1<<n):
      s = [j for j in range(n) if i>>j & 1]
      for x, y in combinations(s, 2):
        if (x, y) not in edges: break
      else:
        cand.append(len(s))
    print(max(cand))


class ABC003():
  def A():
    n = int(sys.stdin.readline().rstrip())
    print((n+1)*5000)

  def B():
    atcoder = set('atcoder')
    s, t = sys.stdin.read().split()
    for i in range(len(s)):
      if s[i] == t[i]: continue
      if s[i] == '@' and t[i] in atcoder: continue 
      if t[i] == '@' and s[i] in atcoder: continue
      print('You will lose')
      return 
    print('You can win')

  def C():
    n, k, *r = map(int, sys.stdin.read().split())
    res = 0
    for x in sorted(r)[-k:]:
      res = (res+x) / 2
    print(res)

  def D(): pass 


class ABC004():
  def A():
    print(int(sys.stdin.readline().rstrip())*2)

  def B():
    c = [sys.stdin.readline().rstrip() for _ in range(4)]
    for l in c[::-1]:
      print(l[::-1])

  def C():
    n = int(sys.stdin.readline().rstrip())
    n %= 30
    res = list(range(1, 7))
    for i in range(n):
      i %= 5
      res[i], res[i+1] = res[i+1], res[i]
    print(''.join(map(str, res)))

  def D(): pass 


class ABC005():
  def A():
    x, y = map(int, sys.stdin.readline().split())
    print(y//x)

  def B():
    n, *t = map(int, sys.stdin.read().split())
    print(min(t))

  def C():
    t = int(sys.stdin.readline().rstrip())
    n = int(sys.stdin.readline().rstrip())
    a = [int(x) for x in sys.stdin.readline().split()]
    m = int(sys.stdin.readline().rstrip())
    b = [int(x) for x in sys.stdin.readline().split()]
    i = 0
    for p in b:
      if i == n: print('no'); return 
      while p-a[i] > t:
        i += 1
        if i == n: print('no'); return 
      if a[i] > p: print('no'); return 
      i += 1
    print('yes')

  def D():
    n = int(sys.stdin.readline().rstrip())
    d = np.array([sys.stdin.readline().split() for _ in range(n)], np.int64)
    s = d.cumsum(axis=0).cumsum(axis=1)
    s = np.pad(s, 1)
    max_del = np.zeros((n+1, n+1), dtype=np.int64)
    for y in range(1, n+1):
      for x in range(1, n+1):
        max_del[y, x] = np.amax(s[y:n+1, x:n+1] - s[0:n-y+1, x:n+1] - s[y:n+1, 0:n-x+1] + s[0:n-y+1, 0:n-x+1])
    res = np.arange(n**2+1)[:, None]
    i = np.arange(1, n+1)
    res = max_del[i, np.minimum(res//i, n)].max(axis=1)
    q = int(sys.stdin.readline().rstrip())
    p = np.array(sys.stdin.read().split(), dtype=np.int64)
    print(*res[p], sep='\n')


class ABC006():
  def A():
    n = sys.stdin.readline().rstrip()
    if '3' in n: print('YES')
    elif int(n)%3 == 0: print('YES')
    else: print('NO')

  def B():
    mod = 10007
    t = [0, 0, 1]
    for _ in range(1001001):
      t.append(t[-1]+t[-2]+t[-3]); t[-1] %= mod
    n = int(sys.stdin.readline().rstrip())
    print(t[n-1])
    
  def C():
    n, m = map(int, sys.stdin.readline().split())
    cnt = [0, 0, 0]
    if m == 1: cnt = [-1, -1, -1]
    else:
      if m & 1: m -= 3; cnt[1] += 1; n -= 1
      cnt[2] = m//2 - n 
      cnt[0] = n - cnt[2]
    if cnt[0]<0 or cnt[1]<0 or cnt[2]<0: print(-1, -1, -1)
    else: print(*cnt, sep=' ')
      
  def D():
    n, *c = map(int, sys.stdin.read().split())
    inf = float('inf')
    lis = [inf]*n 
    for x in c: lis[bi_l(lis, x)] = x 
    print(n - bi_l(lis, inf))


class ABC007():
  def A():
    n = int(sys.stdin.readline().rstrip())
    print(n-1)

  def B():
    s = sys.stdin.readline().rstrip()
    if s == 'a': print(-1)
    else: print('a')

  def C():
    r, c = map(int, sys.stdin.readline().split())
    sy, sx = map(int, sys.stdin.readline().split())
    gy, gx = map(int, sys.stdin.readline().split())
    sy -= 1; sx -=1; gy -= 1; gx -= 1
    maze = [sys.stdin.readline().rstrip() for _ in range(r)]
    queue = deque([(sy, sx)])
    dist = np.full((r, c), np.inf); dist[sy, sx] = 0
    while queue:
      y, x = queue.popleft()
      for i, j in [(-1, 0), (1, 0), (0, -1), (0, 1)]:
        i += y; j += x
        if maze[i][j] == '
        dist[i, j] = dist[y, x] + 1
        queue.append((i, j))
    print(int(dist[gy, gx]))
  
  def D(): pass 


class ABC008():
  def A():
    s, t = map(int, sys.stdin.readline().split())
    print(t-s+1)

  def B():
    n, *s = sys.stdin.read().split()
    res = defaultdict(int)
    for name in s: res[name] += 1
    print(sorted(res.items(), key=lambda x: x[1])[-1][0])

  def C():
    n, *a = map(int, sys.stdin.read().split())
    a = np.array(a)
    c = n - np.count_nonzero(a[:, None]%a, axis=1)
    print(np.sum((c+1)//2/c))
  
  def D(): pass

class ABC009():
  def A():
    n = int(sys.stdin.readline().rstrip())
    print((n+1)//2)

  def B():
    n, *a = map(int, sys.stdin.read().split())
    print(sorted(set(a))[-2])
    
  def C():
    n, k = map(int, sys.stdin.readline().split())
    s = list(sys.stdin.readline().rstrip())
    cost = [1]*n
    r = k
    for i in range(n-1):
      q = []
      for j in range(i+1, n):
        if s[j] < s[i] and cost[i]+cost[j] <= r:
          heappush(q, (s[j], cost[i]+cost[j], -j))
      if not q: continue
      _, c, j = heappop(q); j = -j 
      s[i], s[j] = s[j], s[i]
      r -= c 
      cost[i] = cost[j] = 0
    print(''.join(s))
      
  def D(): pass 


class ABC010():
  def A():
    print(sys.stdin.readline().rstrip()+'pp')
  def B():
    n, *a = map(int, sys.stdin.read().split())
    tot = 0
    for x in a:
      c = 0 
      while x%2==0 or x%3==2:
        x -= 1
        c += 1
      tot += c
    print(tot)

  def C():
    sx, sy, gx, gy, t, v, n, *xy = map(int, sys.stdin.read().split())
    x, y = np.array(xy).reshape(-1, 2).T
    def dist(x1, y1, x2, y2):
      return np.sqrt((x2-x1)**2 + (y2-y1)**2)
    ans = 'YES' if (dist(sx, sy, x, y)+dist(x, y, gx, gy) <= v*t).any() else 'NO'
    print(ans)

  def D(): pass 

class ABC011():
  def A():
    n = int(sys.stdin.readline().rstrip())
    print(n%12+1)

  def B():
    s = sys.stdin.readline().rstrip() 
    print(s[0].upper()+s[1:].lower())

  def C():
    n, *ng = map(int, sys.stdin.read().split())
    ng = set(ng)
    if n in ng: print('NO')
    else:
      r = 100
      while n > 0:
        if r == 0: print('NO'); return
        for i in range(3, 0, -1):
          if (n-i) in ng: continue 
          n -= i
          r -= 1
          break 
        else: print('NO'); return 
      print('YES')

  def D(): pass 


class ABC170():
  def A():
    x = [int(x) for x in sys.stdin.readline().split()]
    for i in range(5):
      if x[i] != i+1:
        print(i+1)
        break
  def B(): pass
  def C(): pass 
  def D(): pass 
  def E(): pass 
  def F(): pass 

if __name__ == '__main__':
  ABC170.A()

Solution (Python):
nums = list(map(int, input().split()))
print(nums.index(0)+1)

Solution (Python):
nums = list(map(int, input().split()))
print(nums.index(0)+1)

Solution (Python):
nums = list(input().split())
c = 0
for i in nums:
    c = c+1
    if i == '0':
        print(c)

Solution (Python):
nums = list(input().split())
for i, j in enumerate(nums):
    if j == '0':
        print(i+1)

Solution (Python):
nums = list(input().split())
for i, j in enumerate(nums):
    if j == '0':
        print(i+1)
        break

Solution (Python):
X = list(map(int, input().split()))

print(X.index(0)+1)

Solution (Python):
X = list(map(int, input().split()))
print(X.index(0) + 1)

Solution (Python):
x = list(map(int, input().split()))
for i in range(5):
    if x[i] == 0:
        print(i + 1)
        exit()

Solution (Python):
X = [int(i) for i in input().split()]
print(X.index(0)+1)

Solution (Python):
x = list(map(int,input().split()))
for i in range(len(x)):
    if x[i] == 0:
        print(i+1)

Solution (Python):
def solution():
    user_input = input()
    user_input = user_input.split()
    for i in range(len(user_input)):
        if user_input[i] == '0':
            print(i+1)
            



solution()

Solution (Python):
X = list(map(int,input().split()))

for i in range(len(X)):
    if X[i] == 0:
        print(i+1)

Solution (Python):
m =list(map(int, input().split()))
for i in range(len(m)):
    if m[i] == 0:
        print(i + 1)

Solution (Python):
m =list(map(int, input().split()))
for i in range(5):
    if m[i] == 0:
        print(i + 1)

Solution (Python):
X = list(map(int, input().split()))

for i in range(len(X)):
    if X[i] != i+1:
        print(i+1)


if __name__ == '__main__':
    print()

Solution (Python):
x = list(map(int,input().split()))
print(int(x.index(0))+1)

Solution (Python):
X = list(map(int, input().split()))

for i in range(len(X)):
    if X[i] != i+1:
        print(i+1)

Solution (Python):
x = list(map(int,input().split()))
for i in range(len(x)):
  if (x[i]==0):
    print(i+1)

Solution (Python):
def a170(x):

    for index, i in enumerate(x):
        if i == 0:
            return index+1

def main():
    x = list(map(int, input().split()))
    print(a170(x))

if __name__ == '__main__':
    main()

Solution (Python):
x = list(map(int,input().split()))
i = 0
for i in range(len(x)):
    if x[i] == 0:
        print (i+1)
        break

Solution (Python):


















x = list(map(int,input().split()))


for i in range(len(x)):
    if x[i] == 0:
        print(i+1)
        exit()

Solution (Python):
a_list = list(map(int, input().split()))

for i in range(len(a_list)):
    if a_list[i] == 0:
        print(i+1)

Solution (Python):
k = list(map(int, input().split()))

for i in range(0, 5):
    if k[i] == 0:
        print(i + 1)
        break

Solution (Python):
five = input()
lst_five = five.split(" ")

for i in range(len(lst_five)):
    if lst_five[i] == "0":
        print(i+1)

Solution (Python):
x1, x2, x3, x4, x5 = map(int,input().split())
print(15-x1-x2-x3-x4-x5)

Solution (Python):
A = list(map(int, input().split()))
print(A.index(0)+1)

Solution (Python):
ans = list(map(int, input().split(' '))).index(0) + 1
print(ans)

Solution (Python):
X=list(map(int,input().split()))
for i in range(5):
  if X[i]==0:
    print(i+1)

Solution (Python):
books1= list(map(int, input().split()))
i=0
while(i<len(books1)):
  if(books1[i]==0):
    break
  i+=1
print(i+1)

Solution (Python):
a = [int(x) for x in input().split()]
for i in range(5):
  if a[i] == 0:
    print(i+1)
    exit(0)

Solution (Python):
li = list(map(int,input().split()))
for i, j in enumerate(li):
  if j == 0:
    print(i + 1)

Solution (Python):
l = input().split()
print(l.index('0')+1)

Solution (Python):
import sys
sys.setrecursionlimit(10**8)
def line_to_int(): return int(sys.stdin.readline())
def line_to_each_int(): return map(int, sys.stdin.readline().split())
def line_to_list(): return list(map(int, sys.stdin.readline().split()))
def line_to_list_in_iteration(N): return [list(map(int, sys.stdin.readline().split())) for i in range(N)]






x = line_to_list()
print(x.index(0)+1)

Solution (Python):
x = list(map(int,input().split()))

for i in range(5):
    if x[i] != i+1:
        print(i+1)

Solution (Python):
x = list(map(int, input().split()))
for i in range(len(x)):
  if x[i] == 0:
    print(i+1)
    break

Solution (Python):
import sys
line = sys.stdin.readlines()[0].rstrip("\n")
nums = line.split(" ")
print(nums.index("0") + 1)

Solution (Python):
import sys
lines = list(s.rstrip("\n") for s in sys.stdin)
numbers = list(map(int, lines[0].split(" ")))
for i, value in enumerate(numbers):
    if value == 0:
        print(i + 1)
        break

Solution (Python):
l = input().split()

print(l.index("0") + 1)

Solution (Python):
x = [int(x) for x in input().split()]

print(x.index(0) + 1)

Solution (Python):
n = list(map(int,input().split()))

num = 0
for i,x in enumerate(n):
    if (x == 0):
        num = i+1
        break;
print(num)

Solution (Python):

def main():
  a = list(map(int,input().split()))
  ans = 0
  for i in range(5):
      ans += a[i]
  print(15 - ans)
main()

Solution (Python):
x = list(map(int,input().split()))
print(x.index(0)+1)

Solution (Python):
print(input().split().index('0') + 1)

Solution (Python):
a = list(map(int,input().split()))
print(a.index(0)+1)

Solution (Python):
X = list(map(int,input().split()))
for i,x in enumerate(X):
    if x == 0:
        print(i+1)
        exit(0)

Solution (Python):
x =[0]+ [int(x) for x in input().split()]

for i in range(1,6):
  if x[i]==0:
    print(i)

Solution (Python):
x = list(map(int, input().split()))

for i in range(5):
    if x[i] == 0:
        print(i+1)
        exit()

Solution (Python):
x = input().split(' ')
print(int(x.index('0')) + 1)

Solution (Python):
ans = 0

a = list(map(int,input().split()))

for idx,val in enumerate(a):
    if val == 0:
        ans = idx + 1

print(ans)

Solution (Python):
print(list(map(int, input().split())).index(0)+1)

Solution (Python):
n = list(map(int, input().split()))
print(n.index(0)+1)

Solution (Python):
a=list(map(int,input().split()))
for i in range(5):
    b=a[i]

    if b==0:
        

        print(i+1)

Solution (Python):
x = list(map(int, input().split()))

print(x.index(0)+1)

Solution (Python):
xs = ["X"] + input().split(" ")
print(xs.index("0"))

Solution (Python):
x = list(map(int,input().split()))
sumx = sum(x)
if sumx == 14:
  print(1)
elif sumx == 13:
  print(2)
elif sumx == 12:
  print(3)
elif sumx == 11:
  print(4)
else:
  print(5)

Solution (Python):
a,b,c,d,e = map(int, input().split())
list = [a,b,c,d,e]
for i in range(5):
  if list[i] == 0:
    print(i+1)

Solution (Python):
lists = list(map(int,input().split()))
print(lists.index(0)+1)

Solution (Python):
n = list(map(int, input().split()))
for i in range(len(n)):
    if n[i] == 0:
        print(i + 1)

Solution (Python):
X = list(map(int, input().split()))
for i in range(5):
    if X[i] == 0:
        print(i + 1)

Solution (Python):
a = list(map(int, input().split()))

for i in range(5):
  if a[i] == 0:
    print(i+1)

Solution (Python):
a=list(map(int, input().split()))
print(a.index(0)+1)

Solution (Python):
print(list(map(int,input().split())).index(0)+1)

Solution (Python):
x =  list(map(int,input().split()))

for i in range(5):
    if x[i] ==0:print(i+1)

Solution (Python):
a = input().split()
print(a.index('0')+1)

Solution (Python):
num_list = list(map(int, input().split()))

print(num_list.index(0)+1)

Solution (Python):
x = list(map(int, input().split()))
for i in range(len(x)):
	if x[i] == 0:
		print(i+1)

Solution (Python):
line = list(input().split())
i = 0
while True:
    if line[i] == "0":
        print(i + 1)
        break
    else:
        i += 1

Solution (Python):
x1, x2, x3, x4, x5 = input().split()

if int(x1) == 0:
    print(1)
elif int(x2) == 0:
    print(2)
elif int(x3) == 0:
    print(3)
elif int(x4) == 0:
    print(4)
else:
    print(5)

Solution (Python):
from math import floor,ceil,sqrt,factorial,log
from collections import Counter, deque
from functools import reduce
import numpy as np
def S(): return input()
def I(): return int(input())
def MS(): return map(str,input().split())
def MI(): return map(int,input().split())
def FLI(): return [int(i) for i in input().split()]
def LS(): return list(MS())
def LI(): return list(MI())
def LLS(): return [list(map(str, l.split() )) for l in input()]
def LLI(): return [list(map(int, l.split() )) for l in input()]
def LLSN(n: int): return [LS() for _ in range(n)]
def LLIN(n: int): return [LI() for _ in range(n)]

N = LI()

for i in range(len(N)):
    if N[i] == 0:
        print(i+1)
        exit()

Solution (Python):
def main():
  x = list(map(int,input().split()))
  ans = x.index(0)+1
  print(ans)
  
  
if __name__ == '__main__':
    main()

Solution (Python):
arr = list(map(int, input().split()))
p = arr.index(0)
print(p+1)

Solution (Python):
a = list(map(int, input().split()))
print(15 - sum(a))

Solution (Python):
x = list(map(int,input().split()))
for i in range(len(x)):
    if x[i] != i+1:
        print(i+1)

Solution (Python):
print(input().split().index('0') + 1)

Solution (Python):
a=list(map(int,input().split()))
n=1
for b in a:
    if b==0:
        print(n)
    else:
        n+=1

Solution (Python):
x=list(map(int,input().split()))
for i in range(5):
    if x[i]==0:
        print(i+1)

Solution (Python):
X=list(map(int,input().split()))
print(X.index(0)+1)

Solution (Python):
li = list(map(int,input().split()))
print(li.index(0)+1)

Solution (Python):
def solve(string):
    *x, = map(int, string.split())
    for i in range(1, 6):
        if i != x[i - 1]:
            return str(i)


if __name__ == '__main__':
    import sys
    print(solve(sys.stdin.read().strip()))

Solution (Python):
x = list(map(int, input().split()))
print(x.index(0) + 1)

Solution (Python):
s = input()
list = s.split(" ")
for i in range(5):
  if int(list[i]) == 0:
    print(i+1)

Solution (Python):
x1,x2,x3,x4,x5 = map(int, input().split())
n = 15 - (x1 + x2 + x3 + x4 + x5)
print(n)

Solution (Python):
x_list=list(map(int, input().split()))





print(x_list.index(0) + 1)

Solution (Python):
x_list=list(map(int, input().split()))

for i,x in enumerate(x_list):
  if x == 0:
    print(i + 1)
    break

Solution (Python):
print(list(map(int, input().split())).index(0) + 1)

Solution (Python):
import sys
sys.setrecursionlimit(2147483647)
input=sys.stdin.readline

def main():
  x = list(map(int, input().split(' ')))
  print(15-sum(x))

if __name__=='__main__':
  main()

Solution (Python):
n=list(map(int,input().split()))
print(15-n[0]-n[1]-n[2]-n[3]-n[4])

Solution (Python):
x = list(map(int,input().split()))

print(x.index(0)+1)

Solution (Python):
def main():
    """"ここに今までのコード"""
l = list(map(int, input().split()))
for i in range(len(l)):
    if l[i] == 0:
        print(i+1)

if __name__ == '__main__':
    main()

Solution (Python):
a = list(map(int,input().split()))
for i in range(5):
    if a[i] == 0:
        print(i+1)

Solution (Python):
def function(ar):
    print(ar.index(0)+1)

if __name__ == '__main__':
    ar = list(map(int, input().rstrip().split()))
    function(ar)

Solution (Python):
from sys import stdin, stdout
from time import time
read = stdin.readline
write = stdout.write
flush = stdout.flush
xr = xrange

def main():
	print list(map(int,read().split())).index(0)+1

if __name__ == "__main__":
	main()

Solution (Python):
xs = [int(i) for i in input().split()]
for i,x in enumerate(xs):
    if x == 0:
        ans = i + 1
print(ans)

Solution (Python):
def main():
    args = [int(x) for x in input().split(' ')]
    index = args.index(0) + 1
    print(str(index))


if __name__ == '__main__':
    main()

Solution (Python):
a = list(map(int,input().split()))
print(a.index(0) + 1)

Solution (Python):
print(list(map(int,input().split())).index(0)+1)

Solution (Python):
a = list(map(int, input().split()))
print(sum(range(1, 5 + 1)) - sum(a))

Solution (Python):
a=list(map(int,input().split()))
print(a.index(0)+1)

Solution (Python):
a = list(map(int, input().split()))
print(a.index(0) + 1)

Solution (Python):
a=map(int,input().split())
k=0
for l in a:
  k+=1
  if int(l)==0:
    print(k)

Solution (Python):
x = list(map(int,input().split()))

for i in range(len(x)):
  if (i+1)!=x[i]:
    print(i+1)

Solution (Python):
x = list(map(int, input().split()))

if x[0] == 0:
    print('1')

elif x[1] == 0:
    print('2')

elif x[2] == 0:
    print('3')

elif x[3] == 0:
    print('4')

elif x[4] == 0:
    print('5')

Solution (Python):

def q1():
    xs = [int(i) for i in input().split(" ")]
    for i in range(len(xs)):
        if xs[i] == 0:
            print(i + 1)
            break


q1()

Solution (Python):
print(list(input().split()).index("0")+1)

Solution (Python):
from sys import stdin
goukei = [int(x) for x in stdin.readline().rstrip().split()]
print(15 - sum(goukei))

Solution (Python):
a = list(map(int,input().split()))

for i in range(5):
    if a[i] == 0:
        print(i+1)
        exit()

Solution (Python):
N = list(input().split())
print(N.index("0") + 1)

Solution (Python):
X = list(map(int,input().split()))
print(X.index(0)+1)

Solution (Python):
x = list(map(int,input().split()))
for i in range(6):
    if i not in x:
        print(i)
        break

Solution (Python):
x1,x2,x3,x4,x5 = map(int, input().split())

if x1 == 0:
    print(1)
elif x2 == 0:
    print(2)
elif x3 == 0:
    print(3)
elif x4 == 0:
    print(4)
elif x5 == 0:
    print(5)

Solution (Python):
a=list(map(int,input().split()))
print(15-sum(a))

Solution (Python):
a = list(map(int, input().split()))
b = 0
for i in range(len(a)):
    if a[i] == 0:
        b+=i
print(b+1)

Solution (Python):
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,copy,functools
import time,random,resource

sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]

def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(): return [list(map(int, l.split())) for l in sys.stdin.readlines()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)
def pe(s): return print(str(s), file=sys.stderr)
def JA(a, sep): return sep.join(map(str, a))
def JAA(a, s, t): return s.join(t.join(map(str, b)) for b in a)


def main():
    x = LI()

    return 15 - sum(x)


print(main())

Solution (Python):
v = [int(i) for i in input().split()]

print(v.index(0) + 1)

Solution (Python):
a,b,c,d,e=map(int,input().split())
if(a==0):
    print(1)
if(b==0):
    print(2)
if(c==0):
    print(3)
if(d==0):
    print(4)
if(e==0):
    print(5)

Solution (Python):
var_x = list([int(x) for x in input().split()])

index = var_x.index(0)

print(index+1)

Solution (Python):
l = list(map(int,input().split()))

for i in l:
    if i == 0:
        print(l.index(i)+1)
    else:
        pass

Solution (Python):
l=list(map(int,input().split()))
print(l.index(0)+1)

Solution (Python):
a,b,c,d,e = map(int, input().split())

if a == 0:
    print(1)
if b == 0:
    print(2)
if c == 0:
    print(3)
if d == 0:
    print(4)
if e == 0:
    print(5)

Solution (Python):
x = list(map(int, input().split()))
print(15 - sum(x))

Solution (Python):

xlist=list(map(int,input().split()))
n=xlist.index(0)
print(n+1)

Solution (Python):
a = list(map(int,input().split()))
print(a.index(0) + 1)

Solution (Python):


x = list(map(int, input().split()))

for i, xi in enumerate(x):
  if xi == 0:
    print(i+1)
    break

Solution (Python):
num = input().split()

for key, i in enumerate(num):
  if i == '0':
    print(key+1)
  else:
    continue

Solution (Python):
inp = list(map(int,input().split()))
for i in range(len(inp)):
  if inp[i]==0:
    print (i+1)
    break

Solution (Python):
import sys
input = sys.stdin.readline

X = list(map(int,input().split()))
for i in range(len(X)):
    if X[i] == 0:
        print(i+1)
        break