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

Submission status: Accepted

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

for i in A:
  if i == 0:
    print(A.index(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)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
i = list(map(int, input().split())) #1行に複数の整数を入力したいので、リスト"i"に格納
j = i.index(0) + 1
print(j)

Submission status: Accepted

Solution code:
li = list(map(int, input().split()))
print(li.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)

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:
import sys
sys.setrecursionlimit(1 << 25)
read = sys.stdin.readline
ra = range
enu = enumerate


def mina(*argv, sub=1): return list(map(lambda x: x - sub, argv))
# 受け渡されたすべての要素からsubだけ引く.リストを*をつけて展開しておくこと


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


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


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


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


def read_matrix(H):
    '''H is number of rows'''
    ret = []
    for _ in range(H):
        ret.append(list(map(int, read().split())))
    return ret
    # return [list(map(int, read().split())) for _ in range(H)] # 内包表記はpypyでは遅いため


MOD = 10**9 + 7
INF = 2**31  # 2147483648 > 10**9
# default import
from collections import defaultdict, Counter, deque
from operator import itemgetter
from itertools import product, permutations, combinations
from bisect import bisect_left, bisect_right  # , insort_left, insort_right


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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

for n in range(5):

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

Submission status: Accepted

Solution code:
lst=[]
str = input()
lst = str.split(' ')
i = lst.index('0')
print(i+1)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
from collections import Counter 
from collections import defaultdict
from collections import deque
from functools import reduce
import math
import itertools
import heapq
import numpy as np
import bisect
import sys
#import sympy
sys.setrecursionlimit(10**6)


def bfs(s,n,node):
    #頂点が探索済みかどうかのチェック配列
    check=[False for _ in range(n)]
    check[s]=True
    #次見る頂点を格納するキュー
    queue=deque([s])
    visited_num=1

    #問題固有の配列
    #color_check=[[True for _ in range(l)] for _ in range(n)]
    color=[-1 for _ in range(n)]
    color[s]=0
    
    while visited_num<n:
        #グラフが全連結ではない場合
        if len(queue)==0:
            #空配列を返す
            #現状までの計算済み配列を返してもいいと思う
            return color

        now_vertex=queue.popleft()
        #インデックスがない場合は
        for next_vertex in node[now_vertex]:


            if check[next_vertex]==True:
                continue

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

            #問題固有の計算
            color[next_vertex]=color[now_vertex]+1
            visited_num+=1

    return color

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



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

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:
def main():
    import sys
    read = sys.stdin.buffer.read
    readline = sys.stdin.buffer.readline
    readlines = sys.stdin.buffer.readlines
    sys.setrecursionlimit(10 ** 7)

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import math
from collections import defaultdict
from bisect import bisect_left, bisect_right

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

mod = 10**9 + 7

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

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

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

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

Submission status: Accepted

Solution code:
from sys import stdin

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#入力する数値
a, b, c, d, e = list(map(int, input().split()))
#print(a, b, c, d, e)
lists = []
lists.append(a)
lists.append(b)
lists.append(c)
lists.append(d)
lists.append(e)

n = lists.index(0)
#print(lists)
ans = print(n + 1)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

num = 0

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

result += 1

print(result)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

b = A.index(0)
if 0 in A:
    print(b + 1)
    exit()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = input()
x = x.split(' ')
j = 1
for i in x:
  if i == '0':
    print(j)
  j = j+1

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

L = [0]*5
ans = 1
for i, order in enumerate(x,1):
   if order == 0:
       ans = i
print(ans)

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

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

Submission status: Accepted

Solution code:
import math
from collections import defaultdict
ml=lambda:map(int,input().split())
ll=lambda:list(map(int,input().split()))
ii=lambda:int(input())
ip=lambda:list(input())
ips=lambda:input().split()

"""========main code==============="""

a=ll()
for i in range(5):
    if(a[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)
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 getN():
    return int(input())
def getNM():
    return map(int, input().split())
def getList():
    return list(map(int, input().split()))

from collections import defaultdict, deque, Counter
from sys import exit
import math
import copy
from bisect import bisect_right

import sys
sys.setrecursionlimit(1000000)
import heapq
INF = 10**10

def dijkstra(graph, start, n):
    h = []
    heapq.heappush(h, (0, start))
    costs = [INF for _ in range(n)]
    while h:
     cost, cur = heapq.heappop(h)
     if costs[cur] != INF:
         continue
     costs[cur] = cost
     for edge in graph[cur]:
         ecost, tgt = edge
         if costs[tgt] == INF:
             heapq.heappush(h, (cost + ecost, tgt))

    return costs

def main():
    nums = getList()
    for i in range(5):
        if nums[i] == 0:
            print(i+1)
            return
if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A= map(int,input().split())
lists= list(A)
if lists[0]==0:
    print(1)
if lists[1]==0:
    print(2)
if lists[2]==0:
    print(3)
if lists[3]==0:
    print(4)
if lists[4]==0:
    print(5)

Submission status: Accepted

Solution code:
a, b, c, d, e =map(int,input().split())
L=[a,b,c,d,e]

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

Submission status: Accepted

Solution code:
x1,x2,x3,x4,x5 = list(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:
xs = [int(e) for e in input().split()]
for i in range(5):
  if not xs[i] == i+1:
    print(i+1)
    break

Submission status: Accepted

Solution code:
x1,x2,x3,x4,x5 = input().split()

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

Submission status: Accepted

Solution code:
number = input().split()
count = 0

for i in number:
    count += 1
    if i == "0":
        break
    


print(count)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    lst_n = [int(v) for v in input().split(' ')]
    for i, n in enumerate(lst_n):
        if n == 0:
            print(int(i + 1))


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
list_str = input().split(" ")
list_num = []
for i in range(5):
    list_num.append(int(list_str[i]))

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

Submission status: Accepted

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

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

Submission status: Accepted

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


##########
if __name__ == "__main__":
    a()

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
from sys import stdin
from operator import itemgetter
from collections import deque, Counter
import math
import pprint
from functools import reduce
# stdin = open("sample.txt")

MOD = 1000000007

def keta(kazu):
    kazu_str = str(kazu)
    kazu_list = [int(kazu_str[i]) for i in range(0, len(kazu_str))]
    return kazu_list

def gcd(*numbers):
    return reduce(math.gcd, numbers)

def combination(m,n):
    
    if n > m:
        return 'すまん'
    return math.factorial(m) // (math.factorial(m-n) * math.factorial(n))

def pow_k(x,n):  # (x**n)の計算の高速化
    if n == 0:
        return 1
    K = 1
    while n > 1:
        if n % 2 != 0:
            K *= x
        x *= x
        n //= 2
    return K * x
    
def main():
    x = list(map(int,[int(x) for x in stdin.readline().rstrip().split()]))
    print(x.index(0)+1)
main()

Submission status: Accepted

Solution code:
import sys
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())

li = LI()
for l in li:
  if l != li.index(l) + 1:
    print(li.index(l) + 1)

Submission status: Accepted

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

for i, n in enumerate(X, 1):
    a = i == n
    if a == False:
        print(i)

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(300000)

def I(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def MI0(): return map(lambda s: int(s) - 1, sys.stdin.readline().split())
def LMI(): return list(map(int, sys.stdin.readline().split()))
def LMI0(): return list(map(lambda s: int(s) - 1, sys.stdin.readline().split()))
MOD = 10 ** 9 + 7
INF = float('inf')


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

Submission status: Accepted

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

#print(xs) 

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

Submission status: Accepted

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


def index(a, x):
    if x in a:
        return a.index(x)

aa = index(a, 0)
print(aa + 1)

Submission status: Accepted

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

Submission status: Accepted

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

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:
arr=[int(i) for i in input().split()]
for i in range(1,6):
    if not arr[i-1]:
        print(i)
        break

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

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

i = 1
for v in arr:
    if(v == 0):
        print(i)
        sys.exit()
    i += 1

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
l = input().split()
print(l.index(min(l))+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(0)

Submission status: Accepted

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

Submission status: Accepted

Solution code:

n = []

n = input().split()

for i in range(5):
    n[i] = int(n[i])

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

Submission status: Accepted

Solution code:
X = [int(x) for x in input().split()]
print(X.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)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
print(input().index("0")//2+1)

Submission status: Accepted

Solution code:
g=[]
a, b, c, d, e = map(int,input().split())
for i in a, b, c, d, e:
    g.append(i)
print(g.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:
x = input().split()
x = [int(i) for i in x]
print(x.index(0)+1)

Submission status: Accepted

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

i=1
while i<=len(x):
    
    if x[i-1]==0:
        print(i)
    
    i+=1

Submission status: Accepted

Solution code:
#c=list(map(int, input().split())) 
c = input().split()
#print(c)
#if  "0" in c:
print(c.index('0')+1)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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]==0):
        print(i+1)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c,d,e=map(int,input().split())
a,b,c,d,e=int(a),int(b),int(c),int(d),int(e)
sum=a+b+c+d+e
if sum==14:
    print(1)
elif sum==13:
    print(2)
elif sum==12:
    print(3)
elif sum==11:
    print(4)
elif sum==10:
    print(5)

Submission status: Accepted

Solution code:
import numpy
input_x = [int(i) for i in input().split(" ")]
for i in range(5):
    if not i+1 in input_x:
        print(i+1)

Submission status: Accepted

Solution code:

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

for j in x:
    if j==0:
        ans=i
    else:
        i=i+1


print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

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

if x1 != 1:
  print(1)
elif x2 != 2:
  print(2)
elif x3 != 3:
  print(3)
elif x4 != 4:
  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:
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 = [int(i)for i in input().split()]

print(x.index(0)+1)

Submission status: Accepted

Solution code:
import os
import numpy as np

if os.path.exists('input.txt'):
    test_mode = True
else:
    test_mode = False

if test_mode:
    f = open('input.txt')
    
def get_input():
    if test_mode:
        return f.readline().rstrip()
    else:
        return input().rstrip()

x = get_input().split()
for x_i in x:
    if int(x_i) == 0:
        print(x.index(x_i) + 1)
        break

if test_mode:
    f.close()

Submission status: Accepted

Solution code:
line = list(map(int, input().split()))
cnt = 1
for num in line:
    if num == 0:
        print(cnt)
        exit()

    cnt+=1

Submission status: Accepted

Solution code:
import sys, bisect, math, itertools, string, queue, copy
# import numpy as np
# import scipy
# from scipy.sparse.csgraph import floyd_warshall
from collections import Counter,defaultdict,deque
from itertools import permutations, combinations, combinations_with_replacement
from heapq import heappop, heappush, heapify
from fractions import gcd
# input = sys.stdin.readline
sys.setrecursionlimit(10**8)
mod = 10**9+7
def inp(): return int(input())
def inpm(): return map(int,input().split())
def inpl(): return list(map(int, input().split()))
def inpls(): return list(input().split())
def inplm(n): return list(int(input()) for _ in range(n))
def inplL(n): return [list(input()) for _ in range(n)]
def inplT(n): return [tuple(input()) for _ in range(n)]
def inpll(n): return [list(map(int, input().split())) for _ in range(n)]
def inplls(n): return sorted([list(map(int, input().split())) for _ in range(n)])

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

c = 1
for x in l:
    if x == 0:
        print(c)
    c += 1

Submission status: Accepted

Solution code:
import sys
def input():
    return sys.stdin.readline()[:-1]


def test():
    # x = map(int, input().split())
    x = input().split()
    print(x.index("0") + 1)

test()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
xs = map(int, open(0).read().split())
for i, x in enumerate(xs):
    if x == 0:
        print(i + 1)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a=input()

n=a.replace(" ", "")

f=n.find("0")

print(f+1)

Submission status: Accepted

Solution code:
A = input()
A = A.split()
B = []
for x in A:
    y = int(x)
    B.append(y)

c = [1, 2, 3, 4, 5]
for x in range(len(B)):
    if B[x] != c[x]:
        z = x+1
        print(z)

Submission status: Accepted

Solution code:
A = [int(x) for x in input().split()]
N = int(len(A))

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

Submission status: Accepted

Solution code:
a, b, c, d, e = list(map(int, input().strip().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:
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:
lst = list(map(int, input().split()))
cnt = 1
for l in lst:
    if l == 0:
        print(cnt)
        break
    cnt += 1

Submission status: Accepted

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

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

Submission status: Accepted

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

count = 0
for i in s:
    if i != 0:
        count+=1
    elif i == 0:
        count+=1
        print(count)

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:
a=input().split(' ')

b=[]
for i in range(5):
  b.append(int(a[i]))

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

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:
a , b ,c ,d ,e = map(int, input().strip().split())
 
list = []
list.append(a)
list.append(b)
list.append(c)
list.append(d)
list.append(e)
count = 0
for i in range(0, len(list)):
    if list[i]==0:
        count = i+1
        break
print(count)