TnT/CodeNet4Repair huggingface dataset:
Problem:
You are given an H × W grid.   The squares in the grid are described by H strings, S_1,...,S_H.   The j-th character in the string S_i corresponds to the square at the i-th row from the top and j-th column from the left (1 \leq i \leq H,1 \leq j \leq W).   `.` stands for an empty square, and `#` stands for a square containing a bomb.  Dolphin is interested in how many bomb squares are horizontally, vertically or diagonally adjacent to each empty square.   (Below, we will simply say "adjacent" for this meaning. For each square, there are at most eight adjacent squares.)   He decides to replace each `.` in our H strings with a digit that represents the number of bomb squares adjacent to the corresponding empty square.  Print the strings after the process.

Incorrect submission (verdict: Wrong Answer):
H,W = map(int,input().split())
A = []
for i in range(H):
  A.append(list(input()))

for h in range(H):
  for w in range(W):
    if A[h][w] == "#":
      print("#",end="")
    elif A[h][w] == ".":
      c = 0 
      for i in range(-1,2):
        for j in range(-1,2):
          if 0<=h+i<=h and 0<=w+j<=w and A[h+i][w+j]=="#":
            c+=1
      print(c,end="")
  print("")

Fixed, accepted submission:
H,W = map(int,input().split())
A = []
for i in range(H):
  A.append(list(input()))

for h in range(H):
  for w in range(W):
    if A[h][w] == "#":
      print("#",end="")
    elif A[h][w] == ".":
      c = 0 
      for i in range(-1,2):
        for j in range(-1,2):
          if 0<=h+i<=H-1 and 0<=w+j<=W-1 and A[h+i][w+j]=="#":
            c+=1
      print(c,end="")
  print("")
Problem:
In the beginning, Takahashi has A cookies, and Aoki has B cookies. They will perform the following operation alternately, starting from Takahashi:    * If the number of cookies in his hand is odd, eat one of those cookies; if the number is even, do nothing. Then, give one-half of the cookies in his hand to the other person.  Find the numbers of cookies Takahashi and Aoki respectively have after performing K operations in total.

Incorrect submission (verdict: Wrong Answer):
A, B, K= map(int, input().split())


for i in range(int(K)):
	if A % 2 != 0 :	
		A += -1
	B += A/2
	A -= A/2
	if B % 2 != 0 :	
		B+= -1
	A += B/2
	B -= B/2
print(int(A) , int(B))

Fixed, accepted submission:
A, B, K= map(int, input().split())

for i in range(int(K)):
	if i % 2 == 0:
		if A % 2 != 0 :	A += -1
		B += A/2
		A -= A/2
	else:
		if B % 2 != 0 :	B+= -1
		A += B/2
		B -= B/2
print(int(A) , int(B))
Problem:
Takahashi has a strong stomach. He never gets a stomachache from eating something whose "best-by" date is at most X days earlier. He gets a stomachache if the "best-by" date of the food is X+1 or more days earlier, though.  Other than that, he finds the food delicious if he eats it not later than the "best-by" date. Otherwise, he does not find it delicious.  Takahashi bought some food A days before the "best-by" date, and ate it B days after he bought it.  Write a program that outputs `delicious` if he found it delicious, `safe` if he did not found it delicious but did not get a stomachache either, and `dangerous` if he got a stomachache.

Incorrect submission (verdict: Wrong Answer):
x,a,b=map(int,input().split())
if b>=a:
  print("delicious")
elif x+a>=b:
  print("safe")
else:
  print("dangerous")
  

Fixed, accepted submission:
x,a,b=map(int,input().split())
if b<=a:
  print("delicious")
elif x+a>=b:
  print("safe")
else:
  print("dangerous")
Problem:
Rng is preparing a problem set for a qualification round of CODEFESTIVAL.  He has N candidates of problems. The difficulty of the i-th candidate is D_i.  There must be M problems in the problem set, and the difficulty of the i-th problem must be T_i. Here, one candidate of a problem cannot be used as multiple problems.  Determine whether Rng can complete the problem set without creating new candidates of problems.

Incorrect submission (verdict: Wrong Answer):
N = int(input())
D = sorted(list(map(int, input().split())))

M = int(input())
T = sorted(list(map(int, input().split())))

if N < M:
    print('No')
