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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
def solve():
	arr = [int(x) for x in input().split()]
	for i in range(5):
		if arr[i] == 0:
			return i + 1
print(solve())

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

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

Submission status: Accepted

Solution code:
from typing import List


def main():
    lst: List[int] = map(int, input().split())

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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
X = list(map(int, input().split()))
count = 1
for I in X:
  if I == 0:
    print(count)
    exit
  count += 1

Submission status: Accepted

Solution code:
a=[int(x) for x in input().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")
elif x5 == 0:
    print("5")

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


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

Submission status: Accepted

Solution code:
ins = list(map(int, input().split()))
if ins[0] == 0:
	print(1)
elif ins[1] == 0:
	print(2)
elif ins[2] == 0:
	print(3)
elif ins[3] == 0:
	print(4)
elif ins[4] == 0:
	print(5)
else :
  print("something wrong.")

Submission status: Accepted

Solution code:
print(15 - sum([*map(int, input().split())]))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X = input()

#入力をsplitでくぎり細裂に代入
inputs = X.split(' ')

#入力は固定１、２、３、４、５
#配列を変数に代入して整理する

x1 = int(inputs[0])
x2 = int(inputs[1])
x3 = int(inputs[2])
x4 = int(inputs[3])
x5 = int(inputs[4])

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys
import math
from bisect import bisect_left
from bisect import bisect_right
from collections import defaultdict
from heapq import heappop, heappush
import itertools
from decimal import *

input = sys.stdin.readline

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

inf = float('inf')
mod = 1000000007

#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-

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

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


#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
if __name__ == "__main__":
	main()

Submission status: Accepted

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

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

print(answer)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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


if __name__ == "__main__":
    main()

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:
#!/usr/bin/env python3

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

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

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

A = [0] + LI()

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

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

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


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


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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
#!/usr/bin/env python3

import sys
# import time
# import math
# import numpy as np
# import scipy.sparse.csgraph as cs            # csgraph_from_dense(ndarray, null_value=inf), bellman_ford(G, return_predecessors=True), dijkstra, floyd_warshall
# import random                                # random, uniform, randint, randrange, shuffle, sample
# import string                                # ascii_lowercase, ascii_uppercase, ascii_letters, digits, hexdigits
# import re                                    # re.compile(pattern) => ptn obj; p.search(s), p.match(s), p.finditer(s) => match obj; p.sub(after, s)
# from bisect import bisect_left, bisect_right # bisect_left(a, x, lo=0, hi=len(a)) returns i such that all(val<x for val in a[lo:i]) and all(val>-=x for val in a[i:hi]).
# from collections import deque                # deque class. deque(L): dq.append(x), dq.appendleft(x), dq.pop(), dq.popleft(), dq.rotate()
# from collections import defaultdict          # subclass of dict. defaultdict(facroty)
# from collections import Counter              # subclass of dict. Counter(iter): c.elements(), c.most_common(n), c.subtract(iter)
# from datetime import date, datetime          # date.today(), date(year,month,day) => date obj; datetime.now(), datetime(year,month,day,hour,second,microsecond) => datetime obj; subtraction => timedelta obj
# from datetime.datetime import strptime       # strptime('2019/01/01 10:05:20', '%Y/%m/%d/ %H:%M:%S') returns datetime obj
# from datetime import timedelta               # td.days, td.seconds, td.microseconds, td.total_seconds(). abs function is also available.
# from copy import copy, deepcopy              # use deepcopy to copy multi-dimentional matrix without reference
# from functools import reduce                 # reduce(f, iter[, init])
# from functools import lru_cache              # @lrucache ...arguments of functions should be able to be keys of dict (e.g. list is not allowed)
# from heapq import heapify, heappush, heappop # built-in list. heapify(L) changes list in-place to min-heap in O(n), heappush(heapL, x) and heappop(heapL) in O(lgn).
# from heapq import nlargest, nsmallest        # nlargest(n, iter[, key]) returns k-largest-list in O(n+klgn).
# from itertools import count, cycle, repeat   # count(start[,step]), cycle(iter), repeat(elm[,n])
# from itertools import groupby                # [(k, list(g)) for k, g in groupby('000112')] returns [('0',['0','0','0']), ('1',['1','1']), ('2',['2'])]
# from itertools import starmap                # starmap(pow, [[2,5], [3,2]]) returns [32, 9]
# from itertools import product, permutations  # product(iter, repeat=n), permutations(iter[,r])
# from itertools import combinations, combinations_with_replacement
# from itertools import accumulate             # accumulate(iter[, f])
# from operator import itemgetter              # itemgetter(1), itemgetter('key')
# from fractions import Fraction               # Fraction(a, b) => a / b ∈ Q. note: Fraction(0.1) do not returns Fraciton(1, 10). Fraction('0.1') returns Fraction(1, 10)
# from fractions import gcd                    # for Python 3.4 (previous contest @AtCoder)



def main():
    mod = 1000000007                # 10^9+7
    inf = float('inf')              # sys.float_info.max = 1.79e+308
    # inf = 2 ** 63 - 1             # (for fast JIT compile in PyPy) 9.22e+18
    sys.setrecursionlimit(10**6)    # 1000 -> 1000000
    def input(): return sys.stdin.readline().rstrip()
    def ii():    return int(input())
    def isp():   return input().split()
    def mi():    return map(int, input().split())
    def mi_0():  return map(lambda x: int(x)-1, input().split())
    def lmi():   return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():    return list(input())
    
    
    L = lmi()
    print(L.index(0) + 1)


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

X = lget()

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

Submission status: Accepted

Solution code:
from collections import deque
import math

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

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
from sys import stdin
#, setrecursionlimit, stdout
#setrecursionlimit(1000000)
#from collections import deque
#from math import sqrt, floor, ceil, log, log2, log10, pi, gcd, sin, cos, asin
def ii(): return int(stdin.readline())
def fi(): return float(stdin.readline())
def mi(): return map(int, stdin.readline().split())
def fmi(): return map(float, stdin.readline().split())
def li(): return list(mi())
def si(): return stdin.readline().rstrip()
def lsi(): return list(si())
#mod=1000000007
res=['Yes', 'No']
############# CODE STARTS HERE #############

test_case=1
while test_case:
    test_case-=1

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
import numpy as np


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


# Generated by 1.1.7.1 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    x = [int(next(tokens)) for _ in range(5)]  # type: "List[int]"
    solve(x)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

print(a.index(0)+1)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

####

print 15 - sum(readlist())

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

i += 1
print(i)

Submission status: Accepted

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

print(a.index(0)+1)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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:
import math
#import sys
#input = sys.stdin.readline

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

    # divisors.sort()
    return divisors

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

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

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

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

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

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

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

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


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

class Bit:
    def __init__(self, n):
        self.size = n
        self.tree = [0] * (n + 1)
 
    def sum(self, i):
        s = 0
        while i > 0:
            s += self.tree[i]
            i -= i & -i
        return s
 
    def add(self, i, x):
        while i <= self.size:
            self.tree[i] += x
            i += i & -i
            
#
def Zaatsu(a):
    a.sort()
    now = a[0][0]
    od = 0
    for i in range(n):
        if(now==a[i][0]):
            a[i][0]=od
        else:
            now = a[i][0]
            od+=1
            a[i][0] = od
    
    a.sort(key = lambda x : x[1])
    return a

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

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

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

    # 同じ集合に属するか判定
    def same_check(self, x, y):
        return self.find(x) == self.find(y)


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

p = 2
N = 10 ** 6 + 2
fact = [1, 1]  # fact[n] = (n! mod p)
factinv = [1, 1]  # factinv[n] = ((n!)^(-1) mod p)
inv = [0, 1]  # factinv 計算用

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

'''

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

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

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

#31-

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

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

Submission status: Accepted

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

print(A.index(0) + 1)

Submission status: Accepted

Solution code:
import math
from collections import deque
from collections import defaultdict
import itertools as it
 
#自作関数群
def readInt():
 return int(input())
def readInts():
 return list(map(int, input().split()))
def readChar():
 return input()
def readChars():
 return input().split()
def factorization(n):
 res = []
 if n%2==0:
  res.append(2)
 for i in range(3,math.floor(n//2)+1,2):
  if n%i==0:
   c = 0
   for j in res:
    if i%j==0:
     c=1
   if c==0:
    res.append(i)
 return res
def fact2(n):
 p = factorization(n)
 res = []
 for i in p:
  c=0
  z=n
  while 1:
   if z%i==0:
    c+=1
    z/=i
   else:
    break
  res.append([i,c])
 return res
def fact(n):#階乗
 ans = 1
 m=n
 for _i in range(n-1):
  ans*=m
  m-=1
 return ans
def comb(n,r):#コンビネーション
 if n<r:
  return 0
 l = min(r,n-r)
 m=n
 u=1
 for _i in range(l):
  u*=m
  m-=1
 return u//fact(l)
def combmod(n,r,mod):
 return (fact(n)/fact(n-r)*pow(fact(r),mod-2,mod))%mod
def printQueue(q):
 r=copyQueue(q)
 ans=[0]*r.qsize()
 for i in range(r.qsize()-1,-1,-1):
  ans[i] = r.get()
 print(ans)
class UnionFind():
 def __init__(self, n):
  self.n = n
  self.parents = [-1]*n
 
 def find(self, x): # root
  if self.parents[x]<0:
   return x
  else:
   self.parents[x] = self.find(self.parents[x])
   return self.parents[x]
 
 def union(self,x,y):
  x = self.find(x)
  y = self.find(y)
 
  if x==y:
   return
 
  if self.parents[x]>self.parents[y]:
   x,y = y,x
 
  self.parents[x]+=self.parents[y]
  self.parents[y]=x
 
 def size(self,x):
  return -1*self.parents[self.find(x)]
 
 def same(self,x,y):
  return self.find(x)==self.find(y)
 
 def members(self,x): # much time
  root = self.find(x)
  return [i for i in range(self.n) if self.find(i)==root]
 
 def roots(self):
  return [i for i,x in enumerate(self.parents) if x<0]
 
 def group_count(self):
  return len(self.roots())
 
 def all_group_members(self):
  return {r: self.members(r) for r in self.roots()} # 1~n
def bitArr(n):#ビット全探索
 x = 1
 zero = "0"*n
 ans = []
 ans.append([0]*n)
 for i in range(2**n-1):
  ans.append(list(map(lambda x:int(x),list((zero+bin(x)[2:])[-1*n:]))))
  x+=1
 return ans;
def arrsSum(a1,a2):
 for i in range(len(a1)):
  a1[i]+=a2[i]
 return a1
def maxValue(a,b,v):
 v2 = v
 for i in range(v2,-1,-1):
  for j in range(v2//a+1): #j:aの個数
   k = i-a*j
   if k%b==0:
    return i
 return -1
def copyQueue(q):
 nq = queue.Queue()
 n = q.qsize()
 for i in range(n):
  x = q.get()
  q.put(x)
  nq.put(x)
 return nq
def get_sieve_of_eratosthenes(n):
 #data = [2]
 data = [0,0,0]
 for i in range(3,n+1,2):
  data.append(i)
  data.append(0)
 for i in range(len(data)):
  interval = data[i]
  if interval!=0:
   for j in range(i+interval,n-1,interval):
    data[j] = 0
 #ans = [x for x in data if x!=0]
 ans = data[:]
 return ans
 
x = readInts()
 
for i in range(1,6):
 if x[i-1]!=i:
  print(i)

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:
ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))

n = li()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if __name__ == "__main__":
    main()

Submission status: Accepted

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

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:
# -*- coding: utf-8 -*-

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

print( x_list.index(0) + 1 )

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
x1,x2,x3,x4,x5=map(int,input().split())
X=[x1,x2,x3,x4,x5]
print (X.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=input().split()
print((x.index("0")+1))

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
num=list(map(int,input().split()))
i1=num.index(0)
print(i1+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:
num_list = list(map(int, input().split()))


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

Submission status: Accepted

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

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

print(num + 1)

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

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

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

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

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

Submission status: Accepted

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

if __name__=='__main__':
    main()

Submission status: Accepted

Solution code:
# n = int(input())
in_data = [int(x) for x in input().split(' ')]
result = 0

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

print(result)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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