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):

import sys
import math
from bisect import bisect_left
from bisect import bisect_right
from collections import defaultdict
from heapq import heappop, heappush
import itertools
from decimal import *

input = sys.stdin.readline

def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))
def inputStr(): return input()[:-1]

inf = float('inf')
mod = 1000000007




def main():
	x1,x2,x3,x4,x5 = inputMap()

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




if __name__ == "__main__":
	main()

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

answer = 15-a[0]-a[1]-a[2]-a[3]-a[4]

print(answer)

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

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

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


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

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

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

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


if __name__ == "__main__":
    main()

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)
        exit()

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

Solution (Python):


def II(): return int(input())
def MII(): return map(int, input().split())
def LII(): return list(map(int, input().split()))

def main():
    L = input().split()
    ans = 0
    for i, l in enumerate(L):
        if l == '0':
            ans = i + 1
    
    print(ans)


if __name__ == '__main__':
    main()

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

Solution (Python):
def main():
    for i, x in enumerate(map(int, input().split()), start=1):
        if x == 0:
            print(i)
            return


if __name__ == '__main__':
    main()

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

Solution (Python):
x = input().split(' ')

print(x.index('0') + 1)

Solution (Python):
L = input().split()
 
ans = 0
for i, l in enumerate(L):
    if l == '0':
        ans = i+1
        
print(ans)

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()))
for i in range(5):
    if x[i] == 0:
        print(i + 1)

Solution (Python):
import math
a=input().split()
x=1
for i in a:
    if i=="0":
        print(x)
        quit()
    else:
        x=x+1

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

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

Solution (Python):
import sys

def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))

A = [0] + LI()

for i in range(1,6):
    if A[i] != i:
        print(i)
        break

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

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

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 6)
INF = float("inf")
MOD = 10 ** 9 + 7


def input():
    return sys.stdin.readline().strip()


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


if __name__ == "__main__":
    main()

Solution (Python):


import sys































def main():
    mod = 1000000007                
    inf = float('inf')              
    
    sys.setrecursionlimit(10**6)    
    def input(): return sys.stdin.readline().rstrip()
    def ii():    return int(input())
    def isp():   return input().split()
    def mi():    return map(int, input().split())
    def mi_0():  return map(lambda x: int(x)-1, input().split())
    def lmi():   return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():    return list(input())
    
    
    L = lmi()
    print(L.index(0) + 1)


if __name__ == "__main__":
    main()

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

Solution (Python):
li = list(map(int, input().split())) 
for i in range(len(li)):
    if li[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):
l = list(map(int, input().split()))
print(l.index(0) + 1)

Solution (Python):
get=lambda:map(int,input().split())
lget=lambda:list(map(int,input().split()))

X = lget()

for i in X:
  if i == 0:
    print(X.index(i)+1)
    break

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

Solution (Python):
from collections import deque
import math

def Next(): return input()
def NextInt(): return int(Next())
def NextInts(): return map(int,input().split())
def Nexts(): return map(str,input().split())
def NextIntList(): return list(map(int,input().split()))
def RowInts(n): return [input() for i in range(n)]

da = NextIntList()
print(da.index(0)+1)

Solution (Python):


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

for arg in range(len(argsList)):
	if argsList[arg] == 0 : print(str(arg+1))

Solution (Python):


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

for arg in range(len(argsList)):
	if argsList[arg] == 0 : print(str(arg+1))

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

Solution (Python):
print(15-sum([int(i) for i in input().split()]))

Solution (Python):
x = []
y = map(int, input().split())

for num, y_num in enumerate(y):
    if y_num == 0:
        print(num+1)
        break

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

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

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

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

print(sum(range(1, 5 + 1)) - sum(x))

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

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

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

print(list(set(range(1, 5 + 1)) - set(x))[0])

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

for x_i, i in zip(x, range(1, 6)):
  if x_i != i:
    print(i)
    break

Solution (Python):
from sys import stdin




def ii(): return int(stdin.readline())
def fi(): return float(stdin.readline())
def mi(): return map(int, stdin.readline().split())
def fmi(): return map(float, stdin.readline().split())
def li(): return list(mi())
def si(): return stdin.readline().rstrip()
def lsi(): return list(si())

res=['Yes', 'No']


test_case=1
while test_case:
    test_case-=1

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

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

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

Solution (Python):

import sys
import numpy as np


def solve(x: "List[int]"):
    print(np.argmin(x)+1)
    return



def main():
    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)]  
    solve(x)

if __name__ == '__main__':
    main()

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

print(a.index(0)+1)

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

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

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

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

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

Solution (Python):
FAST_IO = 0
if FAST_IO:
    import io, sys, atexit
    read = iter(sys.stdin.read().splitlines()).next
    sys.stdout = _OUTPUT_BUFFER = io.BytesIO()
    @atexit.register
    def write():
        sys.__stdout__.write(_OUTPUT_BUFFER.getvalue())