else:
    ind = 0
    for t in T:
        for i,d in enumerate(D[ind:]):
            if d == t:
#                print(ind,D[ind:])
                ind += i + 1
                break
        else:
            print('No')
            exit()
    print('Yes')


Fixed, accepted submission:
import collections
N = int(input())
D = sorted(list(map(int, input().split())))

M = int(input())
T = sorted(list(map(int, input().split())))

DD = collections.Counter(D)
TT = collections.Counter(T)
ch = 1
for t,num_t in TT.items():
    num_d = DD[t]
    if num_t > num_d:
        ch = 0

if ch == 1:
    print('YES')
else:
    print('NO')
Problem:
Iroha has a sequence of N strings S_1, S_2, ..., S_N. The length of each string is L.  She will concatenate all of the strings in some order, to produce a long string.  Among all strings that she can produce in this way, find the lexicographically smallest one.  Here, a string s=s_1s_2s_3...s_n is _lexicographically smaller_ than another string t=t_1t_2t_3...t_m if and only if one of the following holds:    * There exists an index i(1≦i≦min(n,m)), such that s_j = t_j for all indices j(1≦j<i), and s_i<t_i.   * s_i = t_i for all integers i(1≦i≦min(n,m)), and n<m.

Incorrect submission (verdict: Wrong Answer):
N, L = map(int, input().split())

list_a = [str(input()) for i in range(N)]

list_a.sort()

print(list_a[0])

Fixed, accepted submission:

N, L = map(int, input().split())


list_a = [input() for i in range(N)]

list_a.sort()

list_b = "".join(list_a)

print(list_b)
Problem:
You are given a string S consisting of lowercase English letters. Another string T is initially empty. Determine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:    * Append one of the following at the end of T: `dream`, `dreamer`, `erase` and `eraser`.

Incorrect submission (verdict: Wrong Answer):
l=list(input())
a=[list('dream'),list('erase')]
b=[list('dreamer'),list('eraser')]
n=len(l)
r=0
while n<=4:
    f=0
    if n>=6:
        if l[len(l)-5:] in a:
            l[len(l)-5:]=[]
            n-=5
            f+=1
        if l[len(l)-6:] in b:
            l[len(l)-6:]=[]
            n-=6
            f+=1
    elif n>=5:
        if l[len(l)-5:] in a:
            l[len(l)-5:]=[]
            n-=5
            f+=1
    if f==0:
        r=1
        break
if r==1 or n>0:
    print('NO')
else:
    print('YES')

Fixed, accepted submission:
l=list(input())
a=[list('dream'),list('erase')]
b=[list('eraser')]
c=[list('dreamer')]
n=len(l)
r=0
while n>=5:
    f=0
    if n>=7:
        if l[len(l)-5:] in a:
            l[len(l)-5:]=[]
            n-=5
            f+=1
        if l[len(l)-6:] in b:
            l[len(l)-6:]=[]
            n-=6
            f+=1
        if l[len(l)-7:] in c:
            l[len(l)-7:]=[]
            n-=7
            f+=1
    elif n>=6:
        if l[len(l)-5:] in a:
            l[len(l)-5:]=[]
            n-=5
            f+=1
        if l[len(l)-6:] in b:
            l[len(l)-6:]=[]
            n-=6
            f+=1
    elif n>=5:
        if l[len(l)-5:] in a:
            l[len(l)-5:]=[]
            n-=5
            f+=1
    if f==0:
        r=1
        break
if r==1 or n>0:
    print('NO')
else:
    print('YES')
Problem:
There are N dishes of cuisine placed in front of Takahashi and Aoki. For convenience, we call these dishes Dish 1, Dish 2, ..., Dish N.  When Takahashi eats Dish i, he earns A_i points of _happiness_ ; when Aoki eats Dish i, she earns B_i points of happiness.  Starting from Takahashi, they alternately choose one dish and eat it, until there is no more dish to eat. Here, both of them choose dishes so that the following value is maximized: "the sum of the happiness he/she will earn in the end" minus "the sum of the happiness the other person will earn in the end".  Find the value: "the sum of the happiness Takahashi earns in the end" minus "the sum of the happiness Aoki earns in the end".

Incorrect submission (verdict: Wrong Answer):
n = int(input())

a = [0  for i in range(n)]
b = [0  for i in range(n)]
x = [0  for i in range(n)]

