Problem:


Score : 100 points

Problem Statement

We have five variables x_1, x_2, x_3, x_4, and x_5.

The variable x_i was initially assigned a value of i.

Snuke chose one of these variables and assigned it 0.

You are given the values of the five variables after this assignment.

Find out which variable Snuke assigned 0.

Constraints

The values of x_1, x_2, x_3, x_4, and x_5 given as input are a possible outcome of the assignment by Snuke.

Input

Input is given from Standard Input in the following format:

x_1 x_2 x_3 x_4 x_5

Output

If the variable Snuke assigned 0 was x_i, print the integer i.

Sample Input 1

0 2 3 4 5

Sample Output 1

1

In this case, Snuke assigned 0 to x_1, so we should print 1.

Sample Input 2

1 2 0 4 5

Sample Output 2

3



Sample input:
0 2 3 4 5


Sample output:
1

Submission status: Accepted

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

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

Submission status: Accepted

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

if __name__ == '__main__':
    main()

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

Submission status: Accepted

Solution code:
import sys
import math
from collections import deque
from collections import defaultdict
from copy import deepcopy
from itertools import accumulate #リストを与えると累積和を返す
def input(): return sys.stdin.readline().rstrip()
from functools import lru_cache #メモ化

def main():
    N = list(map(int,sys.stdin.readline().split()))
    print(N.index(0)+1)

    return 0

if __name__ == "__main__":
    main()

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

Submission status: Accepted

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

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

Submission status: Accepted

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

readline = sys.stdin.readline

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

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
def ZZ(): return list(map(int, input().split()))
def Z(): return int(input())
 
x1,x2,x3,x4,x5 = ZZ()

for i,d in enumerate([x1,x2,x3,x4,x5]):
    if d == 0:
        print(i+1)

Submission status: Accepted

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

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:
from collections import deque
from heapq import heapify,heappop,heappush,heappushpop
from copy import copy,deepcopy
from itertools import product,permutations,combinations,combinations_with_replacement
from collections import defaultdict,Counter
from bisect import bisect_left,bisect_right
# from math import gcd,ceil,floor,factorial
# from fractions import gcd
from functools import reduce
from pprint import pprint
# from statistics import mean,median,mode

INF = float("inf")

def mycol(data,col):
    return [ row[col] for row in data ]

def mysort(data,col,reverse_flag):
    data.sort(key=lambda x:x[col],reverse=reverse_flag)
    return data

def mymax(data):
    M = -1*float("inf")
    for i in range(len(data)):
        m = max(data[i])
        M = max(M,m)
    return M

def mymin(data):
    m = float("inf")
    for i in range(len(data)):
        M = min(data[i])
        m = min(m,M)
    return m

def mycount(ls,x):
    # lsはソート済みであること
    l = bisect_left(ls,x)
    r = bisect_right(ls,x)
    return (r-l)

def myoutput(ls,space=True):
    if space:
        if len(ls)==0:
            print(" ")
        elif type(ls[0])==str:
            print(" ".join(ls))
        elif type(ls[0])==int:
            print(" ".join(map(str,ls)))
        else:
            print("Output Error")
    else:
        if len(ls)==0:
            print("")
        elif type(ls[0])==str:
            print("".join(ls))
        elif type(ls[0])==int:
            print("".join(map(str,ls)))
        else:
            print("Output Error")

def I():
    return int(input())

def MI():
    return map(int,input().split())

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

def CI(n):
    return [ int(input()) for _ in range(n) ]

def LI(n):
    return [ list(map(int,input().split())) for _ in range(n) ]

def S():
    return input()

def MS():
    return input().split()

def RS():
    return list(input().split())

def CS(n):
    return [ input() for _ in range(n) ]

def LS(n):
    return [ list(input().split()) for _ in range(n) ]

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

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:
import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return map(int, input().split())
sys.setrecursionlimit(10**9)

Xs = list(mapint())
print(Xs.index(0)+1)

Submission status: Accepted

Solution code:
import sys, math
input = sys.stdin.readline
rs = lambda: input().strip()
ri = lambda: int(input())
rl = lambda: list(map(int, input().split()))
mod = 10**9 + 7

X = rl()

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

Submission status: Accepted

