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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A, B, C, D, E =map(int,input().split())
if A ==0:
  print('1')
if B ==0:
  print('2')
if C ==0:
  print('3')
if D ==0:
  print('4')
if E ==0:
  print('5')

Submission status: Accepted

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

Submission status: Accepted

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

print(X.index(0) + 1)

Submission status: Accepted

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

for i in number:
    if i == "0":
        print(number.index(i)+1)
    else:
        pass

Submission status: Accepted

Solution code:
import sys
readline = sys.stdin.readline
sys.setrecursionlimit(10**8)
mod = 10**9+7
#mod = 998244353
INF = 10**18
eps = 10**-7

import itertools

x = list(map(int,readline().split()))
print(x.index(0)+1)

Submission status: Accepted

Solution code:
from sys import stdin


def readline_from_stdin() -> str:
    return stdin.readline().rstrip


if __name__ == '__main__':
    pass
    # N = input()
    # X, Y, Z = input().split()
    # A = [int(i) for i in input().split()]
    X = [int(i) for i in input().split()]
    for idx, v in enumerate(X):
        if v == 0:
            print(idx+1)
            exit(0)

Submission status: Accepted

Solution code:
from collections import defaultdict, deque
from functools import reduce
from operator import mul
import sys
import heapq
import bisect
import itertools
import queue
import copy
import time
import math
sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
eps = 10**-7

def inp(): return int(sys.stdin.readline())

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

def inpl_str(): return list(sys.stdin.readline().split())

X = inpl()
if X[0] == 0:
    print(1)
elif X[1] == 0:
    print(2)
elif X[2] == 0:
    print(3)
elif X[3] == 0:
    print(4)
elif X[4] == 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:
s = input().split(' ')
print(s.index('0') + 1)

Submission status: Accepted

Solution code:
#入力:[n1,n2,...nk](int:整数配列)
def input_array():
	return list(map(int,input().split()))
  
X=input_array()
for i in range(len(X)):
	if X[i] == 0:
		print(i+1)
		break

Submission status: Accepted

Solution code:
a=input()
a=a.split(" ")
c=0
for i in a:
    c+=1
    if i==str(0):
        break
print(c)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

a = int (a)

b = int (b)

c = int (c)

d = int (d)

e = int (e)

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

Submission status: Accepted

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

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

print(count)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import collections
import itertools
import math
import statistics
import datetime
from bisect import bisect_left
import heapq

__author__ = 'sudoplox // Sudhanshu'
__contact__ = "sudoplox[at]gmail.com"


def BinarySearch(a, x):
    i = bisect_left(a, x)
    if i != len(a) and a[i] == x:
        return i
    else:
        return -1


def fibonacci(n):
    a = 0
    b = 1
    if n < 0:
        print("Incorrect input")
    elif n == 0:
        return a
    elif n == 1:
        return b
    else:
        for i in range(2, n):
            c = a + b
            a = b
            b = c
        return b


def ngreatestelem(lis, n):
    return heapq.nlargest(n, lis)


def nsmallestelem(lis, n):
    return heapq.nsmallest(n, lis)


def gcd(a, b):
    while b:
        a, b = b, a % b
    return a


def sieve():
    # Complexity: O(n * log2(log2(n)))
    primes[1] = 1
    primes[2] = 2
    j = 4
    while j < 1000000:
        primes[j] = 2
        j += 2
    j = 3
    while j < 1000000:
        if primes[j] == 0:
            primes[j] = j
            i = j * j
            k = j << 1
            while i < 1000000:
                primes[i] = j
                i += k
        j += 2


def possiblepermutations(lis):
    return itertools.permutations(lis)


sieve = False
if sieve:
    primes = [0] * 1000000

# for _ in range(int(input())):
#     n = int(input())
#     s = input()
#     arr = list(map(int, input().split(" ")))

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

Submission status: Accepted

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



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

Submission status: Accepted

Solution code:
data = []
k = input()
n=1
for i in k:
	#print(i,n)
	if i is '0':
		print(n)
		break
	if i is not ' ':
		n+=1

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(xlist.index(0) + 1)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
from sys import exit

for index, value in enumerate(input().split(), 1):
    if value == '0':
        print(index)
        exit()

Submission status: Accepted

Solution code:
import numpy as np

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

print(np.argmin(num)+1)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = int(input().replace(' ', ''))
b = 12345
c = b-a
while c >= 10:
  c = c//10
  
print(c)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

ans = 0
for idx in range(len(xlist)):
  if xlist[idx]==0:
    ans = idx+1

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

# https://atcoder.jp/contests/abc170/submissions/14859224
a = list(map(int, input().split()))
print(a.index(0) + 1)

Submission status: Accepted

Solution code:
S = set(range(1,6))
A = set(map(int,input().split()))
print((S-A).pop())

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
list = [int(s) for s in input().split()]
sum = 0
for i in range(int(len(list))):
    sum += int(list[i])
print(15 - sum)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
a,b,c,d,e = [int(a) for a in input().split()]
l=[a,b,c,d,e]
for i in range(5):
  if l[i]==0:
    print(i+1)
    break

Submission status: Accepted

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

for i in data:
    if num != i:
      print(num)
    num += 1

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin,stdout
LI=lambda:list(map(int,input().split()))
MAP=lambda:map(int,input().split())
IN=lambda:int(input())
S=lambda:input()
import math
from collections import Counter,defaultdict


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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
l = list(map(int,input().split()))
xr = 0
for i in range(1,6):
  xr ^= i
