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:
import sys
#from collections import defaultdict, deque, Counter
#import bisect
#import heapq
#import math
#from itertools import accumulate
#from itertools import permutations as perm
#from itertools import combinations as comb
#from itertools import combinations_with_replacement as combr
#from fractions import gcd
#import numpy as np

stdin = sys.stdin
sys.setrecursionlimit(10 ** 7)
MIN = -10 ** 9
MOD = 10 ** 9 + 7
INF = float("inf")
IINF = 10 ** 18

def main():
    #n = int(stdin.readline().rstrip())
    #A, B, C = map(int, stdin.readline().rstrip().split())
    x = list(map(int, stdin.readline().rstrip().split()))
    #numbers = [[int(c) for c in l.strip().split()] for l in sys.stdin]
    #word = [stdin.readline().rstrip() for _ in range(n)]
    #number = [[int(c) for c in stdin.readline().rstrip()] for _ in range(n)]
    #zeros = [[0] * w for i in range(h)]
    for i in range(len(x)):
        if x[i] == 0:
            print(i+1)
            exit()
        else:
            pass

main()

Submission status: Accepted

Solution code:
c = 1

for i in input().split():
    if i == "0":
        print(c)
    c += 1

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
from collections import defaultdict,deque
from sys import stdin,setrecursionlimit
import heapq,bisect,math,itertools,string,queue,datetime,copy
setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
eps = 10**-7
def inpl(): return list(map(int, stdin.readline().split()))

ls = inpl()
for i,k in enumerate(ls):
    if k==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:
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:
a = [int(_) for _ in input().split()]
print(a.index(0)+1)

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
l=list(map(int,input().split()))
for i,x in enumerate(l,start=1):
    if x==0:
        print(i)
        exit()

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

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

Submission status: Accepted

Solution code:
def main():
    x=input().split()
    print(x.index('0')+1)
if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
A = map(int, input().split())
for i, a in enumerate(A):
    if a == 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:
import numpy as np
import scipy.sparse as sps
import scipy.misc as spm
import collections as col
import functools as func
import itertools as ite
import fractions as frac
import math as ma
import cmath as cma
import copy as cp
import sys
def sinput(): return sys.stdin.readline().strip()
def iinput(): return int(sinput())
def imap(): return map(int, sinput().split())
def fmap(): return map(float, sinput().split())
def iarr(n=0):
    if n: return [0 for _ in range(n)]
    else: return list(imap())
def farr(): return list(fmap())
def sarr(n=0):
    if n: return ["" for _ in range(n)]
    else: return sinput().split()
def adj(n): return [[] for _ in range(n)]
sys.setrecursionlimit(10**7)
MOD = 10**9 + 7; EPS = sys.float_info.epsilon
PI = np.pi; EXP = np.e; INF = np.inf

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

Submission status: Accepted

Solution code:
import math  # noqa: F401
from typing import Dict, List, Optional, Tuple, Union  # noqa: F401


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


if __name__ == "__main__":
    X = list(map(int, input().split()))
    main(X)

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:
# import numpy as np
# import math
# import copy
# from collections import deque
import sys
input = sys.stdin.readline
# sys.setrecursionlimit(10000)


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

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

    print(res)



main()

Submission status: Accepted

Solution code:
arr = map(int, input().split())
print(*[i + 1 for i, v in enumerate(arr) if v == 0])

Submission status: Accepted

Solution code:
# import sys
# import math #sqrt,gcd,pi
# import decimal
# import queue # queue
# import bisect
# import heapq # priolity-queue
# import time
# from itertools import product,permutations,\
#     combinations,combinations_with_replacement
# 重複あり順列、順列、組み合わせ、重複あり組み合わせ
# import collections # deque
# from operator import itemgetter,mul
# from fractions import Fraction
# from functools import reduce

mod = int(1e9+7)
# mod = 998244353
INF = 1<<50

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

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

if __name__=='__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys

X = [int(x) for x in sys.stdin.readline().split()]

print(X.index(0)+1)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#a
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] != i + 1:
        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 )

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = list(map(int,input().split()))
for i,ai in enumerate(a):
  if ai == 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:
x = list(map(int, input().split()))

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

Submission status: Accepted

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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:
def main():
    x = list(map(int, input().split()))
    for i, xi in enumerate(x, 1):
        if xi == 0:
            print(i)
            exit(0)
    

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
lst = list(map(int, open(0).read().split()))
print(15 - sum(lst))