for i in range(n):
    a[i],b[i]=map(int,input().split())
    x[i]=a[i]-b[i]
    
s=sorted(x,reverse=True)
nu=n//2
mod=n%2

count=0
for i in range(nu+mod):
    count+=s[i*2]

    

print(count)

Fixed, accepted submission:
n = int(input())

a = [0  for i in range(n)]
b = [0  for i in range(n)]
x = [[0,0,0]  for i in range(n)]

for i in range(n):
    a[i],b[i]=map(int,input().split())
    x[i][0]=abs(a[i]+b[i])
    x[i][1]=a[i]
    x[i][2]=b[i]

s=sorted(x,reverse=True)
#print(s)

nu=n//2
mod=n%2

count=0
for i in range(nu):
    count+=s[i*2][1]
  #  print(count)
    count-=s[i*2+1][2]
 #   print(count)

if mod==1:
    count+=s[2*nu][1]

    

    

print(count)
Problem:
You are given a string S consisting of lowercase English letters. Determine whether all the characters in S are different.

Incorrect submission (verdict: Wrong Answer):
S = input()
d = set()

for s in S:
    d.add(s)

if len(S) == d:
    print('yes')
else:
    print('no')

Fixed, accepted submission:
S = input()
d = set()

for s in S:
    d.add(s)

if len(S) == len(d):
    print('yes')
else:
    print('no')
Problem:
It is only six months until Christmas, and AtCoDeer the reindeer is now planning his travel to deliver gifts.   There are N houses along _TopCoDeer street_. The i-th house is located at coordinate a_i. He has decided to deliver gifts to all these houses.   Find the minimum distance to be traveled when AtCoDeer can start and end his travel at any positions.

Incorrect submission (verdict: Wrong Answer):
n = int(input())
a = list(set(map(int, input().split())))
res = 0
for i in range(len(a) - 1):
    res += a[i+1] - a[i]

print(res)


Fixed, accepted submission:
n = int(input())
a = list(map(int, input().split()))
a.sort()
res = 0
for i in range(n - 1):
    res += a[i+1] - a[i]
print(res)
Problem:
AtCoDeer the deer found two positive integers, a and b. Determine whether the product of a and b is even or odd.

Incorrect submission (verdict: Wrong Answer):
a, b = map(int, input().split())
c = a*b
if c%2 == 0 :
  print("even")
else :
  print("odd")

Fixed, accepted submission:
a, b = map(int, input().split())
c = a*b
if c%2 == 0 :
    print("Even")
else :
    print("Odd")
Problem:
An _X -layered kagami mochi_ (X ≥ 1) is a pile of X round mochi (rice cake) stacked vertically where each mochi (except the bottom one) has a smaller diameter than that of the mochi directly below it. For example, if you stack three mochi with diameters of 10, 8 and 6 centimeters from bottom to top in this order, you have a 3-layered kagami mochi; if you put just one mochi, you have a 1-layered kagami mochi.  Lunlun the dachshund has N round mochi, and the diameter of the i-th mochi is d_i centimeters. When we make a kagami mochi using some or all of them, at most how many layers can our kagami mochi have?

Incorrect submission (verdict: Wrong Answer):
mochi_list = []
N = int(input())

for i in range(N):
    mochi_list.append(int(input()))

last_mochi = 0
count = 0

for mochi in sorted(mochi_list):
    if last_mochi == mochi:
        break
    last_mochi = mochi
    count += 1

print(count)


Fixed, accepted submission:
# -*- coding: utf-8 -*-

mochi_list = []
N = int(input())

for i in range(N):
    d = int(input())
    mochi_list.append(d)

last_mochi = 101
count = 0

for mochi in sorted(mochi_list, reverse=True):
    if mochi < last_mochi:
        count += 1
    last_mochi = mochi

print(count)
Problem:
Two students of AtCoder Kindergarten are fighting over candy packs.  There are three candy packs, each of which contains a, b, and c candies, respectively.  Teacher Evi is trying to distribute the packs between the two students so that each student gets the same number of candies. Determine whether it is possible.  Note that Evi cannot take candies out of the packs, and the whole contents of each pack must be given to one of the students.