for i in l:
  xr ^= i
print(xr)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

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













#sys.stdin = open('input.py', 'r')
#sys.stdout = open('output.py', 'w') 
if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
ii = lambda:int(input())
mi = lambda:list(map(int,input().split()))
ix = lambda x:list(input() for _ in range(x))
mix = lambda x:list(mi() for _ in range(x))
iix = lambda x:list(int(input()) for _ in range(x))
##########

def resolve():
    lst_x = mi()
    res = 0
    for i in range(len(lst_x)):
        if lst_x[i] == 0:
            res = i+1
            break
    print(res)

if __name__ == "__main__":
    resolve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np

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

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

Submission status: Accepted

Solution code:
#170A
#Five Variables

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
# sys.setrecursionlimit(100000)

def main():
    x = [int(i) for i in input().strip().split()]
    
    return x.index(0)+1

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == '__main__':
	main()

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

print(li.index(0) + 1)

Submission status: Accepted

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

Submission status: Accepted

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

if a[0] == "0":
  print(1)

if a[1] == "0":
  print(2)

if a[2] == "0":
  print(3)

if a[3] == "0":
  print(4)

if a[4] == "0":
  print(5)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
nums = input()

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

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")
elif x[4] == 0:
  print("5")

Submission status: Accepted

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

Submission status: Accepted

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

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

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)  
elif x[4]==0:
  print(5)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
nums = list(map(int, input().rstrip().split(' ')))
for i, n in enumerate(nums):
  if n == 0:
    print(i + 1)

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#!/usr/bin/python3
import sys
input = lambda: sys.stdin.readline().strip()
a = [int(x) for x in input().split()]
print(a.index(0) + 1)

Submission status: Accepted

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

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

print(x.index(0) + 1)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
from sys import stdin
data = stdin.readline().rstrip()


b = [int(s) for s in data.split()]
print(b.index(0)+1)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

for i, num in enumerate(num_list, start=1):
  if num == 0:
    print(i)

Submission status: Accepted

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

Submission status: Accepted

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

ans=1 
for x in Xlist:
	if x==0:
		print(ans)
	else:
		ans=ans+1

Submission status: Accepted

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

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()))
S = sum(x)
print(15-S)

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

c = 0
for i in A:
    c += 1
    if i == 0:
        print(c)

Submission status: Accepted

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

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

print(result)

Submission status: Accepted

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

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

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

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:
arr = list(map(int,input().split()))
print(15-sum(arr))

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

for idx, x in enumerate(X):
  if x == 0:
    print(idx + 1)
  else:
    pass

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# atcoder 
# Türkler var mı?
# Herkese memnün oldum
import sys

iimr = lambda: map(int, sys.stdin.readline().rstrip().split())
readline = sys.stdin.readline
sys.setrecursionlimit(10 ** 8)


def 関数(liste):
    for index,val in enumerate(liste):
        if val == 0:
            return index + 1

def çözmek():
    x_liste = list(map(int, sys.stdin.readline().split()))

    res = []
    res.append(関数(x_liste))
    print(*res, sep="\n")

if __name__ == "__main__":
    çözmek()

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()))
a = 0

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = input().split()
for i in range(5):
  if i == int(a[i])-1:
    continue
  else:
    print(i+1)

Submission status: Accepted

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


if __name__ == '__main__':
    resolve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r = 1
for i in input().split(' '):
 r ^= int(i)
print(r)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

resolve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10 ** 9)
# input = sys.stdin.readline    ####
def int1(x): return int(x) - 1
def II(): return int(input())
def MI(): return map(int, input().split())
def MI1(): return map(int1, input().split())
def LI(): return list(map(int, input().split()))
def LI1(): return list(map(int1, input().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def MS(): return input().split()
def LS(): return list(input())
def LLS(rows_number): return [LS() for _ in range(rows_number)]
def printlist(lst, k=' '): print(k.join(list(map(str, lst))))
INF = float('inf')
# from math import ceil, floor, log2
# from collections import deque
# from itertools import combinations as comb, combinations_with_replacement as comb_w, accumulate, product, permutations
# from heapq import heapify, heappop, heappush
# import numpy as np
# from numpy import cumsum  # accumulate

def solve():
    X = LI()

    sm = sum(X)
    print(15-sm)

if __name__ == '__main__':
    solve()

Submission status: Accepted

Solution code:
import numpy as np
x = list(map(int, input().split()))

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

Submission status: Accepted

Solution code:
X = 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:
        pass
    else:
    	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:
num = list(map(int, input().split()))

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import os
import sys
from collections import defaultdict, Counter
from itertools import product, permutations,combinations, accumulate
from operator import itemgetter
from bisect import bisect_left,bisect
from heapq import heappop,heappush,heapify
from math import ceil, floor, sqrt
from copy import deepcopy

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

if __name__ == "__main__":
    main()

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

for i in range(0,len(x)):

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x1, x2, x3, x4, x5 =map(int, input().split())
list=[x1,x2,x3,x4,x5]
for idx, i in enumerate(list):
  if i==0:
    print(idx+1)

Submission status: Accepted

Solution code:
a =[1,2,3,4,5]
x = list(map(int,input().split()))
for num in range(5):
  if(a[num] != x[num]):
    print("{}".format(num+1))