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

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

Solution (Python):

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

Solution (Python):
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)

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

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

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

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

Solution (Python):
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)

Solution (Python):
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()  

x = na()

print(x.index(0)+1)

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

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

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

Solution (Python):
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)

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

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

Solution (Python):



import sys
sys.setrecursionlimit(10**7)
from pprint import pprint as pp
from pprint import pformat as pf



import math

import bisect


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

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

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

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

Solution (Python):
import sys

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

Solution (Python):
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)

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

Solution (Python):
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()

Solution (Python):
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)

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

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

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

Solution (Python):
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

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():  
    x = list(map(int, input().split()))
    print(15-sum(x))
if __name__ == "__main__":
    main()

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

Solution (Python):
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

Solution (Python):
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()

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

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

Solution (Python):
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())



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

Solution (Python):
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

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

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

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

Solution (Python):



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




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

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

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

Solution (Python):
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()

Solution (Python):
'''     
        
        
        

import sys
import math


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")  
    sys.stdout = open("output.txt","w")  
    sys.stderr = open("output.txt","w")  



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 !!
'''

Solution (Python):


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

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

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

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

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

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

Solution (Python):
*X, = map(int, input().split())
print(X.index(0) + 1)

Solution (Python):
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()

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

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

Solution (Python):




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

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

Solution (Python):

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

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

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

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

Solution (Python):
vars = list(map(int, input().split()))

print(vars.index(0) + 1)

Solution (Python):

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

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

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

Solution (Python):
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)

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

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


if __name__ == "__main__":
    main()

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

print(nums.index(0)+1)

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

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

Solution (Python):

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

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

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

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

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

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

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

Solution (Python):

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

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

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

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

Solution (Python):
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)

Solution (Python):
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)

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

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

Solution (Python):

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)

Solution (Python):
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()

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

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

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 8)

input = sys.stdin.readline


def main():
    X = [int(x) for x in input().split()]

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

    
    

if __name__ == '__main__':
    main()

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

if __name__ == "__main__":
    main()

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

Solution (Python):
def main():

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


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

Solution (Python):

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

print(15-sum(A))

Solution (Python):
import sys
from functools import lru_cache, cmp_to_key
from heapq import merge, heapify, heappop, heappush
from math import *
from collections import defaultdict as dd, deque, Counter as C
from itertools import combinations as comb, permutations as perm
from bisect import bisect_left as bl, bisect_right as br, bisect
from time import perf_counter
from fractions import Fraction

sys.setrecursionlimit(int(pow(10,6)))


mod = int(pow(10, 9) + 7)
mod2 = 998244353
def data(): return sys.stdin.readline().strip()
def out(*var, end="\n"): sys.stdout.write(' '.join(map(str, var))+end)
def l(): return list(sp())
def sl(): return list(ssp())
def sp(): return map(int, data().split())
def ssp(): return map(str, data().split())
def l1d(n, val=0): return [val for i in range(n)]
def l2d(n, m, val=0): return [l1d(n, val) for j in range(m)]



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

Solution (Python):
from __future__ import print_function
import sys


if sys.subversion[0] == "PyPy":
    import io, atexit

    sys.stdout = io.BytesIO()
    atexit.register(lambda: sys.__stdout__.write(sys.stdout.getvalue()))

    sys.stdin = io.BytesIO(sys.stdin.read())
    input = lambda: sys.stdin.readline().rstrip()
RS = raw_input
RA = lambda x=int: map(x, RS().split())
RN = lambda x=int: x(RS())


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





x = RA()
solve()

Solution (Python):
import sys,queue,math,copy,itertools,bisect,collections,heapq

def main():
    sys.setrecursionlimit(10**7)
    INF = 10**18
    MOD = 10**9 + 7
    LI = lambda : [int(x) for x in sys.stdin.readline().split()]
    _LI = lambda : [-int(x) for x in sys.stdin.readline().split()]
    NI = lambda : int(sys.stdin.readline())
    SI = lambda : sys.stdin.readline().rstrip()
    DD = ((1,0),(0,1),(-1,0),(0,-1))

    x = LI()

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

if __name__ == '__main__':
    main()

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

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


main()

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

Solution (Python):
import sys


import math
import collections

import bisect
import itertools
import fractions

import copy
import heapq
import decimal

import queue



sys.setrecursionlimit(10000001)
INF = 10 ** 16
MOD = 10 ** 9 + 7


ni = lambda: int(sys.stdin.readline())
ns = lambda: map(int, sys.stdin.readline().split())
na = lambda: list(map(int, sys.stdin.readline().split()))





def main():
    a = na()
    print(a.index(0)+1)


if __name__ == '__main__':
    main()

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

