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()))
print(x.index(0)+1)

Solution (Python):
import sys
import math
import collections
import decimal
import itertools
from collections import deque
from functools import reduce
import heapq



x = list(map(int, sys.stdin.readline().split()))
     

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

Solution (Python):
import sys, os, math, bisect, itertools, collections, heapq, queue
from scipy.sparse.csgraph import csgraph_from_dense, floyd_warshall
from decimal import Decimal
from collections import defaultdict



sys.setrecursionlimit(10000000)

ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]

iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
sl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]

lcm = lambda x, y: (x * y) // math.gcd(x, y)


MOD = 10 ** 9 + 7
MAX = float('inf')


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

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


if __name__ == '__main__':
    main()

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

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

Solution (Python):
import sys

aaa = list(map(int, sys.stdin.buffer.read().split()))
for i in range(1, 6):
    if i not in aaa:
        print(i)
        break

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

Solution (Python):

from collections import deque, Counter
from heapq import heappop, heappush
from bisect import bisect_right

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

if __name__ == "__main__":
    main()

Solution (Python):
a = [int(num) for num in input().split()]
print(15-sum(a))

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

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

Solution (Python):
MOD = 10**9+7

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

def ii():
    return int(input())

def main():
    x = list(mi())
    print(x.index(0)+1)


if __name__ == '__main__':
    main()

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

Solution (Python):
L = [c for c in map(int,input().split())]
print(L.index(0)+1)

Solution (Python):

import sys
input = sys.stdin.readline
ipnl = lambda n: [int(input()) for _ in range(n)]
inp = lambda :int(input())
ip = lambda :[int(w) for w in input().split()]

x = ip()
print(x.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 math

import queue
from collections import deque,defaultdict
import heapq as hpq
from sys import stdin,setrecursionlimit


ipt = stdin.readline
setrecursionlimit(10**7)

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


    return

if __name__ == '__main__':
    main()

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

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

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

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

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

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

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7


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


if __name__ == '__main__':
    resolve()

Solution (Python):

from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations, accumulate
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [list(x) for x in sys.stdin.readline().split()]
def S():
    res = list(sys.stdin.readline())
    if res[-1] == "\n":
        return res[:-1]
    return res
def IR(n):
    return [I() for i in range(n)]
def LIR(n):
    return [LI() for i in range(n)]
def SR(n):
    return [S() for i in range(n)]
def LSR(n):
    return [LS() for i in range(n)]

sys.setrecursionlimit(1000000)
mod = 1000000007

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


if __name__ == "__main__":
    solve()

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

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

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

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

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

Solution (Python):






from collections import deque,defaultdict











import sys
sys.setrecursionlimit(10000000)
mod = 10**9 + 7

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

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

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

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

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

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


if __name__ == '__main__':
    main()

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

print(As.index(0) + 1)

Solution (Python):
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, acos, atan, asin, log, log10, gcd
from itertools import permutations, combinations, product, accumulate, combinations_with_replacement
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits

from decimal import *
def debug(*args):
    if debugmode:
        print(*args)
def input(): return sys.stdin.readline().strip()
def STR(): return input()
def INT(): return int(input())
def FLOAT(): return float(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))
def lcm(a, b): return a * b // gcd(a, b)
sys.setrecursionlimit(10 ** 9)
inf = sys.maxsize
mod = 10 ** 9 + 7
dx = [0, 1, 0, -1, 1, -1, -1, 1]
dy = [1, 0, -1, 0, 1, -1, 1, -1]
debugmode = True

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

Solution (Python):
import sys
input=sys.stdin.readline
sys.setrecursionlimit(10**6)

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

Solution (Python):
import sys

input = sys.stdin.readline


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

    ans = x.index(0) + 1

    print(ans)


if __name__ == "__main__":
    main()

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

Solution (Python):
a,b,c,d,e = map(int,input().split())
print(15-a-b-c-d-e)

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

Solution (Python):
from sys import stdin
from sys import setrecursionlimit
from collections import Counter, deque, defaultdict
from math import floor, ceil
from bisect import bisect_left
from itertools import combinations
setrecursionlimit(100000)

INF = int(1e10)
MOD = int(1e9 + 7)

def main():
    from builtins import int, map
    A = list(map(int, input().split()))
    print(A.index(0) + 1)

if __name__ == '__main__':
    main()

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

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, gcd
from itertools import accumulate, permutations, combinations, product, groupby, combinations_with_replacement
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

x = LIST()
print(x.index(0)+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):

import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
input=lambda: sys.stdin.readline().rstrip()
YesNo=lambda b: bool([print('Yes')] if b else print('No'))
YESNO=lambda b: bool([print('YES')] if b else print('NO'))
int1=lambda x:int(x)-1

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

print(x.index(0)+1)

Solution (Python):
import bisect
import cmath
import heapq
import itertools
import math
import operator
import os
import random
import re
import string
import sys
from collections import Counter, defaultdict, deque
from copy import deepcopy
from decimal import Decimal
from functools import lru_cache, reduce
from math import gcd
from operator import add, itemgetter, mul, xor

import numpy as np

if os.getenv("LOCAL"):
    sys.stdin = open("_in.txt", "r")

sys.setrecursionlimit(10 ** 9)
INF = float("inf")
IINF = 10 ** 18
MOD = 10 ** 9 + 7




X = list(map(int, sys.stdin.buffer.readline().split()))
print(X.index(0)+1)

Solution (Python):
a,b,c,d,e = list(map(int,input().split()))
print(15-a-b-c-d-e)