Incorrect submission (verdict: Wrong Answer):
l = input ().split ()
list.sort (l, reverse=True)
a = l[0]
b = l[1]
c = l[2]
if a+b == c:
  print ('Yes')
else:
  print ('No')


Fixed, accepted submission:
l = [int(x) for x in input().split()]
if l[2]==l[0]+l[1] or l[0]==l[1]+l[2] or l[1]==l[0]+l[2]:
  print ('Yes')
else:
  print ('No')
Problem:
There are N boxes arranged in a row. Initially, the i-th box from the left contains a_i candies.  Snuke can perform the following operation any number of times:    * Choose a box containing at least one candy, and eat one of the candies in the chosen box.  His objective is as follows:    * Any two neighboring boxes contain at most x candies in total.  Find the minimum number of operations required to achieve the objective.

Incorrect submission (verdict: Wrong Answer):
N,M=map(int,input().split())
s=list(map(int,input().split()))
w=0
if s[0]+s[1]>M and s[1]<M:
    s[1]=0
    w+=s[0]-M
for i in range(0,N-1):
    if s[i]+s[i+1]>M:
        w+=s[i]+s[i+1]-M
        s[i+1]=M-s[i]
print(w)        

Fixed, accepted submission:
N,M=map(int,input().split())
s=list(map(int,input().split()))
w=0
if s[0]+s[1]>M and s[0]>M:
    w+=s[1]+s[0]-M
    s[1]=0
    s[0]=M
for i in range(0,N-1):
    if s[i]+s[i+1]>M:
        w+=s[i]+s[i+1]-M
        s[i+1]=M-s[i]
print(w)
Problem:
You are given three words s_1, s_2 and s_3, each composed of lowercase English letters, with spaces in between. Print the acronym formed from the uppercased initial letters of the words.

Incorrect submission (verdict: Wrong Answer):
a,b,c=input().split()
print((a[0]+a[0]+a[0]).upper())

Fixed, accepted submission:
a,b,c=input().split()
print((a[0]+b[0]+c[0]).upper())
Problem:
You are given three words s_1, s_2 and s_3, each composed of lowercase English letters, with spaces in between. Print the acronym formed from the uppercased initial letters of the words.

Incorrect submission (verdict: Wrong Answer):
S = input().split()
print(S[0][0] + S[1][0] + S[2][0])

Fixed, accepted submission:
a, b, c = input().split()
print(chr(ord(a[0]) - 32) + chr(ord(b[0]) - 32) + chr(ord(c[0]) - 32))
Problem:
Takahashi has a strong stomach. He never gets a stomachache from eating something whose "best-by" date is at most X days earlier. He gets a stomachache if the "best-by" date of the food is X+1 or more days earlier, though.  Other than that, he finds the food delicious if he eats it not later than the "best-by" date. Otherwise, he does not find it delicious.  Takahashi bought some food A days before the "best-by" date, and ate it B days after he bought it.  Write a program that outputs `delicious` if he found it delicious, `safe` if he did not found it delicious but did not get a stomachache either, and `dangerous` if he got a stomachache.

Incorrect submission (verdict: Wrong Answer):
x,a,b = map(int,input().split())
if a<=b:
    print('delicious')
elif b>(a+x):
    print('dangerous')
else:
    print('safe')

Fixed, accepted submission:
x,a,b = map(int,input().split())
if a>=b:
    print('delicious')
elif b>(a+x):
    print('dangerous')
else:
    print('safe')
Problem:
Write a program of the Selection Sort algorithm which sorts a sequence A in ascending order. The algorithm should be based on the following pseudocode:                 SelectionSort(A) 1 for i = 0 to A.length-1 2     mini = i 3     for j = i to A.length-1 4         if A[j] < A[mini] 5             mini = j 6     swap A[i] and A[mini]   Note that, indices for array elements are based on 0-origin.  Your program should also print the number of swap operations defined in line 6 of the pseudocode in the case where i ≠ mini.

Incorrect submission (verdict: Wrong Answer):
def selectionSort(A, N): 
    A = A.split(" ")
    change_count = 0
    
    for i in range(N):
        minj = i
        
        for j in range(i,N):
            if A[j] < A[minj]:
                minj = j
        
        if i != minj:
            tmp = A[i]
            A[i] = A[minj]
            A[minj] = tmp
            change_count+=1
    
    return A, change_count


