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 = input().split()
x1 = int(X[0])
x2 = int(X[1])
x3 = int(X[2])
x4 = int(X[3])
x5 = int (X[4])

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

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

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

Solution (Python):

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

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

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

import numpy as np

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

for i in range(len(x)):
    if x[i] == 0:
        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):
a, b, c, d, e = map(int, input().split())
print(15 - a - b - c - d - e)

Solution (Python):
def five_variable():
    variables = [int(i) for i in input().split()]

    if variables[4] == 0:
        result = variables[3] + 1     
    elif variables[0] == 0:
        result = variables[1] - 1 
    elif variables[1] == 0:
        result = variables[2] - 1 
    elif variables[2] == 0:
        result = variables[3] - 1
    elif variables[3] == 0 :
        result = variables[4] -1 

    print(result)
    

five_variable()

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

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

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

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

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

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

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

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

for i in range(0,5):
    if X[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)
        break

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

Solution (Python):
L = input().split()
print(L.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,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)
else:
    print(5)

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

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


for i, v in enumerate(var_list):
    
    if v == 0:
        arg = i

print(arg + 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 = list(map(int, input().split()))

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

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

Solution (Python):

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

Solution (Python):
from sys import stdin


a,b,c,d,e = map(int, stdin.readline().rstrip().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(len(a)):
  if a[i] == 0:
    print(i+1)
    exit()

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

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

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

Solution (Python):
import sys
import itertools

import time
import math
 
sys.setrecursionlimit(10 ** 7)
 
from collections import defaultdict
 
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

X = list(map(int, readline().split()))

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

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

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

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

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

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

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

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

Solution (Python):
import bisect, collections, copy, heapq, itertools, math, numpy, string
import sys
from bisect import bisect_left, bisect_right, insort
from collections import deque
def S(): return sys.stdin.readline().rstrip()
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return map(int, sys.stdin.readline().rstrip().split())
def MS(): return map(str, sys.stdin.readline().rstrip().split())
def LI(): return list(map(int, sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())



import bisect


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

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):
x1, x2, x3, x4, x5 = map(int, input().split())
a = 15 - x1 - x2 - x3 - x4 - x5
print(a)

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

Solution (Python):
a = input().split(" ")
temp = 0
for i, ai in enumerate(a):
    if int(ai)==0:
        temp=i
        break
 
print(temp+1)

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

for v in x:
  if v == 0:
    print(i)
  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):
x = list(map(int, input().split()))
for i in range(5):
    if x[i] == 0:
        print(i+1)
        exit()

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

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

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

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

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

print(sunuke.index(0)+1)

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

Solution (Python):
import copy

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

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

Solution (Python):
A = [int(x) for x in input().split()]
num = 1
for i in A:
    if i == num:
        num += 1
    else:
        print(num)
        break

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

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

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

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

resolve()

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

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

Solution (Python):
a = input().split(" ")

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

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

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

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

Solution (Python):
x = set(map(int,input().split()))
y = {1,2,3,4,5}

print(*y-x)

Solution (Python):

import numpy as np
from functools import *
import sys
sys.setrecursionlimit(100000)
input = sys.stdin.readline



def acinput():
    return list(map(int, input().split(" ")))

x=np.array(acinput())


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

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

Solution (Python):
n = 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:
        break
print(i + 1)

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

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

ans = 0

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

print(ans)

Solution (Python):
line=[int(i) for i in input().split()]
print(line.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_array=map(int,input().split())
for i,x in enumerate(x_array):
    if x==0:
        ans=i+1
        break
print(ans)

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

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

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

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

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

Solution (Python):
variables = input().split()
for i,var in enumerate(variables):
  if var == '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):
l = input().split()

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

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

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

Solution (Python):
x=str(input())
y=x.find('0')
print(int(y/2+1))

Solution (Python):
*a, = map(int, open(0).read().split())
print(a.index(0)+1)

Solution (Python):

given = [int(i) for i in input().split()]
ans = [1,2,3,4,5]

for i in range(len(ans)):
    if ans[i] != given[i]:
        print(ans[i])
        break

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





def RD(): return sys.stdin.read()
def II(): return int(input())
def MI(): return map(int,input().split())
def MF(): return map(float,input().split())
def LI(): return list(map(int,input().split()))
def LF(): return list(map(float,input().split()))
def TI(): return tuple(map(int,input().split()))



def main():
	A=LI()
	print(15-sum(A))





if __name__ == "__main__":
	main()

Solution (Python):
import re
a= map(int, input().split())
for index , item in enumerate(a):
  if item is 0:
    print(index + 1)

Solution (Python):
import os
import sys
from io import BytesIO, IOBase
import math


def inputIntArray():
    return list(map(int, input().rstrip().split()))


def inputArray():
    return input().rstrip().split()


def inputVars():
    return map(int, input().rstrip().split())


def inputNum():
    return int(input())


def main():
    arr = inputIntArray()
    for pos in range(5):
        if arr[pos] == 0:
            print(pos+1)
            break






BUFSIZE = 8192


class FastIO(IOBase):
    newlines = 0

    def __init__(self, file):
        self._fd = file.fileno()
        self.buffer = BytesIO()
        self.writable = "x" in file.mode or "r" not in file.mode
        self.write = self.buffer.write if self.writable else None

    def read(self):
        while True:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            if not b:
                break
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines = 0
        return self.buffer.read()

    def readline(self):
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.newlines = b.count(b"\n") + (not b)
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines -= 1
        return self.buffer.readline()

    def flush(self):
        if self.writable:
            os.write(self._fd, self.buffer.getvalue())
            self.buffer.truncate(0), self.buffer.seek(0)


class IOWrapper(IOBase):
    def __init__(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        self.write = lambda s: self.buffer.write(s.encode("ascii"))
        self.read = lambda: self.buffer.read().decode("ascii")
        self.readline = lambda: self.buffer.readline().decode("ascii")


sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")



if __name__ == "__main__":
    main()

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

print(A.index(0)+1)

Solution (Python):
list_num = [int(_) for _ in input().split()]
print(list_num.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):
i = list(map(int, input().split()))
ans=i.index(0)
print(ans+1)

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

Solution (Python):
def iput(): return int(input())
def mput(): return map(int, input().split())
def lput(): return list(map(int, input().split()))

def solve():
    x = lput()
    print(x.index(0)+1)
    return 0

if __name__ == "__main__":
    solve()

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

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

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

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

Solution (Python):

MOD=10**9+7
INT_MAX=10**20+7
def INPUT():return list(int(i) for i in input().split())
def LIST_1D_ARRAY(n):return [0 for _ in range(n)]
def LIST_2D_ARRAY(m,n):return [[0 for _ in range(n)]for _ in range(m)]

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

Solution (Python):
import sys
import math
def get_array(): return list(map(int,sys.stdin.readline().strip().split()))
def get_ints(): return map(int,sys.stdin.readline().strip().split())
def input(): return sys.stdin.readline().strip()
x1,x2,x3,x4,x5=get_ints()
a=[x1,x2,x3,x4,x5]
for i in range(5):
    if a[i]==0:
        break 
print(i+1)

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

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

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

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

a = 1
for i in A :
    if i == 0 :
        print(a)
    else:
        a = a + 1

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

Solution (Python):
from sys import stdin

seq = list(map(int, stdin.readline().split()))
for i in range(5):
  if seq[i]==0:
    print(i+1)
    break

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

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

Solution (Python):
x1, x2, x3, x4, x5 = input().split()
x = list()
x.append(x1)
x.append(x2)
x.append(x3)
x.append(x4)
x.append(x5)
ans = 0
for i, j in enumerate(x):
  if int(j) == 0:
  	ans = i+1
print(int(ans))

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

Solution (Python):
P = list(map( str , input().split()))

print(P.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()))

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

Solution (Python):
import bisect
import copy
import heapq
import sys
import itertools
import math
import queue
from functools import lru_cache
input = sys.stdin.readline
sys.setrecursionlimit(1000000)
mod = 10 ** 9 + 7 

def read_values(): return map(int, input().split())
def read_index(): return map(lambda x: int(x) - 1, input().split())
def read_list(): return list(read_values())
def read_lists(N): return [read_list() for n in range(N)]


def main():
    print(read_list().index(0) + 1)

if __name__ == "__main__":
    main()

Solution (Python):
a,b,c,d,e=(int(x) for x in 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()))
i=1
for n in a:
	if(n==0):
		print(str(i))
	i+=1

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

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

Solution (Python):
import re

i = input()
x = re.sub(" ", "", i)
print(x.index('0')+1)

Solution (Python):
a=list(map(int,input().strip().split()))
for i in range(5):
    if(a[i]==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):
l = [int(x) for x in input().split()]
for i in range(5):
    if l[i] == 0:
        print(i+1)
        break

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

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

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

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, 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):
x = list(map(int, input().split()))

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

