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



Sample input:
0 2 3 4 5


Sample output:
1

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

Submission status: Accepted

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



if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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")

Submission status: Accepted

Solution code:
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)
#from collections import defaultdict 
#for _ in range(int(stdin.readline())):
x=get_array()
for i in range(len(x)):
    if x[i]==0:
        print(i+1)

Submission status: Accepted

Solution code:
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()

Submission status: Accepted

Solution code:
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():
	#a = int(input())
	#b , c = tin()
	#s = input()
	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
		#input = sys.stdin.readline
			
	ret = main()
	if ret is not None:
		print(ret)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = list(map(int,input().split()))
for i,n in enumerate(N):
    if n == 0:
        ans = i+1
        break

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

ans = 0
index = 0

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

print(ans)

Submission status: Accepted

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


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

Submission status: Accepted

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

if __name__ == "__main__":
    main()

Submission status: Accepted

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

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

print(result)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

ans = x.index(0)

print(ans+1)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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()))

# sys.setrecursionlimit(10**6)



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






if __name__ == "__main__":
	solve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

print(ans+1)

Submission status: Accepted

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

Submission status: Accepted

Solution code:

import numpy as np

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
a, b, c, d, e = map(int, input().split())
print(15 - a - b - c - d - e)

Submission status: Accepted

Solution code:
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()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
L = input().split()
print(L.index("0") + 1)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
var_list = map(int, input().split(" "))
var_list = list(var_list)
#print(var_list)

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

print(arg + 1)

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
x = list(map(int, input().split()))
print(1 + x.index(0))

Submission status: Accepted

Solution code:
from sys import stdin

#l = list(map(int, stdin.readline().rstrip().split()))
a,b,c,d,e = map(int, stdin.readline().rstrip().split())
#S = [list(map(int, stdin.readline().rstrip().split())) for _ in range(h)]#hの定義を忘れずに

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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

Submission status: Accepted

Solution code:
import sys
import itertools
# import numpy as np
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)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
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())
# N = I()
# A = [LI() for _ in range(N)]

import bisect


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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(sunuke.index(0)+1)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import copy

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

resolve()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

print(*y-x)

Submission status: Accepted

Solution code:

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

ans = 0

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x_array=map(int,input().split())
for i,x in enumerate(x_array):
    if x==0:
        ans=i+1
        break
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
variables = input().split()
for i,var in enumerate(variables):
  if var == '0':
     print(i+1)
     break

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!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

Submission status: Accepted

Solution code:
import sys
read = sys.stdin.buffer.read
input = sys.stdin.readline
input = sys.stdin.buffer.readline


#sys.setrecursionlimit(10**9)
#from functools import lru_cache

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()))
# rstrip().decode('utf-8')


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





if __name__ == "__main__":
	main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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





#.........................................FAST INPUT OUTPUT.......................................
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")

#....................................END OF FAST I/O............................................

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
list_num = [int(_) for _ in input().split()]
print(list_num.index(0) + 1)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#8:47
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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
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()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = list(map(int,input().split()))
i=1
for n in a:
	if(n==0):
		print(str(i))
	i+=1

Submission status: Accepted

Solution code:
import re

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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

Submission status: Accepted

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

print(x.index(0) + 1)

Submission status: Accepted

Solution code:
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])

Submission status: Accepted

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

Submission status: Accepted

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