Submission status: Accepted

Solution code:
a, b, c, d, e = list(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 in range(1, 6):
    if i not in x:
        print(i)
        break

Submission status: Accepted

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

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 = [int(x) for x in input().strip().split(' ')]
print(x.index(0)+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:
xs = list(map(int, input().split()))
for i, x in enumerate(xs):
  if x == 0:
    print(i+1)

Submission status: Accepted

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

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

Submission status: Accepted

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

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

print(i+1)

Submission status: Accepted

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys


def int1(x): return int(x) - 1
def ii(): return int(sys.stdin.readline())
def mi(): return map(int, sys.stdin.readline().split())
def mi1(): return map(int1, sys.stdin.readline().split())
def li(): return list(map(int, sys.stdin.readline().split()))
def lli(rows_number): return [li() for _ in range(rows_number)]


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

Submission status: Accepted

Solution code:
import sys


def _ia(): return map(int, sys.stdin.readline().strip().split())


def main():
    a = _ia()
    for i, ai in enumerate(a):
        if ai == 0:
            return i + 1


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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

print(list.index(0)+1)

Submission status: Accepted

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

print(Ns.index(0)+1)

Submission status: Accepted

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

Submission status: Accepted

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

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:
if __name__ == "__main__":
    X = [int(x) for x in input().split(" ")]
    for i, x in enumerate(X):
        if x == 0:
            print(i + 1)

Submission status: Accepted

Solution code:
import sys
C = list(map(int, input().split()))
for n in range(len(C)):
  if C[n]==0:
    print(n+1)
    sys.exit()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
###################################################
#                                                 #
#   author: raghav_0901 (Raghav Dalmia)           #
#   updated on: Sunday, 14-06-2020, 17:31:38 pm   #
#                                                 #
###################################################

from math import *


def _in():
    return [int(x) for x in input().split(' ')]


def main():
    arr = _in()
    for i in range(1, 6):
        if not(i in arr):
            print(i)
            return


if __name__ == "__main__":
    tt = 1
    # tt = int(input())
    for _ in range(tt):
        main()

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

int_in = lambda: int(stdin.readline())
arr_in = lambda: [int(x) for x in stdin.readline().split()]
mat_in = lambda rows: [arr_in() for y in range(rows)]
str_in = lambda: stdin.readline().strip()
out = lambda o: stdout.write("{}\n".format(o))
arr_out = lambda o: out(" ".join(map(str, o)))
bool_out = lambda o: out("YES" if o else "NO")
tests = lambda: range(1, int_in() + 1)
case_out = lambda i, o: out("Case #{}: {}".format(i, o))


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


if __name__ == "__main__":
    x = arr_in()
    out(solve(x))

Submission status: Accepted

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

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

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

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

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:
def solve(x1, x2, x3, x4, x5):
    for i, x in enumerate([x1, x2, x3, x4, x5]):
        if x == 0:
            return i + 1
    return 0


def main():
    x1, x2, x3, x4, x5 = map(int, input().split())
    res = solve(x1, x2, x3, x4, x5)
    print(res)


def test():
    assert solve(0, 2, 3, 4, 5) == 1
    assert solve(1, 2, 0, 4, 5) == 3


if __name__ == "__main__":
    test()
    main()

Submission status: Accepted

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

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

Submission status: Accepted

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

'''

'''

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)

Submission status: Accepted

Solution code:
l = [int(i) for i in input().split()]
i = l.index(0)

print(i+1)

Submission status: Accepted

Solution code:

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


main()

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

print(l.index(0)+1)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
x = [0]*5
x = list(map(int, input().split()))

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

Submission status: Accepted

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

Submission status: Accepted

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

        print(i+1)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:

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

main()

Submission status: Accepted

Solution code:
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))


x = LIST()

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

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

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

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

def main():

    input = stdin.readline

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

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


    
if __name__ == "__main__":
    main()

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
import sys
read = sys.stdin.read
readline = sys.stdin.readline

*a, = map(int,read().split())

print(a.index(0)+1)

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = [int(i) for i in input().split()]
ans = 0
for i, x in enumerate(n):
  if x == 0:
    ans = i

print(ans+1)

Submission status: Accepted

Solution code:
def main():
    X = [int(x) for x in input().split()]
    for i,x in enumerate(X):
        if x == 0:
            print(i+1)
            return

