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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(10**8)
INF = float("inf")


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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

x = LI()

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

Submission status: Accepted

Solution code:
A = list(map(int ,input().split()))
for i,a in enumerate(A):
    if a == 0:
        print(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:
from sys import stdin
a,b,c,d,e = [int(x) for x in stdin.readline().rstrip().split()]
print([a,b,c,d,e].index(0)+1)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(answer)

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

Submission status: Accepted

Solution code:
x_list = [0]+[int(e) for e in input().split()]

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

Submission status: Accepted

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

print(x.index(0)+1 )

Submission status: Accepted

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys
from collections import defaultdict, Counter, namedtuple, deque
import itertools
import functools
import bisect
import heapq
import math
# from fractions import gcd

MOD = 10 ** 9 + 7
# MOD = 998244353
# sys.setrecursionlimit(10**8)

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

Submission status: Accepted

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




    
if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import numpy as np

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

print(np.where(X==0)[0][0]+1)

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().strip()

def main():
    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)
    

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if __name__=="__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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

for i in range(1, 6):
    if i not in x:
        print(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)
else:
    print(5)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
N = list(map(int,input().split()))
ans = 15
for i in N:
    ans -= i
print(ans)

Submission status: Accepted

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

print(a.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:
import sys

read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60


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


if __name__ == '__main__':
    main()

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

#S = input()

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

Submission status: Accepted

Solution code:

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

Submission status: Accepted

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

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:
import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")


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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    A = [False]*5
    B = [int(i) for i in input().split()]
    for b in B:
        if b == 0:
            continue
        A[b-1] = True
    for i, a in enumerate(A):
        if not a:
            print(i+1)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
def main():
    x = tuple([int(t)for t in input().split()])

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

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import sys
stdin = sys.stdin
sys.setrecursionlimit(10**6)
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
nn = lambda: list(stdin.readline().split())
ns = lambda: stdin.readline().rstrip()

a = na()

print(a.index(0)+1)

Submission status: Accepted

Solution code:
#1問目
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())
f = 1
if b==0:
  f=2
if c==0:
  f=3
if d==0:
  f=4
if e==0:
  f=5
print(f)

Submission status: Accepted

Solution code:

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(4100000)

import math

import logging

logging.basicConfig(level=logging.DEBUG)

logger = logging.getLogger(__name__)


def resolve():
    # S = [x for x in sys.stdin.readline().split()][0]  # 文字列 一つ
    # N = [int(x) for x in sys.stdin.readline().split()][0]  # int 一つ
    # N, D = [int(x) for x in sys.stdin.readline().split()]  # 複数int
    h_list = [int(x) for x in sys.stdin.readline().split()]  # 複数int

    # grid = [list(sys.stdin.readline().split()[0]) for _ in range(N)]  # 文字列grid
    # v_list = [int(sys.stdin.readline().split()[0]) for _ in range(N)]
    # grid = [[int(x) for x in sys.stdin.readline().split()]
    #         for _ in range(N)]  # int grid

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


if __name__ == "__main__":
    resolve()

# AtCoder Unit Test で自動生成できる, 最後のunittest.main は消す
# python -m unittest template/template.py で実行できる
# pypy3 -m unittest template/template.py で実行できる

import sys
from io import StringIO
import unittest


class TestClass(unittest.TestCase):
    def assertIO(self, input, output):
        stdout, stdin = sys.stdout, sys.stdin
        sys.stdout, sys.stdin = StringIO(), StringIO(input)
        resolve()
        sys.stdout.seek(0)
        out = sys.stdout.read()[:-1]
        sys.stdout, sys.stdin = stdout, stdin
        self.assertEqual(out, output)

    def test_入力例_1(self):
        input = """0 2 3 4 5"""
        output = """1"""
        self.assertIO(input, output)

    def test_入力例_2(self):
        input = """1 2 0 4 5"""
        output = """3"""
        self.assertIO(input, output)

Submission status: Accepted

Solution code:
#!/usr/bin/python3
# -*- coding: utf-8 -*-
x = list(map(int, input().split()))
for i in range(5):
    if x[i] == 0:
        print(i + 1)

Submission status: Accepted

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


if __name__ == '__main__':
    main()

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)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

for i in range(1,6):
    if l[i-1]==0:
        print(i)
        exit()

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

print(15-sum(a))

Submission status: Accepted

Solution code:
a=input().split()
number=1
for a_ in a:
    if a_=='0':
        print(number)
    number+=1

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:
# A - Five Variables

X = list(int(x) for x in input().split())
print(X.index(0)+1)

Submission status: Accepted

Solution code:
from sys import stdin, setrecursionlimit
input = stdin.buffer.readline
setrecursionlimit(10 ** 7)

from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
from collections import deque, defaultdict, Counter
from itertools import combinations, permutations, combinations_with_replacement
from itertools import accumulate
from math import ceil, sqrt, pi, radians, sin, cos

MOD = 10 ** 9 + 7
INF = 10 ** 18