N = int(input("数列の長さを表す整数を入力して下さい  "))  
A = input("N 個の整数が空白区切りで入力して下さい  ")   
sorted_list, change_count = selectionSort(A,N)


print(" ".join(map(str,sorted_list)))
print(change_count)


Fixed, accepted submission:
def selectionSort(A, N): 
    A = list(map(int, A.split(" ")))
    change_count = 0
    for i in range(N):
        minj = i
        for j in range(i,N):
            if A[j] < A[minj]:
                minj = j
        if i != minj:
            
            tmp = A[i]
            A[i] = A[minj]
            A[minj] = tmp
            change_count+=1
    
    
    print(" ".join(map(str,A)))
    print(change_count)
    #return True


N = int(input())  
A = input("")   
selectionSort(A,N)
Problem:
You are given a grid with 2 rows and 3 columns of squares. The color of the square at the i-th row and j-th column is represented by the character C_{ij}.  Write a program that prints `YES` if this grid remains the same when rotated 180 degrees, and prints `NO` otherwise.

Incorrect submission (verdict: Wrong Answer):
c1 = list(input())
c2 = list(input())

if c1.reverse() == c2:
  print("YES")


Fixed, accepted submission:
c1 = list(input())
c2 = list(input())

r1 = c1[::-1]
r2 = c2[::-1]

if c1 == r2 and c2 == r1:
  print("YES")
else:
  print("NO")
Problem:
Your task is to implement a double linked list.  Write a program which performs the following operations:    * insert x: insert an element with key x into the front of the list.   * delete x: delete the first element which has the key of x from the list. If there is not such element, you need not do anything.   * deleteFirst: delete the first element from the list.    * deleteLast: delete the last element from the list.

Incorrect submission (verdict: Wrong Answer):
n = int(input())
dList = []

for _ in range(n):
  op = list(map(str,input().split()))
  if(op[0] == "insert"):
    dList.append(op[1])
  elif(op[0] == "delete"):
    for j,k in enumerate(dList):
      if(op[1] == k):
        dList.pop(j)
  elif(op[0] == "deleteFirst"):
    dList.pop(0)
  elif(op[0] == "deleteLast") :
    dList.pop(len(dList)-1)

print(*dList)


Fixed, accepted submission:

import collections,sys
def s():
  d = collections.deque()
  input()
  for e in sys.stdin:
    if "i"==e[0]: d.appendleft(e[7:-1])
    else:
      if " "==e[6]:
        m = e[7:0-1]
        if m in d: d.remove(m)
      elif "i"==e[7]: d.popleft()
      else: d.pop()
  print(*d)

s()
Problem:
A string is called a KEYENCE string when it can be changed to `keyence` by removing its contiguous substring (possibly empty) only once.  Given a string S consisting of lowercase English letters, determine if S is a KEYENCE string.

Incorrect submission (verdict: Wrong Answer):
S = input()

bl = False
for L in range(8):
  T = S[:L] + S[len(S)-L:]
  if T == 'keyence':
    bl = True
    break

answer = 'YES' if bl else 'NO'
print(answer)

Fixed, accepted submission:
S = input()

bl = False
for L in range(8):
  T = S[:L] + S[len(S)-(7-L):]
  if T == 'keyence':
    bl = True
    break

answer = 'YES' if bl else 'NO'
print(answer)
Problem:
Taro is going to play a card game. However, now he has only n cards, even though there should be 52 cards (he has no Jokers).  The 52 cards include 13 ranks of each of the four suits: spade, heart, club and diamond.

Incorrect submission (verdict: Wrong Answer):
n=int(input())
card_have=[input().split() for i in range(n)]

nums={1,2,3,4,5,6,7,8,9,10,11,12,13}

s_have={int(s[1]) for s in card_have if s[0]=="S"}
h_have={int(h[1]) for h in card_have if h[0]=="H"}
c_have={int(c[1]) for c in card_have if c[0]=="C"}
d_have={int(d[1]) for d in card_have if d[0]=="S"}

s_lost=list(nums^s_have)
h_lost=list(nums^h_have)
c_lost=list(nums^c_have)
d_lost=list(nums^d_have)

s_lost.sort()
h_lost.sort()
c_lost.sort()
d_lost.sort()

for s in s_lost:
    print("S",s)
for h in h_lost:
    print("H",h)