Solution (Python):
import numpy as np
x_np = np.array(list(map(int, input().split())))
target = int(np.where(x_np == 0)[0] + 1)
print(target)

Solution (Python):
x_all = input()
x_list = x_all.split()
for i in range(len(x_list)):
  if int(x_list[i]) == 0:
    print(i + 1)
  else:
    pass

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

print(x.index(0) + 1)

Solution (Python):
x = [int(x) for x in input().split()]
t = [1,2,3,4,5]
x_set = set(x)
t_set = set(t)
xt = x_set&t_set
s = t_set-xt
s1 = list(s)
print(s1[0])

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):
x = list(map(int, input().split()))
for i, a in enumerate(x):
  if a == 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):
import sys
sys.setrecursionlimit(1 << 25)
read = sys.stdin.readline
ra = range
enu = enumerate


def mina(*argv, sub=1): return list(map(lambda x: x - sub, argv))



def read_a_int(): return int(read())


def read_ints(): return list(map(int, read().split()))


def read_col(H):
    '''H is number of rows
    A列、B列が与えられるようなとき
    ex1)A,B=read_col(H)    ex2) A,=read_col(H) 
    ret = []
    for _ in range(H):
        ret.append(list(map(int, read().split())))
    return tuple(map(list, zip(*ret)))


def read_tuple(H):
    '''H is number of rows'''
    ret = []
    for _ in range(H):
        ret.append(tuple(map(int, read().split())))
    return ret


def read_matrix(H):
    '''H is number of rows'''
    ret = []
    for _ in range(H):
        ret.append(list(map(int, read().split())))
    return ret
    


MOD = 10**9 + 7
INF = 2**31  

from collections import defaultdict, Counter, deque
from operator import itemgetter
from itertools import product, permutations, combinations
from bisect import bisect_left, bisect_right  


X = read_ints()
print(X.index(0) + 1)

Solution (Python):
int1=tuple(map(int,input().split()))
t=1
for i in range(0,len(int1)):
  if int1[i]==0:
    print(t)
  t+=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(len(A)):
	if A[i] == 0:
		a = i + 1
print(a)

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

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

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

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

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

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

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

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

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

Solution (Python):
from sys import stdin

l = stdin.readline().rstrip().split()

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

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

i = 1
for str in x:
  if(str == '0'):
    print(i)
    break
  i += 1

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

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

Solution (Python):
x1,x2,x3,x4,x5 = map(int, input().split())
a=[x1,x2,x3,x4,x5]
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)
    else:
        pass

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

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

for n in range(5):

	if a[n]==0:
		print(n+1)

Solution (Python):
lst=[]
str = input()
lst = str.split(' ')
i = lst.index('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):
input_list = list(map(int, input().split()))

for index, num in enumerate(input_list):
    if num == 0:
        print(index+1)

Solution (Python):
from collections import Counter 
from collections import defaultdict
from collections import deque
from functools import reduce
import math
import itertools
import heapq
import numpy as np
import bisect
import sys

sys.setrecursionlimit(10**6)


def bfs(s,n,node):
    
    check=[False for _ in range(n)]
    check[s]=True
    
    queue=deque([s])
    visited_num=1

    
    
    color=[-1 for _ in range(n)]
    color[s]=0
    
    while visited_num<n:
        
        if len(queue)==0:
            
            
            return color

        now_vertex=queue.popleft()
        
        for next_vertex in node[now_vertex]:


            if check[next_vertex]==True:
                continue

            queue.append(next_vertex)
            check[next_vertex]=True

            
            color[next_vertex]=color[now_vertex]+1
            visited_num+=1

    return color




ceil=lambda x,y: (x+y-1)//y
input_list = lambda : list(map(int,input().split()))




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

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

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

Solution (Python):
def main():
    import sys
    read = sys.stdin.buffer.read
    readline = sys.stdin.buffer.readline
    readlines = sys.stdin.buffer.readlines
    sys.setrecursionlimit(10 ** 7)

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


if __name__ == '__main__':
    main()

Solution (Python):
def main():
  nums = list(map(int, input().strip().split()))

  if nums[0] == 0:
      ans = nums[1] - 1
      print(ans)
  else:
      zero = nums.index(0)
      ans = nums[0] + zero
      print(ans)

main()

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

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

Solution (Python):
import sys
import math
from collections import defaultdict
from bisect import bisect_left, bisect_right

sys.setrecursionlimit(10**7)
def input():
    return sys.stdin.readline()[:-1]

mod = 10**9 + 7

def I(): return int(input())
def LI(): return list(map(int, input().split()))
def LIR(row,col):
    if row <= 0:
        return [[] for _ in range(col)]
    elif col == 1:
        return [I() for _ in range(row)]
    else:
        read_all = [LI() for _ in range(row)]
        return map(list, zip(*read_all))



x1,x2,x3,x4,x5 = LI()

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):
from sys import stdin

s1=list(map(int,stdin.readline().split()))

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

Solution (Python):
if __name__ == "__main__":
    s = input().split()
    for i, num in enumerate(s):
        if num == "0":
            print(i+1)

Solution (Python):
from sys import stdin,stdout
import math
from collections import deque,defaultdict
from math import ceil,floor,inf,sqrt,factorial,gcd,log2
from copy import deepcopy
ii1=lambda:int(stdin.readline().strip())
is1=lambda:stdin.readline().strip()
iia=lambda:list(map(int,stdin.readline().strip().split()))
isa=lambda:stdin.readline().strip().split()
mod=1000000007
arr=iia()
n=len(arr)
for i in range(n):
    if arr[i]==0:
        print(i+1)
        break

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

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

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

Solution (Python):

a, b, c, d, e = list(map(int, input().split()))

lists = []
lists.append(a)
lists.append(b)
lists.append(c)
lists.append(d)
lists.append(e)

n = lists.index(0)

ans = print(n + 1)

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

Solution (Python):
a = input().split()
ind = 1
for i in a:
    if i == '0':
        print(ind)
        break
    ind += 1

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

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

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

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

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

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

num = 0

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

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

if ans == 0:
    a = x[ans+2]-x[ans+1]
    print(x[ans+1]-a)
elif ans == 4:
    b = x[ans-2]-x[ans-3]
    print(x[ans-1]+b)
else:
    print((x[ans-1]+x[ans+1])//2)

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

count = 0
for num in data:
    num2 = int(num)
    if num2 == 0:
        result = count
    count += 1

result += 1

print(result)

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

Solution (Python):
z = [int(x) for x in input().split(" ")] 
for x in range(len(z)):
  if z[x] == 0:
    print(x+1)
    break

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

count = 0
for item in xl:
  count += 1
  if item == 0:
    print(count)

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

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