if __name__ == '__main__':
    main()

Submission status: Accepted

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

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 = [int(i) for i in input().split()]
for i,n in enumerate(x):
    if n == 0:
        print(i+1)

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

Submission status: Accepted

Solution code:
xo = list(map(int, input().split()))
for i, x in enumerate(xo):
    if x == 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:
        cnt=i
        break
print(cnt)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
from sys import exit
import math
ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))

a = li()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# A

x_list = [int(x) for x in input().split()]

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8


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

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


print(main())

Submission status: Accepted

Solution code:
from sys import stdin
from collections import defaultdict as dd
from collections import deque as dq
import itertools as it
from math import sqrt, log, log2
from fractions import Fraction

nums = list(map(int, stdin.readline().split()))
for i, elem in enumerate(nums):
    if elem == 0:
        print(i + 1)
        exit()

Submission status: Accepted

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#: Author - Soumya Saurav
import sys,io,os,time
from collections import defaultdict
from collections import OrderedDict
from collections import deque
from itertools import combinations
from itertools import permutations
import bisect,math,heapq
alphabet = "abcdefghijklmnopqrstuvwxyz"

input = sys.stdin.readline

########################################

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

Submission status: Accepted

Solution code:
a = [int(e) for e in input().split()]

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

Submission status: Accepted

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

print(ind+1)

Submission status: Accepted

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


if __name__ == '__main__':
    resolve()

Submission status: Accepted

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

print(a.index(0) + 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)
        exit()

Submission status: Accepted

Solution code:
# # -*- coding: utf-8 -*-
X = list(map(int, input().split(' ')))
for i, x in enumerate(X):
    if x == 0:
        print(i+1)

Submission status: Accepted

Solution code:
l=list(map(int,input().split()))
for i in range(len(l)):
    if(l[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:
# input
X = list(map(int, input().split()))

# output
print(X.index(0)+1)

Submission status: Accepted

Solution code:
import sys
from collections import defaultdict
readline = sys.stdin.buffer.readline
#sys.setrecursionlimit(10**8)


def geta(fn=lambda s: s.decode()):
    return map(fn, readline().split())


def gete(fn=lambda s: s.decode()):
    return fn(readline().rstrip())


def main():
    x = tuple(geta(int))

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


if __name__ == "__main__":
    main()

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:
#!/usr/bin/env python3
import collections
import itertools as it
import math
#import numpy as np
 
#  = input()
#  = int(input())
x1, x2, x3, x4, x5  = map(int, input().split())
#  = list(map(int, input().split()))
#  = [int(input()) for i in range(N)]
#
# c = collections.Counter()

li = [x1, x2, x3, x4, x5]
print(li.index(0)+1)

Submission status: Accepted

Solution code:
#

import sys
input=sys.stdin.readline

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**6)

#a = int(input())
x = list(map(int, input().split()))
#n, m = map(int, input().split())
#s = input()
#s,t = input().split()
#
#readline = sys.stdin.readline
#n,m = [int(i) for i in readline().split()]
#ab = [[int(i) for i in readline().split()] for _ in range(n)]

print(x.index(0)+1)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin python3
# -*- coding: utf-8 -*-

def main():
    A = list(map(int, input().split()))

    print(A.index(0)+1)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

if a[0] == 0:print(1)
else:
    print(a.index(0) + 1)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(1000000)

import bisect
import math
import collections
import heapq


if __name__ == "__main__":
    A, B, C, D, E = tuple(map(int, input().split(" ")))
    K = [A, B, C, D, E]
    for i in range(len(K)):
        if K[i] == 0:
            print(i + 1)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
input=sys.stdin.readline
sys.setrecursionlimit(10 ** 8)
from itertools import accumulate
from itertools import permutations
from itertools import combinations
from collections import defaultdict
from collections import Counter
import fractions
import math
from collections import deque
from bisect import bisect_left
from bisect import insort_left
import itertools
from heapq import heapify
from heapq import heappop
from heapq import heappush
import heapq
from copy import deepcopy
from decimal import Decimal
alf = list("abcdefghijklmnopqrstuvwxyz")
ALF = list("ABCDEFGHIJKLMNOPQRSTUVWXYZ")
#import numpy as np
INF = float("inf")
#d = defaultdict(int)
#d = defaultdict(list)
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)