Solution code:
*x, = map(int, 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:
a,b,c,d,e=map(int,input().split())
#b,w=map(int,input().split())
#t=int(input())
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:
# fall 7, stand 8...
# !/ankit_SM/bin/env python

from __future__ import division, print_function

import os
import sys
from io import BytesIO, IOBase

if sys.version_info[0] < 3:
    from __builtin__ import xrange as range
    from future_builtins import ascii, filter, hex, map, oct, zip

def main():
    tinn=1; #tinn=int(input())
    for tin in range(tinn):
        a=list(map(int,input().split()))
        print(a.index(0)+1)



# region fastio
BUFSIZE = 8192
class FastIO(IOBase):
    newlines = 0
    def __init__(self, file):
        self._fd = file.fileno()
        self.buffer = BytesIO()
        self.writable = "x" in file.mode or "r" not in file.mode
        self.write = self.buffer.write if self.writable else None
    def read(self):
        while True:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            if not b:
                break
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines = 0
        return self.buffer.read()
    def readline(self):
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.newlines = b.count(b"\n") + (not b)
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines -= 1
        return self.buffer.readline()
    def flush(self):
        if self.writable:
            os.write(self._fd, self.buffer.getvalue())
            self.buffer.truncate(0), self.buffer.seek(0)
class IOWrapper(IOBase):
    def __init__(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        self.write = lambda s: self.buffer.write(s.encode("ascii"))
        self.read = lambda: self.buffer.read().decode("ascii")
        self.readline = lambda: self.buffer.readline().decode("ascii")
def print(*args, **kwargs):
    sep, file = kwargs.pop("sep", " "), kwargs.pop("file", sys.stdout)
    at_start = True
    for x in args:
        if not at_start:
            file.write(sep)
        file.write(str(x))
        at_start = False
    file.write(kwargs.pop("end", "\n"))
    if kwargs.pop("flush", False):
        file.flush()
if sys.version_info[0] < 3:
    sys.stdin, sys.stdout = FastIO(sys.stdin), FastIO(sys.stdout)
else:
    sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")
# endregion
if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:

#!/usr/bin/python
# -*- 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:
x = list(map(int,input().split()))
for i in range(5):
    if x[i]==0:
        ans = i+1
        print(ans)
        break

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

Submission status: Accepted

Solution code:
*X, = map(int, 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)
        exit()

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    import sys
    input = sys.stdin.readline
    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:

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
import sys
import copy
from collections import deque
stdin = sys.stdin

mod = 10**9+7

ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip()  # ignore trailing spaces

x = na()

print(x.index(0)+1)

Submission status: Accepted

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

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:
import sys
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
x = LI()
print(x.index(0)+1)

Submission status: Accepted

Solution code:
import bisect
import copy
import heapq
import math
import sys
from collections import *
from functools import lru_cache
from itertools import accumulate, combinations, permutations, product
def input():
    return sys.stdin.readline()[:-1]
def ruiseki(lst):
    return [0]+list(accumulate(lst))
sys.setrecursionlimit(500000)
mod=pow(10,9)+7
al=[chr(ord('a') + i) for i in range(26)]
direction=[[1,0],[0,1],[-1,0],[0,-1]]

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

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

Submission status: Accepted

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

import sys
sys.setrecursionlimit(10**7)
from pprint import pprint as pp
from pprint import pformat as pf
# @pysnooper.snoop()
#import pysnooper # debug

import math
#from sortedcontainers import SortedList, SortedDict, SortedSet # no in atcoder
import bisect


if __name__ == '__main__':
    data = list(map(int, input().split()))
    for i, d in enumerate(data):
        if d == 0:
            print(i + 1)

    #print('\33[32m' + 'end' + '\033[0m') # debug

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
## io ##
def IS(): return sys.stdin.readline().rstrip()
def II(): return int(IS())
def MII(): return list(map(int, IS().split()))
def MIIZ(): return list(map(lambda x: x-1, MII()))
#======================================================#
def main():
    xx = MII()
    print(xx.index(0)+1)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys


def ip():
    return sys.stdin.readline()


def ipl():
    return sys.stdin.readline().split()


def solve():
    li = list(map(int, ipl()))
    print(li.index(0) + 1)


if __name__ == "__main__":
    solve()

Submission status: Accepted

Solution code:
from sys import stdin

a = [int(x) for x in stdin.readline().rstrip().split()]


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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import itertools
from collections import deque,defaultdict,Counter
from itertools import accumulate
import bisect
from heapq import heappop,heappush,heapify
import math
from copy import deepcopy
import queue
import numpy as np
# sympy as syp(素因数分解とか)
Mod = 1000000007
fact = [1, 1]
factinv = [1, 1]
inv = [0, 1] 
for i in range(2, 10**5 + 1):
    fact.append((fact[-1] * i) % Mod)
    inv.append((-inv[Mod % i] * (Mod // i)) % Mod)
    factinv.append((factinv[-1] * inv[-1]) % Mod)
    
def cmb(n, r, p):
    if (r < 0) or (n < r):
        return 0
    r = min(r, n - r)
    return fact[n] * factinv[r] * factinv[n - r] % p
    
def sieve_of_eratosthenes(n):
    if not isinstance(n,int):
        raise TypeError("n is not int")
    if n<2:
        raise ValueError("n is not effective")
    prime = [1]*(n+1)
    for i in range(2,int(math.sqrt(n))+1):
        if prime[i] == 1:
            for j in range(2*i,n+1):
                if j%i == 0:
                    prime[j] = 0
    res = []
    for i in range(2,n+1):
        if prime[i] == 1:
            res.append(i)
    return res

 
class UnionFind:
    def __init__(self,n):
        self.parent = [i for i in range(n+1)]
        self.rank = [0 for i in range(n+1)]
    
    def findroot(self,x):
        if x == self.parent[x]:
            return x
        else:
            y = self.parent[x]
            y = self.findroot(self.parent[x])
            return y
    
    def union(self,x,y):
        px = self.findroot(x)
        py = self.findroot(y)
        if px < py:
            self.parent[y] = px
        else:
            self.parent[px] = py
 
    def same_group_or_no(self,x,y):
        return self.findroot(x) == self.findroot(y)

def main():  #startline-------------------------------------------
    x = list(map(int, input().split()))
    print(15-sum(x))
if __name__ == "__main__":
    main() #endline===============================================

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin

A = list(map(int,stdin.readline().split()))
start=1

for t in A:
    if t==0:
        print(start)
        break
    start+=1

Submission status: Accepted

Solution code:
S=lambda:input()
I=lambda:int(input())
L=lambda:list(map(int,input().split()))
LS=lambda:list(map(str,input().split()))

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from math import ceil,sqrt,log,gcd
def ii():return int(input())
def si():return input()
def mi():return map(int,input().split())
def li():return list(mi())


# for _ in range(ii()):
    
a=li()
for i in range(5):
    if a[i]==0:
        print(i+1)
        break

Submission status: Accepted

Solution code:
import math
import fractions
import collections
import itertools
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=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(5):
    if x[i] == 0:
        ans = i+1
print(ans)

Submission status: Accepted

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

import sys
from collections import defaultdict, deque
from heapq import heappush, heappop
import math
import bisect
input = sys.stdin.readline

# 再起回数上限変更
# sys.setrecursionlimit(1000000)

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

for idx, x in enumerate(x):
    if x == 0:
        print(idx+1)
        sys.exit()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin, setrecursionlimit


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


if __name__ == "__main__":
    setrecursionlimit(10000)
    main()

Submission status: Accepted

Solution code:
'''     ##     ##  #######  # #  ######
        ##     ##  ##   ##  ###    ##
        ##     ##  ##    #  # #    ##
        #########  #######  # #    ##    '''

import sys
import math
# sys.setrecursionlimit(10**6)

def get_ints(): return map(int, input().strip().split())
def get_list(): return list(get_ints())

def printspx(*args): return print(*args, end="")
def printsp(*args): return print(*args, end=" ")
def printchk(*args): return print(*args, end=" \ ")

MODPRIME = int(1e9+7); BABYMODPR = 998244353;

ONLINE_JUDGE = 1
if not ONLINE_JUDGE:
    sys.stdin = open("input.txt","r")  # <<<  Comment this line  >>> #
    sys.stdout = open("output.txt","w")  # <<<  Comment this line  >>> #
    sys.stderr = open("output.txt","w")  # <<<  Comment this line  >>> #

# int(input())
# get_ints()
li = get_list()
print(li.index(0)+1)


'''
>>> COMMENT THE STDIN!! CHANGE ONLINE JUDGE !!
THE LOGIC AND APPROACH IS BY ME @luctivud ( UDIT GUPTA )
SOME PARTS OF THE CODE HAS BEEN TAKEN FROM WEBSITES LIKE::
(I Own the code if no link is provided here or I may have missed mentioning it)
DO NOT PLAGIARISE.
TESTCASES:
>>> COMMENT THE STDIN!! CHANGE ONLINE JUDGE !!
'''

Submission status: Accepted

Solution code:
# coding: utf-8
#import numpy as np
import re
import math
from collections import defaultdict
from collections import deque
import collections
from fractions import Fraction
import bisect
from queue import PriorityQueue
import itertools
from itertools import accumulate
from copy import deepcopy
import random
import time
import os
import sys
import datetime
from functools import lru_cache
from functools import reduce
readline=sys.stdin.readline
sys.setrecursionlimit(2000000)
alphabet="abcdefghijklmnopqrstuvwxyz"
numbers="0123456789"
mod=int(10**9+7)
inf=int(10**19)
class Edge():
    def __init__(self,x,y,val=1):
        self.x=x
        self.y=y
        self.val=val
class unionfind():
    def __init__(self,n):
        self.n=n
        self.P=[a for a in range(n)]
        self.rank=[0]*n
 
    def find(self,x):
        if(x!=self.P[x]):
            self.P[x]=self.find(self.P[x])
        return self.P[x]
 
    def same(self,x,y):
        return self.find(x)==self.find(y)
 
    def link(self,x,y):
        if self.rank[x]<self.rank[y]:
            self.P[x]=y
        elif self.rank[y]<self.rank[x]:
            self.P[y]=x
        else:
            self.P[x]=y
            self.rank[y]+=1
 
    def unite(self,x,y):
        self.link(self.find(x),self.find(y))
 
    def size(self):
        S=set()
        for a in range(self.n):
            S.add(self.find(a))
        return len(S)
def yn(b):
    if b:print("yes")
    else:print("no")
def Yn(b):
    if b:print("Yes")
    else:print("No")
def YN(b):
    if b:print("YES")
    else:print("NO")
def ispow(a,b):
    now=b
    while now<a:
        now*=b
    return now==a
def getbin(num,size):
    A=[0]*size
    for a in range(size):
        if (num>>(size-a-1))&1==1:
            A[a]=1
        else:
            A[a]=0
    return A
def getfacs(n,mod_=0):
    A=[1]*(n+1)
    for a in range(2,len(A)):
        A[a]=A[a-1]*a
        if(mod_>0):A[a]%=mod_
    return A
def comb(n,r,mod,fac):
    if(n-r<0):return 0
    return (fac[n]*pow(fac[n-r],mod-2,mod)*pow(fac[r],mod-2,mod))%mod
def nextcomb(num,size):
    x=num&(-num)
    y=num+x
    z=num&(~y)
    z//=x
    z=z>>1
    num=(y|z)
    if(num>=(1<<size)):return False
    else:return num
def getprimes(n):
    if n==0:return []
    A=[True]*(n+1)
    A[0]=False
    A[1]=False
    for a in range(2,n+1):
        if A[a]:
            for b in range(a*2,n+1,a):
                A[b]=False
    ret=[]
    for a in range(n+1):
        if(A[a]):ret.append(a)
    return ret
def isprime(num):
    if(num<=1):return False
    i=2
    while i*i<=num:
       if(num%i==0):return False
       i+=1
    return True
def ifelse(bbool,ret1,ret2):
    if bbool:return ret1
    else:return  ret2
def join(A,c=" "):
    n=len(A)
    A=list(map(str,A))
    return c.join(A)
def factorize(n):
    b = 2
    ret=defaultdict(int)
    while b * b <= n:
        while n % b == 0:
            n //= b
            ret[b]+=1
        b+=1
    if n > 1:ret[n]+=1
    return ret
def pm(x):
    return x//abs(x)
def inputintlist(): 
    return list(map(int,input().split()))
def inputfloatlist(): 
    return list(map(float,input().split()))
def tozero(A):
    ret=[None]*len(A)
    for a in range(len(A)):
        ret[a]=A[a]-1
    return ret
def istanchouzouka(A):
    f=True
    prev=min(A)-1
    for a in A:
        if prev>=a:
            f=False
        prev=a
    return f
def istanchouhigensyou(A):
    f=True
    prev=min(A)-1
    for a in A:
        if prev>a:
            f=False
        prev=a
    return f
def getallsum(A):
    s=sum(A)
    dp=defaultdict(int)
    dp[0]=1
    for a in range(0,len(A)):
        for b in range(s,-1,-1):
            if b-A[a]>=0:
                dp[b]+=dp[b-A[a]]
    return dp
def yuukoutomukou(edges):
    ret=deepcopy(edges)
    for edge in edges:
        if not edge.x==edge.y:
            ret.append(Edge(edge.y,edge.x,edge.val))
    return ret
def dijkstra(edges,V,start):
    mincost=[inf]*V
    G=[[] for a in range(V)]
    for edge in edges:
        G[edge.x].append([edge.val,edge.y])
    Q=PriorityQueue()
    Q.put([0,start])#[cost,x]
    while not Q.empty():
        nowcost,nowx=Q.get()
        if mincost[nowx]==inf:
            mincost[nowx]=nowcost
            for cost,y in G[nowx]:
                newcost=nowcost+cost
                Q.put([newcost,y])
    return mincost
def warshallfloyd(edges,V):
    mincost=[[inf for b in range(V)] for a in range(V)]
    for a in range(V):mincost[a][a]=0
    for edge in edges:
        mincost[edge.x][edge.y]=min(mincost[edge.x][edge.y],edge.val)#x→yが複数ある場合のためにmin()する
    for k in range(V):
        for s in range(V):
            for t in range(V):
                if mincost[s][k]==inf or mincost[k][t]==inf:continue
                mincost[s][t]=min(mincost[s][t],mincost[s][k]+mincost[k][t])
    return mincost
def bellemanford(edges,V,start):
    mincost=[inf]*V
    mincost[start]=0
    for _ in range(V):
        for edge in edges:
            if mincost[edge.x]==inf:continue
            mincost[edge.y]=min(mincost[edge.y],mincost[edge.x]+edge.val)
    return mincost
def getmd(x1,y1,x2,y2):
    return abs(x1-x2)+abs(y1-y2)
def geted(x1,y1,x2,y2):
    return math.sqrt((x1-x2)**2+(y1-y2)**2)
class fordfulkerson():
    def __init__(self,edges,V,s,t):
        self.V=V
        self.used=[False]*V
        self.G=[[] for a in range(V)]
        self.s=s
        self.t=t
        for edge in edges:
            self.G[edge.x].append({"x":edge.x,"y":edge.y,"cap":edge.val,"rev":len(self.G[edge.y])})
            self.G[edge.y].append({"x":edge.y,"y":edge.x,"cap":0,"rev":len(self.G[edge.x])-1})
    def dfs(self,v,t,f=inf):
        if v==t:return f
        self.used[v]=True
        for a in range(len(self.G[v])):
            x=self.G[v][a]["x"]
            y=self.G[v][a]["y"]
            cap=self.G[v][a]["cap"]
            rev=self.G[y][self.G[x][a]["rev"]]
            if self.used[y] or cap==0:continue
            f2=self.dfs(y,t,min(f,cap))
            if f2>0:
                self.G[v][a]["cap"]-=f2
                rev["cap"]+=f2
                return f2
        return 0
    def maxflow(self):
        flow=0
        while True:
            self.used=[False]*V
            zouka=self.dfs(self.s,self.t)
            if zouka==0:break
            flow+=zouka
        return flow
def heron(a,b,c):
    s=(a+b+c)/2
    S=s(s-a)(s-b)(a-c)
    S=math.sqrt(S)
    return S
def getAreaOfTriangle(x1,y1,x2,y2,x3,y3):
    a=geted(x1,y1,x2,y2)
    b=geted(x2,y2,x3,y3)
    c=geted(x3,y3,x1,y1)
    return heron(a,b,c)






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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#float型を許すな
#numpyはpythonで
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right
from heapq import heapify, heappop, heappush
from math import floor, ceil,pi,factorial
from operator import itemgetter
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def LI2(): return [int(input()) for i in range(n)]
def MXI(): return [[LI()]for i in range(n)]
def SI(): return input().rstrip()
def printns(x): print('\n'.join(x))
def printni(x): print('\n'.join(list(map(str,x))))
inf = 10**17
mod = 10**9 + 7

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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


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

    for i, a in enumerate(a_list):
        if a == 0:
            print(i + 1)
            return


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
ls = [int(i) for i in input().split()]
ans = 0
for i in range(1,6):
    if ls[i-1] == 0:
        ans = i
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

print(nums.index(0)+1)

Submission status: Accepted

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


input = sys.stdin.readline
def IS(cb): return cb(input().strip())
def IL(cb): return [cb(s) for s in input().strip().split()]
def IR(cb, rows): return [IS(cb) for _ in range(rows)]
def ILL(cb, rows): return [IL(cb) for _ in range(rows)]


def solve():
    A= IL(int)
    print(A.index(0) + 1)


solve()

Submission status: Accepted

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

for ix, i in enumerate(A):
    if i == 0:
        print(ix+1)
        break

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:

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

Submission status: Accepted

Solution code:
def input_int():
    return map(int, input().split())

def one_int():
    return int(input())

def one_str():
    return input()

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

X= many_int()

print(X.index(0)+1)

Submission status: Accepted

Solution code:
import sys
import heapq, math
from itertools import zip_longest, permutations, combinations, combinations_with_replacement
from itertools import accumulate, dropwhile, takewhile, groupby
from functools import lru_cache
from copy import deepcopy

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
input = sys.stdin.readline

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

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline


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


if __name__ == '__main__':
    main()