else:
    read = raw_input
readint = lambda: int(rr())
readlist = lambda: map(int, read().split())



print 15 - sum(readlist())

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

X = list(map(int, input().split()))
for i, v in enumerate(X):
	if v == 0:
		print(i+1)
		break

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

for n in range(1, 6):
    if n not in nums:
        print(n)

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

Solution (Python):
p=list(map(int,input().split()))
x=p.index(0)
print(x+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)

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

Solution (Python):
x1, x2, x3, x4, x5 = map(int, input().split())
Re = 0
if x1!=1:
    Re = Re+1
if x2 != 2:
    Re = Re+2

if x3!=3:
    Re = Re+3
if x4 != 4:
    Re = Re+4
if x5 != 5:
    Re = Re+5
print(Re)

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

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

for i in range(len(X)):
    if X[i] == 0: break

i += 1
print(i)

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

print(a.index(0)+1)

Solution (Python):
*a, = map(int,input().split())
for i,A in enumerate(a):
    if A == 0:
        print(i+1)

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

s= list(input().split())
print(s.index('0')+1)

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

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

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

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

Solution (Python):
import math



def make_divisors(n):
    divisors = []
    for i in range(1, int(n**0.5)+1):
        if n % i == 0:
            divisors.append(i)
            if i != n // i:
                divisors.append(n//i)

    
    return divisors

def ValueToBits(x,digit):
    res = [0 for i in range(digit)]
    now = x
    for i in range(digit):
        res[i]=now%2
        now = now >> 1
    return res

def BitsToValue(arr):
    n = len(arr)
    ans = 0
    for i in range(n):
        ans+= arr[i] * 2**i
    return ans

def ZipArray(a):
    aa = [[a[i],i]for i in range(n)]

    aa.sort(key = lambda x : x[0])
    for i in range(n):
        aa[i][0]=i+1
    aa.sort(key = lambda x : x[1])
    b=[aa[i][0] for i in range(len(a))]
    return b

def ValueToArray10(x, digit):
    ans = [0 for i in range(digit)]
    now = x
    for i in range(digit):
        ans[digit-i-1] = now%10
        now = now //10
    return ans

def Zeros(a,b):
    if(b<=-1):
        return [0 for i in range(a)]
    else:
        return [[0 for i in range(b)] for i in range(a)]

def AddV2(v,w):
    return [v[0]+w[0],v[1]+w[1]]

dir4 = [[1,0],[0,1],[-1,0],[0,-1]]


def clamp(x,y,z):
    return max(y,min(z,x))

class Bit:
    def __init__(self, n):
        self.size = n
        self.tree = [0] * (n + 1)
 
    def sum(self, i):
        s = 0
        while i > 0:
            s += self.tree[i]
            i -= i & -i
        return s
 
    def add(self, i, x):
        while i <= self.size:
            self.tree[i] += x
            i += i & -i
            

def Zaatsu(a):
    a.sort()
    now = a[0][0]
    od = 0
    for i in range(n):
        if(now==a[i][0]):
            a[i][0]=od
        else:
            now = a[i][0]
            od+=1
            a[i][0] = od
    
    a.sort(key = lambda x : x[1])
    return a

class UnionFind:
    def __init__(self, n):
        self.par = [i for i in range(n+1)]
        self.rank = [0] * (n+1)

    
    def find(self, x):
        if self.par[x] == x:
            return x
        else:
            self.par[x] = self.find(self.par[x])
            return self.par[x]

    
    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)
        if self.rank[x] < self.rank[y]:
            self.par[x] = y
        else:
            self.par[y] = x
            if self.rank[x] == self.rank[y]:
                self.rank[x] += 1

    
    def same_check(self, x, y):
        return self.find(x) == self.find(y)


'''
def cmb(n, r, p):
    if (r < 0) or (n < r):
        return 0
    r = min(r, n - r)
    return fact[n] * factinv[r] * factinv[n-r] % p

p = 2
N = 10 ** 6 + 2
fact = [1, 1]  
factinv = [1, 1]  
inv = [0, 1]  

for i in range(2, N + 1):
    fact.append((fact[-1] * i) % p)
    inv.append((-inv[p % i] * (p // i)) % p)
    factinv.append((factinv[-1] * inv[-1]) % p)

'''

def rl(x):
    return range(len(x))










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

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

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

print(A.index(0) + 1)

Solution (Python):
import math
from collections import deque
from collections import defaultdict
import itertools as it
 

def readInt():
 return int(input())
def readInts():
 return list(map(int, input().split()))
def readChar():
 return input()
def readChars():
 return input().split()