#N = int(input())
#N, M = map(int, input().split())
A = list(map(int, input().split()))
#A = [int(input()) for _ in range(N)]
#ABC = [list(map(int, input().split())) for _ in range(N)]

print(A.index(0) + 1)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math


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

Submission status: Accepted

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

Submission status: Accepted

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

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:
"""
    こんにちは。これはクシャルです
    
    Author : thekushalghosh (クシャル)
    Team   : CodeDiggers
 
    I prefer Python language over the C++ language :p :D
        
    Visit my website : thekushalghosh.github.io
"""
import sys,math,cmath,time
start_time = time.time()
##########################################################################
################# ---- THE ACTUAL CODE STARTS BELOW ---- #################

def solve():
    a = inlt()    
    print(a.index(0) + 1)
            
################## ---- THE ACTUAL CODE ENDS ABOVE ---- ##################
##########################################################################
 
def main():
    global tt
    if not ONLINE_JUDGE:
        sys.stdin = open("input.txt","r")
        sys.stdout = open("output.txt","w")
    t = 1
    for tt in range(t):
        solve()
    if not ONLINE_JUDGE:
        print("Time Elapsed :",time.time() - start_time,"seconds")
        sys.stdout.close()
    
#---------------------- USER DEFINED INPUT FUNCTIONS ----------------------#
def inp():
    return(int(input()))
def inlt():
    return(list(map(int,input().split())))
def insr():
    return(input().strip())
def invr():
    return(map(int,input().split()))
 
#------------------ USER DEFINED PROGRAMMING FUNCTIONS ------------------#
def counter(a):
    q = [0] * max(a)
    for i in range(len(a)):
        q[a[i] - 1] = q[a[i] - 1] + 1
    return(q)
 
def string_counter(a):
    q = [0] * 26
    for i in range(len(a)):
        q[ord(a[i]) - 97] = q[ord(a[i]) - 97] + 1
    return(q)