Solution (Python):

MOD = 10 ** 9 + 7
INFI = 10**10

import math
from collections import deque
import itertools
import heapq

from fractions import Fraction
import copy
from functools import lru_cache
from collections import defaultdict
import pprint


def sosuhante(n):
    for k in range(2, int(math.sqrt(n))+1):
        if n% k ==0:
            return False
    return True
def cmb(n, r):
    if n - r < r: r = n - r
    if r == 0: return 1
    if r == 1: return n

    numerator = [n - r + k + 1 for k in range(r)]
    denominator = [k + 1 for k in range(r)]

    for p in range(2,r+1):
        pivot = denominator[p - 1]
        if pivot > 1:
            offset = (n - r) % p
            for k in range(p-1,r,p):
                numerator[k - offset] /= pivot
                denominator[k] /= pivot

    result = 1
    for k in range(r):
        if numerator[k] > 1:
            result *= int(numerator[k])

    return result

def kingaku(a,b,n):
    keta=len(str(n))
    return a*n+b*keta

def my_index(l, x, default=False):
    if x in l:
        return l.index(x)
    else:
        return default




def ret(a):
    c=[None]*(len(a)-1)
    if len(a)==1:
        return a[0]
    elif len(a)==0:
        return 0
    for i in range(1,len(a)):
        c[i-1]=abs(a[i]-a[i-1])
    return ret(c)

def soinsubunkai(n):
    a = []
    i = 1
    while i*i <= n:
        if n % i == 0 and i!=1:
            a.append(i)
            n=n//i

        if n% i !=0 or i==1:
            i += 1
    nokori=[n]
    return a + nokori

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






if __name__ == "__main__":

    main()

Solution (Python):



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

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

Solution (Python):
def get_ints():
    return list(map(int, input().split()))

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

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

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

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

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

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

print(x.index(0)+1)

Solution (Python):
from heapq import heappush, heappop, heapify
from collections import deque, defaultdict, Counter
import itertools
from itertools import permutations, combinations, accumulate, product, combinations_with_replacement
import sys
import bisect
import string
import math
import time


def I(): return int(input())
def S(): return input()
def MI(): return map(int, input().split())
def MS(): return map(str, input().split())
def LI(): return [int(i) for i in input().split()]
def LI_(): return [int(i)-1 for i in input().split()]
def StoI(): return [ord(i)-97 for i in input()]
def ItoS(nn): return chr(nn+97)
def input(): return sys.stdin.readline().rstrip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]
def print_matrix(mat):
    for i in range(len(mat)):
        print(*['IINF' if v == IINF else "{:0=4}".format(v) for v in mat[i]])


yn = {False: 'No', True: 'Yes'}
YN = {False: 'NO', True: 'YES'}
MOD = 10**9+7
inf = float('inf')
IINF = 10**19
l_alp = string.ascii_lowercase
u_alp = string.ascii_uppercase
ts = time.time()
sys.setrecursionlimit(10**6)
nums = ['1', '2', '3', '4', '5', '6', '7', '8', '9', '10']
show_flg = False



def main():
    X = LI()

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


if __name__ == '__main__':
    main()

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

Solution (Python):


import sys
iim = lambda: map(int, sys.stdin.readline().rstrip().split())

def resolve():
    A = list(iim())

    print(A.index(0)+1)

if __name__ == "__main__":
    resolve()

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 8)
ini = lambda: int(sys.stdin.readline())
inm = lambda: map(int, sys.stdin.readline().split())
inl = lambda: list(inm())
ins = lambda: sys.stdin.readline().rstrip()


x = inl()


def solve():
    for i, y in enumerate(x):
        if y != i + 1:
            return i + 1
    return None


print(solve())

Solution (Python):
import re
import sys
from bisect import bisect, bisect_left, insort, insort_left
from collections import Counter, defaultdict, deque
from copy import deepcopy
from decimal import Decimal
from itertools import (
    accumulate, combinations, combinations_with_replacement, groupby,
    permutations, product)
from math import (acos, asin, atan, ceil, cos, degrees, factorial, gcd, hypot,
                  log2, pi, radians, sin, sqrt, tan)
from operator import itemgetter, mul
from string import ascii_lowercase, ascii_uppercase, digits


def inp():
    return(int(input()))


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


def instr():
    s = input()
    return(list(s[:len(s)]))


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


a = inlist()

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

Solution (Python):
from sys import stdin
def main():
    
    readline=stdin.readline
    a=list(map(int,readline().split()))

    for i in range(5):
        if a[i]!=i+1:
            print(i+1)
            break
    
if __name__=="__main__":
    main()

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

print(x.index(0)+1)

Solution (Python):










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


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

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

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