def factorization(n):
 res = []
 if n%2==0:
  res.append(2)
 for i in range(3,math.floor(n//2)+1,2):
  if n%i==0:
   c = 0
   for j in res:
    if i%j==0:
     c=1
   if c==0:
    res.append(i)
 return res
def fact2(n):
 p = factorization(n)
 res = []
 for i in p:
  c=0
  z=n
  while 1:
   if z%i==0:
    c+=1
    z/=i
   else:
    break
  res.append([i,c])
 return res
def fact(n):
 ans = 1
 m=n
 for _i in range(n-1):
  ans*=m
  m-=1
 return ans
def comb(n,r):
 if n<r:
  return 0
 l = min(r,n-r)
 m=n
 u=1
 for _i in range(l):
  u*=m
  m-=1
 return u//fact(l)
def combmod(n,r,mod):
 return (fact(n)/fact(n-r)*pow(fact(r),mod-2,mod))%mod
def printQueue(q):
 r=copyQueue(q)
 ans=[0]*r.qsize()
 for i in range(r.qsize()-1,-1,-1):
  ans[i] = r.get()
 print(ans)
class UnionFind():
 def __init__(self, n):
  self.n = n
  self.parents = [-1]*n
 
 def find(self, x): 
  if self.parents[x]<0:
   return x
  else:
   self.parents[x] = self.find(self.parents[x])
   return self.parents[x]
 
 def union(self,x,y):
  x = self.find(x)
  y = self.find(y)
 
  if x==y:
   return
 
  if self.parents[x]>self.parents[y]:
   x,y = y,x
 
  self.parents[x]+=self.parents[y]
  self.parents[y]=x
 
 def size(self,x):
  return -1*self.parents[self.find(x)]
 
 def same(self,x,y):
  return self.find(x)==self.find(y)
 
 def members(self,x): 
  root = self.find(x)
  return [i for i in range(self.n) if self.find(i)==root]
 
 def roots(self):
  return [i for i,x in enumerate(self.parents) if x<0]
 
 def group_count(self):
  return len(self.roots())
 
 def all_group_members(self):
  return {r: self.members(r) for r in self.roots()} 
def bitArr(n):
 x = 1
 zero = "0"*n
 ans = []
 ans.append([0]*n)
 for i in range(2**n-1):
  ans.append(list(map(lambda x:int(x),list((zero+bin(x)[2:])[-1*n:]))))
  x+=1
 return ans;
def arrsSum(a1,a2):
 for i in range(len(a1)):
  a1[i]+=a2[i]
 return a1
def maxValue(a,b,v):
 v2 = v
 for i in range(v2,-1,-1):
  for j in range(v2//a+1): 
   k = i-a*j
   if k%b==0:
    return i
 return -1
def copyQueue(q):
 nq = queue.Queue()
 n = q.qsize()
 for i in range(n):
  x = q.get()
  q.put(x)
  nq.put(x)
 return nq
def get_sieve_of_eratosthenes(n):
 
 data = [0,0,0]
 for i in range(3,n+1,2):
  data.append(i)
  data.append(0)
 for i in range(len(data)):
  interval = data[i]
  if interval!=0:
   for j in range(i+interval,n-1,interval):
    data[j] = 0
 
 ans = data[:]
 return ans
 
x = readInts()
 
for i in range(1,6):
 if x[i-1]!=i:
  print(i)

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

Solution (Python):
ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))

n = li()

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

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

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

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

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

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

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()))

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

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

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):
print(input().split().index('0')+1)

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

Solution (Python):
var = input()
l = var.split(' ')
count = 1
for i in l:
  if int(i) != count:
    print(count)
  count = count + 1

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

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

if __name__ == "__main__":
    main()

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

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):


x_list = list(map(int, input().rstrip().split()))


print( x_list.index(0) + 1 )

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

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()))
print(x.index(0) + 1)

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

for i,v in enumerate(h):
    if v == 0:
        print (i+1)

Solution (Python):
x1,x2,x3,x4,x5=map(int,input().split())
X=[x1,x2,x3,x4,x5]
print (X.index(0)+1)

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


print(x.index(0) + 1)

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

Solution (Python):
S = input().split()
count =0
for i in S:
    count+=1
    if int(i)==0:
        ans =count
print(ans)

Solution (Python):
*X, = map(int, input().split())
for i in (1, 2, 3, 4, 5):
    if i != X[i - 1]:
        print(i)
        exit()

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

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

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

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

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

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

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

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):
a = list(map(int,input().split()))
print(a.index(0) + 1)

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

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


if num_list[0] == 0:
  print(1)
elif num_list[1] == 0:
  print(2)
elif num_list[2] == 0:
  print(3)
elif num_list[3] == 0:
  print(4)