def power_two(n):
    if n == 1:
        return(True)
    sttr = str(n)
    len_str = len(sttr)
    sttr = list(sttr)
    num = 0
    if (len_str == 1 and sttr[len_str - 1] == '1'): 
        return(False)
    while (len_str != 1 or sttr[len_str - 1] != '1'):
        if ((ord(sttr[len_str - 1]) - ord('0')) % 2 == 1):
            return(False)
        j = 0; 
        for i in range(len_str):  
            num = num * 10 + (ord(sttr[i]) - ord('0')); 
            if (num < 2): 
                if (i != 0):  
                    sttr[j] = '0'
                    j += 1
                continue
  
            sttr[j] = chr((num // 2) + ord('0'))
            j += 1; 
            num = (num) - (num // 2) * 2
        len_str = j
    return(True)

def getLeftmostBit(n): 
    m = 0
    while (n > 1) : 
        n = n >> 1
        m += 1
    return(m)
def getNextLeftmostBit(n, m) : 
    temp = 1 << m 
    while (n < temp) : 
        temp = temp >> 1
        m -= 1
    return m
def bitcounter(n) :
    m = getLeftmostBit(n) 
    return _countSetBits(n, m) 
def _countSetBits(n, m) :
    if (n == 0) : 
        return 0
    m = getNextLeftmostBit(n, m)
    if (n == (1 << (m + 1)) - 1) : 
        return ((m + 1) * (1 << m))
    n = n - (1 << m)
    return (n + 1) + bitcounter(n) + m * (1 << (m - 1)) 

def log_two(n): 
    return(math.log(n) / math.log(2))

#-----------------------------------------------------------------------#
        
ONLINE_JUDGE = __debug__
if ONLINE_JUDGE:
    input = sys.stdin.readline
    
main()

Submission status: Accepted

Solution code:
from functools import reduce
from fractions import gcd
import math
import bisect
import itertools
import sys
sys.setrecursionlimit(10**7)
input = sys.stdin.readline
INF = float("inf")


# 処理内容
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:
x=[int(_) for _ in input().split()]
for i in range(5):
    if x[i]==0:
        print(i+1)

Submission status: Accepted

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

resolve()

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 = input().split()
for i in range(5):
  if x[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:
s = input().index('0')
print(s // 2 + 1)

Submission status: Accepted

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

Submission status: Accepted

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

ans = int(x.index(0)) + 1
print(ans)

Submission status: Accepted

Solution code:
import numpy as np
import functools
import operator

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


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

Submission status: Accepted

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

print(ans)

Submission status: Accepted

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

INF = 10**20
def main():
    X = list(map(int,input().split()))

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



if __name__ == "__main__":
  main()

Submission status: Accepted

Solution code:
A = list(map(int,input().rstrip().split(" ")))
for i in range(5):
    if A[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)
        break

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10 ** 5 + 10)
def input(): return sys.stdin.readline().strip()

def resolve():
    
    l=list(map(int,input().split()))
    for k,v in enumerate(l):
        if v==0:
            print(k+1)
            break
    
resolve()

Submission status: Accepted

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

a = x.index(0)

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X = list(map(int, input().split()))
ans = 15
for x in X:
    ans -= x
print(ans)

Submission status: Accepted

Solution code:
import sys


def input(): return sys.stdin.readline().strip()
def I(): return int(input())
def LI(): return list(map(int, input().split()))
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def S(): return input()
def LS(): return input().split()


x = LI()
ans = x.index(0) + 1
print(ans)

Submission status: Accepted

Solution code:
*x, = map(int, input().split())
for i in range(1, 6):
    if not i in x:
        print(i)
        break

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# A

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

Submission status: Accepted

Solution code:

import sys
import math
import itertools
import collections

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

Submission status: Accepted

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

print(a.index(0)+1)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
INT = lambda: int(input())
INTM = lambda: map(int,input().split())
STRM = lambda: map(str,input().split())
STR = lambda: str(input())
LIST = lambda: list(map(int,input().split()))
LISTS = lambda: list(map(str,input().split()))
def do(): 
    a=LIST()
    ans=[1,2,3,4,5]
    for i in ans:
        if not i in a:
            print(i)
if __name__ == '__main__':
    do()

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:
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
from itertools import permutations, accumulate, combinations, combinations_with_replacement
from math import sqrt, ceil, floor, factorial
from bisect import bisect_left, bisect_right, insort_left, insort_right
from copy import deepcopy
from operator import itemgetter
from functools import reduce, lru_cache  # @lru_cache(None)
from fractions import gcd
import sys
def input(): return sys.stdin.readline().rstrip()
sys.setrecursionlimit(10**6)
# ----------------------------------------------------------- #

X = list(int(x) for x in input().split())
for i, x in enumerate(X, start=1):
    if i != x:
        print(i)
        exit()

Submission status: Accepted

Solution code:
# print('input >>')
xs = list(map(int,(input().split())))

# print('-----output-----')
print(xs.index(0)+1)

Submission status: Accepted

Solution code:
from math import *

def cin(): # To take limited number of inputs
    return map(int,input().split())

def cins(): # To take space sepreated strings
    return input.split()

def cino(test=False): # To take individual int input (test = False)
    if not test:
        return int(input())
    else: # To take string input (test = True)
        return input()

def cina(): # array input
  return list(map(int,input().split()))

def ssplit(): # multiple string input
    return list(input().split())

def printlist(l): # To print space seperated array
    for i in l:
        print(i,end=" ")

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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


def solve(x: "List[int]"):
    for i in range(len(x)):
        if x[i] == 0:
            print(i+1)
            return
    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:
l = list(map(int,input().split()))
for i in range(len(l)):
    if l[i] == 0:
        print(i+1)

Submission status: Accepted

Solution code:
from sys import stdin


def main():
    _in = [_.rstrip() for _ in stdin.readlines()]
    x_arr = list(map(int, _in[0].split(' ')))  # type:list(int)
    # vvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvv
    for i,x in enumerate(x_arr):
        if x==0:
            ans = i+1
    # ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
    print(ans)

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import sys

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline

in_n = lambda: int(readline())
in_nn = lambda: map(int, readline().split())
in_s = lambda: readline().rstrip().decode('utf-8')


def main():

    x = list(in_nn())
    ans = x.index(0)
    print(ans + 1)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

def main():
    X = list(map(int, readline().rstrip().split()))
    for i, x in enumerate(X):
        if x != i + 1:
            print(i + 1)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**6)
from math import floor,ceil,sqrt,factorial,log
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
from copy import deepcopy
from operator import itemgetter
from fractions import gcd
mod = 10 ** 9 + 7
inf = float('inf')
ninf = -float('inf')
'''
#Pythonを用いる場合
#numpy 1.18.0, scipy 1.4.1, scikit-learn 0.22, numba 0.47.0, networkx 2.4
 
import numpy as np
from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson
from scipy.sparse import csr_matrix
'''
 
#整数input
def ii(): return int(sys.stdin.readline().rstrip()) #int(input())
def mii(): return map(int,sys.stdin.readline().rstrip().split())
def limii(): return list(mii()) #list(map(int,input().split()))
def lin(n:int): return [ii() for _ in range(n)]
def llint(n: int): return [limii() for _ in range(n)]
#文字列input
def ss(): return sys.stdin.readline().rstrip() #input()
def mss(): return sys.stdin.readline().rstrip().split()
def limss(): return list(mss()) #list(input().split())
def lst(n:int): return [ss() for _ in range(n)]
def llstr(n: int): return [limss() for _ in range(n)]

#本当に貪欲法か？ DP法では？？
#本当に貪欲法か？ DP法では？？
#本当に貪欲法か？ DP法では？？


x=limii()

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

Submission status: Accepted

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

for i in range(1, 5 + 1):
  if not i in x:
    print(i)
    exit()

Submission status: Accepted

Solution code:
def LI(): return list(map(int, input().split()))
def I(): return map(int, input().split())
mod = 10**9 + 7

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

  
if __name__ == '__main__':
  main()

Submission status: Accepted

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

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