for c in c_lost:
    print("C",c)
for d in d_lost:
    print("D",d)

Fixed, accepted submission:
n=int(input())
card_have=[input().split() for i in range(n)]

nums={1,2,3,4,5,6,7,8,9,10,11,12,13}

s_have={int(s[1]) for s in card_have if s[0]=="S"}
h_have={int(h[1]) for h in card_have if h[0]=="H"}
c_have={int(c[1]) for c in card_have if c[0]=="C"}
d_have={int(d[1]) for d in card_have if d[0]=="D"}

s_lost=list(nums^s_have)
h_lost=list(nums^h_have)
c_lost=list(nums^c_have)
d_lost=list(nums^d_have)

s_lost.sort()
h_lost.sort()
c_lost.sort()
d_lost.sort()

for s in s_lost:
    print("S",s)
for h in h_lost:
    print("H",h)
for c in c_lost:
    print("C",c)
for d in d_lost:
    print("D",d)
Problem:
E869120 has A 1-yen coins and infinitely many 500-yen coins.   Determine if he can pay exactly N yen using only these coins.

Incorrect submission (verdict: Wrong Answer):
print('No')if int(input())%500>int(input())else print('No')

Fixed, accepted submission:
print('No')if int(input())%500>int(input())else print('Yes')
Problem:
A group of people played a game. All players had distinct scores, which are positive integers.  Takahashi knows N facts on the players' scores. The i-th fact is as follows: the A_i-th highest score among the players is B_i.  Find the maximum possible number of players in the game.

Incorrect submission (verdict: Wrong Answer):
N = int(input())
x = 0
ans = 0
for _ in range(N):
    A, B = map(int, input().split())
    if A > x:
        x = A
        ans = B
    print(x+ans)

Fixed, accepted submission:
N = int(input())
x = 0
ans = 0
for _ in range(N):
    A, B = map(int, input().split())
    if A > x:
        x = A
        ans = B
print(x+ans)
Problem:
Write a program which reads two integers a and b, and calculates the following values:    * a ÷ b: d (in integer)   * remainder of a ÷ b: r (in integer)   * a ÷ b: f (in real number)

Incorrect submission (verdict: Wrong Answer):
a,b = map(int,input().split())
print(a//b,a%b,a/b)

Fixed, accepted submission:
a,b = map(int,input().split())
print("%d %d %.5f"%(a//b,a%b,a/b))
Problem:
You are given three strings A, B and C. Each of these is a string of length N consisting of lowercase English letters.  Our objective is to make all these three strings equal. For that, you can repeatedly perform the following operation:    * Operation: Choose one of the strings A, B and C, and specify an integer i between 1 and N (inclusive). Change the i-th character from the beginning of the chosen string to some other lowercase English letter.  What is the minimum number of operations required to achieve the objective?

Incorrect submission (verdict: Wrong Answer):
N=int(input())
A=list(input())
B=list(input())
C=list(input())
litter=[]
c=0
for s in range(N):
    if A[s] and B[s]:
        litter.append(A[s])
    elif A[s] and C[s]:
        litter.append(A[s])
    else:
        litter.append(B[s])
    if litter[s] != A[s]:
        c+=1
    if litter[s] != B[s]:
        c+=1
    if litter[s] != C[s]:
        c+=1
print(c)

Fixed, accepted submission:
N=int(input())
A=list(input())
B=list(input())
C=list(input())
litter=[]
c=0
for s in range(N):
    c+=[0,0,1,2][len(set([A[s],B[s],C[s]]))]
print(c)
Problem:
You are given a image with a height of H pixels and a width of W pixels. Each pixel is represented by a lowercase English letter. The pixel at the i-th row from the top and j-th column from the left is a_{ij}.  Put a box around this image and output the result. The box should consist of `#` and have a thickness of 1.

Incorrect submission (verdict: Wrong Answer):
h,w = map(int,input().split())
for i in range(h+2):
    if i == 0 or i == h+1:
        print("#"*w)
    else:
        temp = input()
        print("#"+temp+"#")

Fixed, accepted submission:
h,w = map(int,input().split())
temp = []
for i in range(h):
    temp.append("#"+input()+"#")
for i in range(h+2):
    if  i == 0 or i == h+1:
        print("#"*(w+2))
    else:
        print(temp[i-1])