elif num_list[4] == 0:
  print(5)

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

for num in range(5):
  if i[num] == "0":
    break

print(num + 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()))

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

print("{}".format(ret))

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)
else:
    print(5)

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

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

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

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

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):
print([int(i) for i in input().split()].index(0)+1)

Solution (Python):
import sys
def input(): return sys.stdin.readline().rstrip()
def main():
    x=list(map(int,input().split()))
    print(x.index(0)+1)

if __name__=='__main__':
    main()

Solution (Python):

in_data = [int(x) for x in input().split(' ')]
result = 0

for i in range(5):
  if in_data[i] != 0:
    continue
  result = i+1

print(result)

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

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

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

Solution (Python):
x = str(input())
if x == "0 2 3 4 5":
    print(1)
elif x == "1 0 3 4 5":
    print(2)
elif x == "1 2 0 4 5":
    print(3)
elif x == "1 2 3 0 5":
    print(4)
else:
    print(5)

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

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

for i in a:
	if i == 0:
		print(a.index(i)+1)

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

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

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

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

Solution (Python):
x = "".join(input().split(" "))
print(x.find('0')+1)

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

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

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

Solution (Python):
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
import string
from bisect import bisect_left, bisect_right
from math import factorial, ceil, floor, gcd
from operator import mul
from functools import reduce
from operator import mul
import pprint



sys.setrecursionlimit(2147483647)
INF = 100
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 = 1000000007


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

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

Solution (Python):

def main():
    xs = list(map(int, input().split()))
    for i, xs in enumerate(xs):
        if i+1 != xs:
            print(i+1)
            return

if __name__ == '__main__':
    main()

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



if __name__ == "__main__":
    main()

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

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

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

print(x.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):
li=list(map(int,input().split()))
print(li.index(0)+1)

Solution (Python):
from sys import stdin, stdout
import sys
import bisect
INF=1e9
def get_int(): return int(stdin.readline().strip())
def get_ints(): return map(int,stdin.readline().strip().split()) 
def get_array(): return list(map(int,stdin.readline().strip().split()))
def get_string(): return stdin.readline().strip()
def op(c): return stdout.write(c)


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

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

Solution (Python):
import math

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


def b():
    print('')



def c():
    print('')



def d():
    print('')


a()

Solution (Python):
import sys

input_methods=['clipboard','file','key']
using_method=0
input_method=input_methods[using_method]

tin=lambda : map(int, input().split())
lin=lambda : list(tin())
mod=1000000007



def main():
	
	
	
	al = lin()
	for i in range(1,6):
		if i not in al:
			print(i)
	
	

isTest=False

def pa(v):
	if isTest:
		print(v)
		
def input_clipboard():
	import clipboard
	input_text=clipboard.get()
	input_l=input_text.splitlines()
	for l in input_l:
		yield l

if __name__ == "__main__":
	if sys.platform =='ios':
		if input_method==input_methods[0]:
			ic=input_clipboard()
			input = lambda : ic.__next__()
		elif input_method==input_methods[1]:
			sys.stdin=open('inputFile.txt')
		else:
			pass
		isTest=True
	else:
		pass
		
			
	ret = main()
	if ret is not None:
		print(ret)

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):
N = list(map(int,input().split()))
for i,n in enumerate(N):
    if n == 0:
        ans = i+1
        break

print(ans)

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

Solution (Python):
L = map(int, input().split())
count = 1
for num in L:
  if num == 0:
    print(count)
  else:
    count += 1

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

ans = 0
index = 0

for i in c:
  if i == 0:
    ans = index + 1
  index += 1

print(ans)

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


i=1
for num in arr:
    if(num==0):
        print(i)
    else:
        i = i +1

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

if __name__ == "__main__":
    main()

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

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

print(result)

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)
elif b == 0:
    print(2)
elif c == 0:
    print(3)
elif d == 0:
    print(4)
elif e == 0:
    print(5)

Solution (Python):
a = list(map(int, input().split()))
n = len(a)
print((n * (n+1) // 2) - sum(a))

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

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

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

Solution (Python):
def main():

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

        if 1 not in var:
                ans = 1
        elif 2 not in var:
                ans = 2
        elif 3 not in var:
                ans = 3
        elif 4 not in var:
                ans = 4
        else:
                ans = 5

        return ans

if __name__=="__main__":
        ans = main()
        print(ans)

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

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

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

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

ans = x.index(0)

print(ans+1)

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

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

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

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

Solution (Python):
import sys
from math import sqrt, gcd, ceil, log
from bisect import bisect
from collections import defaultdict
inp = sys.stdin.readline
read = lambda: list(map(int, inp().strip().split()))





def solve():
	print(read().index(0)+1)






if __name__ == "__main__":
	solve()

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

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

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

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

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

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