TnT/Multi_CodeNet4Repair huggingface dataset:
Problem: There are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.  For each square, you will perform either of the following operations once:    * Decrease the height of the square by 1.   * Do nothing.  Determine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.

Submission attempts (in order):
N = int(input())
H = list(map(int, input().split()))
ans = 0
for i in range(N-1) :
    for k in range(i+1, N):
        if s[i] - s[k] > 1 :
            print('No')
            ans = 1
            break
if ans == 0:
    print('Yes')


N = int(input())
H = list(map(int, input().split()))
H[0] -= 1
for i in range(N - 1):
    if h[i] < h[i+1] :
        h[i+1] -= 1
    elif h[i] > h[i+1]:
        print('No')
        exit()
print('Yes')


N = int(input())
H = list(map(int, input().split()))
ans = 0
for i in range(N-1) :
    for k in range(i+1, N):
        if s[i] - s[k] > 1 :
            print('No')
            ans = 1
            break
    else:
        continue
    break
if ans == 0:
    print('Yes')


N = int(input())
H = list(map(int, input().split()))
ans = 0
for i in range(N-1) :
    for k in range(i+1, N):
        if s[i] - s[k] > 1 :
            print('No')
            ans = 1
            exit()
if ans == 0:
    print('Yes')


N = int(input())
H = list(map(int, input().split()))
H[0] -= 1
for i in range(N - 1):
    if H[i] < H[i+1] :
        h[i+1] -= 1

    elif H[i] > H[i+1]:
        print('No')
        exit()

print('Yes')


N = int(input())
H = list(map(int, input().split()))
for i in range(N-1) :
    for k in range(i+1, N):
        if s[i] - s[k] > 1 :
            print('No')
            break
        else:
            print('Yes')


N = int(input())
H = list(map(int, input().split()))
H[0] -= 1
for i in range(N - 1):
    if H[i] < H[i+1] :
        H[i+1] -= 1

    elif H[i] > H[i+1]:
        print('No')
        exit()

print('Yes')


Verdicts: Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: There are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.  For each square, you will perform either of the following operations once:    * Decrease the height of the square by 1.   * Do nothing.  Determine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.

Submission attempts (in order):
def main():
    N = int(input())
    A = [int(i) for i in input().split()]
    
    if A == sorted(A):
        print("Yes")
    else:
        for i, a in enumerate(A):
            A[i] = a-1
            if A == sorted(A):
                print("Yes")
                break
        print("No")


if __name__ == "__main__":
    main()

def main():
    n = int(input())
    h = list(map(int, input().split()))
    print(h)
    for i in range(n-1):
        print(h)
        if h[i] < h[i+1]:
            h[i+1] -= 1
        elif h[i] > h[i+1]:
            print('No')
            exit()

    print('Yes')


if __name__ == "__main__":
    main()


def main():
    n = int(input())
    h = list(map(int, input().split()))
    for i in range(n-1):
        if h[i] < h[i+1]:
            h[i+1] -= 1
        elif h[i] > h[i+1]:
            print('No')
            exit()

    print('Yes')


if __name__ == "__main__":
    main()


Verdicts: Wrong Answer

Runtime Error

Accepted
Problem: There are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.  For each square, you will perform either of the following operations once:    * Decrease the height of the square by 1.   * Do nothing.  Determine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.

Submission attempts (in order):
N = int(input())
H = list(map(int, input().split()))
pval = max(H)
f = 1
for h in reversed(H):
  if (pval + 1 < h):
    print("NO")
    f = 0
    break
  if (pval + 1 == h):
    pval = h - 1
  else:
    pval = h
if(f):
  print("YES")

N = int(input())
H = list(map(int, input().split()))
pval = max(H)
f = 1
for h in reversed(H):
  if (pval + 1 < h):
    print("No")
    f = 0
    break
  if (pval + 1 == h):
    pval = h - 1
  else:
    pval = h
if(f):
  print("Yes")

Verdicts: Wrong Answer

Accepted
Problem: There are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.  For each square, you will perform either of the following operations once:    * Decrease the height of the square by 1.   * Do nothing.  Determine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.

Submission attempts (in order):
N = int(input())
H = map(int, input().split())

H_diff = []
for i in range(N-1):
  	H_diff = H[i] - H[i+1]
if max(H_diff) <= 1:
  	print('Yes')
else:
  	print('No')

N = int(input())
H = list(map(int, input().split()))

Hmax = H[0]
flag = 0
for i in range(N):
	if H[i] < Hmax - 1:
		flag = 1
		break
	if H[i] > Hmax:
		Hmax = H[i]

if flag == 1:
  	print('No')
else:
  	print('Yes')

Verdicts: Runtime Error

Accepted
Problem: There are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.  For each square, you will perform either of the following operations once:    * Decrease the height of the square by 1.   * Do nothing.  Determine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.

Submission attempts (in order):
N=int(input())
h=list(map(int,input().split()))
for i in range(len(h)-1):
	if h[i]>=h[i+1]:
		h[i]-=1
if h==sorted(h):
	print('Yes')
else:
	print('No')

N=int(input())
h=list(map(int,input().split()))
Min=h[N-1]
for i in range(len(h)):
	Min=min(Min,h[N-1-i])
	if  Min==h[N-1-i] or Min+1==h[N-1-i]:
		h[N-1-i]=Min
	else:
		print('No')
		break
else:
	print('Yes')

Verdicts: Wrong Answer

Accepted
Problem: There are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.  For each square, you will perform either of the following operations once:    * Decrease the height of the square by 1.   * Do nothing.  Determine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.

Submission attempts (in order):
N=int(input())
H=list(map(int,input()))
p,a=True,0
for h in H:
  if h>a:
    a=h-1
  elif a>h:
    p=False
    break
print("Yes" if p else "No")

N=int(input())
H=list(map(int,input().split()))
p,a=True,0
for h in H:
  if h>a:
    a=h-1
  elif a>h:
    p=False
    break
print("Yes" if p else "No")

Verdicts: Runtime Error

Accepted
Problem: There are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.  For each square, you will perform either of the following operations once:    * Decrease the height of the square by 1.   * Do nothing.  Determine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.

Submission attempts (in order):
n = int(input())
h = list(map(int,input().split()))

a = "Yes"
for i in range(n-1):
	if h[i+1] - h[i] >= 1:
		pass
	else:
		a = "No"
		break
print(a)

n = int(input())
lis = map(int,input().split())

ans = "Yes"
for i in range(1,n):
	if lis[i] - lis[i-1] <= 1:
		pass
	else:
		ans = "No"
		break

print(ans)

n = int(input())
lis = list(map(int,input().split()))

ans = "Yes"
for i in range(1,n):
	if lis[i] - lis[i-1] <= 1:
		pass
	else:
		ans = "No"
		break

print(ans)

n = int(input())
lis = list(map(int,input().split()))

ans = "Yes"
m = 0
for i in range(n):
	if m - lis[i] > 1:
		ans = "No"
		break
	else:
		m = max(m,lis[i])
print(ans)

Verdicts: Wrong Answer

Runtime Error

Wrong Answer

Accepted
Problem: There are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.  For each square, you will perform either of the following operations once:    * Decrease the height of the square by 1.   * Do nothing.  Determine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.

Submission attempts (in order):
n=int(input())
arr=list(map(int,input().split()))
for i in range(n-1,0,-1): 
 if arr[i]>arr[i-1]: 
   arr[i-1]-=1
   if arr[i]>arr[i-1]: 
     print('No')
     break
else:
 print('Yes')

n=int(input())
arr=list(map(int,input().split()))
for i in range(n-1,0,-1): 
 if arr[i]>arr[i-1]: 
   arr[i-1]-=1
   if arr[i]>arr[i-1]: 
     print('No')
     break
 else:
  print('Yes')

n=int(input())
arr=list(map(int,input().split()))
for i in range(n-1,0,-1): 
 if arr[i]>arr[i-1]: 
   arr[i-1]-=1
   if arr[i]>arr[i-1]: 
     print('No')
     break
else:
 print('Yes')

import sys
n = int(input())
h = [int(e) for e in input().split()]
for i in range(n - 2, 0, -1):
  if h[i] > h[i + 1]:
    h[i] -= 1
  if h[i] > h[i + 1]:
    print('No')
    sys.exit()
print('Yes')

Verdicts: Wrong Answer

Wrong Answer

Wrong Answer

Accepted
Problem: There are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.  For each square, you will perform either of the following operations once:    * Decrease the height of the square by 1.   * Do nothing.  Determine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.

Submission attempts (in order):
def hoge(x, y):
    return y if x >= y else y - 1

N = int(input())
H = list(map(int, input().split()))
H = list(reversed(H))

flag = 0
for i in range(N - 1):
    H[i + 1] = hoge(H[i], H[i + 1])
    print(H)
    if H[i] < H[i + 1]:
        print("No")
        flag = 1
        break

if flag == 0:
    print("Yes")


n = int(input())
S = list(map(int, input().split()))[::-1]

flag = True
for i in range(1, n):
  if S[i] > S[i-1]:
    S[i] -= 1
    
  if S[i] > S[i-1]:
    flag = False
    break

print("Yes" if flag else "No")
  

Verdicts: Runtime Error

Accepted
Problem: There are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.  For each square, you will perform either of the following operations once:    * Decrease the height of the square by 1.   * Do nothing.  Determine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.

Submission attempts (in order):
n = int(input())
h = list(map(int, input().split()))[::-1]
if n ==1:
    print('Yes')
else:
    for i in range(1,n):
        if h[i] > (h[i - 1] + 1):
            print('No')
            break
        elif h[i] == (h[i - 1] + 1):
            h[i] = h[i - 1]
        print(h)
    else:
        print('Yes')

n = int(input())
h = list(map(int, input().split()))[::-1]
if n ==1:
    print('Yes')
else:
    for i in range(1,n):
        if h[i] > (h[i - 1] + 1):
            print('No')
            break
        elif h[i] == (h[i - 1] + 1):
            h[i] = h[i - 1]
    else:
        print('Yes')


Verdicts: Runtime Error

Accepted
Problem: There are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.  For each square, you will perform either of the following operations once:    * Decrease the height of the square by 1.   * Do nothing.  Determine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.

Submission attempts (in order):
a= int(input())

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

answe = True


for i in range(len(b)-1):
    print(i)
    if b[i] - b[i+1] >1 :
        answe= False
if b[len(b)-1] < b[len(b)-2]:
    answe= False



if answe == True:
    print("Yes")
else:
    print("No")


a= int(input())
b = list(map(int, input().split()))
answe = True

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

for i in range(a-1):
    if b[i] - b[i+1] >0:
        answe= False

if answe == True:
    print("Yes")
else:
    print("No")


a= int(input())

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

answe = True


for i in range(len(b)-1):
    print(i)
    if b[i] - b[i+1] >1 :
        answe= False
if b[len(b)-1] < b[len(b)-2]:
    answe= False

print(answe) 

a= int(input())
b = list(map(int, input().split()))
answe = True


for i in range(a-1):
    if b[i] - b[i+1] >0:
        b[i] = b[i]-1

for i in range(a-1):
    if b[i] - b[i+1] >0:
        answe= False

if b[len(a-1)] < b[len(a-2]:
    answe= False

if answe == True:
    print("Yes")
else:
    print("No")


a= int(input())
b = list(map(int, input().split()))
answe = True


for i in range(a-1):
    if b[i] - b[i+1] >0:
        b[i] = b[i]-1

for i in range(a-1):
    if b[i] - b[i+1] >0:
        answe= False

if b[len(a-1)] < b[len(a-2)]:
    answe= False

if answe == True:
    print("Yes")
else:
    print("No")


a= int(input())

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

answe = True

for i in range(a-1):

    if b[i] - b[i+1] >0:
        b[i] = b[i]-1

print(b)
    
for i in range(a-1):
    if b[i] - b[i+1] >0:
        answe= False



if answe == True:
    print("Yes")
else:
    print("No")


a= int(input())
b = list(map(int, input().split()))

min = 0
for i in b:
    if min == i:
        continue
    if min > i:
        print("No")
        exit()
    if min < i :
        min = i-1



print("Yes")



Verdicts: Wrong Answer

Wrong Answer

Wrong Answer

Runtime Error

Runtime Error

Wrong Answer

Accepted
Problem: There are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.  For each square, you will perform either of the following operations once:    * Decrease the height of the square by 1.   * Do nothing.  Determine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.

Submission attempts (in order):
N = int(input())
H = list(map(int, input().split()))

flag = True

for i in range(N-2):
    if abs(H[i+1] - H[i]) > 1:
        flag = False
        break
        
for i in range(1, N-1):       
    if H[i-1] <= H[i]:
        continue
    else:
        if H[i]-1 >= H[i-1]: 
            H[i+1] -= 1
        else:
            flag = False
            break
        
if flag:
    print("Yes")
else:
    print("No")

N = int(input())
H = list(map(int, input().split()))

flag = True

for i in range(N-2):
    if abs(H[i+1] - H[i]) > 1:
        flag = False
        break
        
for i in range(1, N-2):       
    if H[i-1] <= H[i]:
        continue
    else:
        if H[i]-1 >= H[i-1]: 
            H[i+1] -= 1
        else:
            flag = False
            break
        
if flag:
    print("Yes")
else:
    print("No")

N = int(input())
H = list(map(int, input().split()))

flag = True

for i in range(N-2):
    if abs(H[i+1] - H[i]) > 1:
        flag = False
        break
        
for i in range(1, N-1):       
    if H[i-1] <= H[i]:
        continue
    else:
        if H[i]-1 >= H[i-1]: 
            H[i] -= 1
        else:
            flag = False
            break
        
if flag:
    print("Yes")
else:
    print("No")

N = int(input())
H = list(map(int, input().split()))

flag = True

for i in range(N-1, 1, -1):
    if H[i] >= H[i-1]:
        pass
    else:
        flag = False
        break
    
for j in range(N-1, 1, -1):
    if H[j]+1 < H[j-1]:
        flag = False
        break
    elif H[j] == H[j-1]:
        pass
    else:
        H[j-1] -= 1
        
if flag:
    print("Yes")
else:
    print("No")   

N = int(input())
H = list(map(int, input().split()))

flag = True

for i in range(N-1, 0, -1):
    if H[i] >= H[i-1]:
        continue
    elif H[i] == H[i-1] - 1:
        H[i-1] -= 1
    elif H[i] < H[i-1] - 1:
        flag = False
        break
        
if flag:
    print("Yes")
else:
    print("No")

Verdicts: Wrong Answer

Wrong Answer

Wrong Answer

Wrong Answer

Accepted
Problem: There are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.  For each square, you will perform either of the following operations once:    * Decrease the height of the square by 1.   * Do nothing.  Determine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.

Submission attempts (in order):
N = int(input())

stairs = list(map(int, input().split()))
for i in range(N-1):
    if stairs[i + 1] - stairs[i] <= 0:
        stairs[i] -= 1

new_stairs = sorted(stairs)
if new_stairs == stairs:
    print("Yes")
else:
    print("No")


N = int(input())

stairs = list(map(int, input().split()))
for i in range(N-1):
    if stairs[i + 1] - stairs[i] <= 0:
        stairs[i] -= 1

new_stairs = sorted(stairs)
print(stairs)
if new_stairs == stairs:
    print("Yes")
else:
    print("No")


N = int(input())

stairs = list(map(int, input().split())) + [0]
for i in range(N-1):
    if stairs[i + 1] - stairs[i] < 0:
        stairs[i] -= 1
    elif stairs[i + 1] - stairs[i] == 0 and stairs[i] - stairs[i-1] > 0:
        stairs[i] -= 1

del stairs[-1:]
new_stairs = sorted(stairs)
if new_stairs == stairs:
    print("Yes")
else:
    print("No")


Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: There are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.  For each square, you will perform either of the following operations once:    * Decrease the height of the square by 1.   * Do nothing.  Determine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.

Submission attempts (in order):
N = int(input())
H = list(map(int, input().split()))

def f():
    if N == 1:
        return True

    for i in range(N - 1):
        if H[i + 1] - H[i] >= 2:
            return False

    return True

print("Yes" if f() else "No")

N = int(input())
H = list(map(int, input().split()))

def f():
    if N == 1:
        return True

    for i in range(N - 1):
        if abs(H[i + 1] - H[i]) >= 2:
            return False

    return True

print("Yes" if f() else "No")

N = int(input())
H = list(map(int, input().split()))[::-1]

def f():
    if N == 1:
        return True

    for i in range(N - 1):
        if H[i] >= H[i + 1]:
            continue

        d = H[i + 1] - H[i]
        if d == 1:
            H[i + 1] -= 1
            continue

        return False

    return True


print("Yes" if f() else "No")

Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: There are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.  For each square, you will perform either of the following operations once:    * Decrease the height of the square by 1.   * Do nothing.  Determine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.

Submission attempts (in order):
n = int(input())
squeres = list(map(int, input().split()))
flag = True
now_max = squeres[0]
for i in range(n - 1):
    if not squeres[i] <= squeres[i + 1] or squeres[i] < now_max:
        flag = False
    
    elif squeres[i] > squeres[i + 1] and squeres[i] - 1 <= squeres[i + 1]:
        now_max = squeres[i] - 1
    
    else:
        now_max = squeres[i]
if flag:
    print("Yes")
else:
    print("No")


n = int(input())
squeres = list(map(int, input().split()))
flag = True
before_down = 0
for i in range(n - 1):
    if squeres[i] > squeres[i + 1] and squeres[i] - 1 <= squeres[i + 1] and before_down == 0:
        before_down = 1

    elif not squeres[i] <= squeres[i + 1]:
        flag = False
    
    else:
        if squeres[i] < squeres[i + 1]:
            before_down = 0
if flag:
    print("Yes")
else:
    print("No")


Verdicts: Wrong Answer

Accepted
Problem: There are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.  For each square, you will perform either of the following operations once:    * Decrease the height of the square by 1.   * Do nothing.  Determine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.

Submission attempts (in order):
N=int(input())

H=list(map(int,input().split(" ")))
l=[0]*N
a=0
b=0
s=0

for i in range(N-1):
  if H[i]>H[i+1]:
    l[i]+=1
    if l[i]==2 or H[i]==H[i-1]:
      print("No")
      s=l[i]
      a=H[i]
      b=H[i-1]
      break
    H[i]-=1
    i-=1

if s!=2 and a!=b:
  print("Yes")    

N=int(input())

l=list(map(int,input().split()))
l[0]-=1

for i in range(N-1):

    if l[i+1]==l[i]:
        pass
    elif l[i+1]>l[i]:
        l[i+1]-=1
    else:
        print("No")
        break
    if i==N-2:
        print("Yes")
    else:
        print("No")



N=int(input())

l=list(map(int,input().split()))
l[0]-=1
Switch=True

for i in range(N-1):

    if l[i+1]==l[i]:
        pass
    elif l[i+1]>l[i]:
        l[i+1]-=1
    else:
        print("No")
        Switch=False
        break
    if i==N-2:
        print("Yes")
        Switch=False
    
if Switch:
    print("Yes")



Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: There are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.  For each square, you will perform either of the following operations once:    * Decrease the height of the square by 1.   * Do nothing.  Determine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.

Submission attempts (in order):
n = int(input())
a = list(map(int, input().split()))
ans = 'YES'
for i in range(n-1, 1, -1):
    if a[i] < a[i-1]:
        a[i-1] -= 1
        if a[i] < a[i-1]:
            ans = 'NO'
            break
print(ans)



n = int(input())
a = list(map(int, input().split()))
ans = 'Yes'
for i in range(n-1, 1, -1):
    if a[i] < a[i-1]:
        a[i-1] -= 1
        if a[i] < a[i-1]:
            ans = 'No'
            break
print(ans)



Verdicts: Wrong Answer

Accepted
Problem: There are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.  For each square, you will perform either of the following operations once:    * Decrease the height of the square by 1.   * Do nothing.  Determine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.

Submission attempts (in order):
N = int(input())
nums = list(map(int, input().split()))


def check():
    for i in range(1, N):
        if nums[i] == nums[i - 1]:
            continue
        elif nums[i] - 1 >= nums[i - 1]:
            nums[i] -= 1
        else:
            return "No"
    return "Yes"


print(check()

N = int(input())
nums = list(map(int, input().split()))


def check():
    for i in range(1, N):
        if nums[i] == nums[i - 1]:
            continue
        elif nums[i] - 1 >= nums[i - 1]:
            nums[i] -= 1
            continue
        else:
            return "No"
    return "Yes"


print(check())

Verdicts: Runtime Error

Accepted
Problem: There are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.  For each square, you will perform either of the following operations once:    * Decrease the height of the square by 1.   * Do nothing.  Determine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.

Submission attempts (in order):
n = int(input())
h = list(map(int, input().split()))

ans = 'Yes'
for i in range(n-1):
  if h[i+1] - h[i] >= 1:
    h[i+1] -= 1
  elif h[i+1] - h[i] == 0:
    continue
  else:
    ans = 'No'
    break

n = int(input())
h = list(map(int, input().split()))

ans = 'Yes'
for i in range(n-1):
  if h[i+1] - h[i] >= 1:
    h[i+1] -= 1
  elif h[i+1] - h[i] == 0:
    continue
  else:
    ans = 'No'
    break
print(ans)

Verdicts: Wrong Answer

Accepted
Problem: There are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.  For each square, you will perform either of the following operations once:    * Decrease the height of the square by 1.   * Do nothing.  Determine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.

Submission attempts (in order):
N = int(input())
H = list(map(int, input().split()))
res = "Yes"
lenH = len(H)
for i in range(lenH-2, 0, -1):
  if H[i] == H[i+1]:
    continue
  if H[i] == H[i+1]+1:
    H[i] -= 1
  elif H[i] < H[i+1]+1 or H[i] > H[i+1]:
    res = "No"
    break
print(res)

N = int(input())
H = list(map(int, input().split()))
res = "Yes"
lenH = len(H)
val = 0
for i in range(lenH):
  if val <= H[i]-1:
    val = H[i]-1
  elif val == H[i]:
    val = H[i]
  else:
    res = "No"
    break
print(res)

Verdicts: Wrong Answer

Accepted
Problem: There are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.  For each square, you will perform either of the following operations once:    * Decrease the height of the square by 1.   * Do nothing.  Determine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.

Submission attempts (in order):
n = int(input())
h = list(map(int, input().split()))

can = True

for i in range(n):
    if i == 0:
        h[i] -= 1
        continue

    if h[i] > h[i - 1]:
        h[i] -= 1
    elif h[i] < h[i - 1]:
        can = False
        break

print("YES" if can else "NO")


n = int(input())
h = list(map(int, input().split()))

can = True

for i in range(1, n):
    if h[i] - h[i - 1] > 1:
        can = False

print("Yes" if can else "No")


n = int(input())
h = list(map(int, input().split()))

can = True

for i in range(1, n):
    if h[i] - h[i - 1] >= 1:
        h[i] -= 1
    elif h[i] == h[i - 1]:
        pass
    else:
        can &= False

print("Yes" if can else "No")


Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: There are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.  For each square, you will perform either of the following operations once:    * Decrease the height of the square by 1.   * Do nothing.  Determine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.

Submission attempts (in order):
N = int(input())
H = list(map( int, input().split()))
def solve():
  for i in range(N-1, 0, -1):
    if H[i-1]-H[i]>1>
    return False
  return True

print('Yes' if solve() else 'No')

N = int(input())
H = list(map( int, input().split()))
def solve():
  for i in range(N-1, 0, -1):
    if H[i-1]-H[i]>1:
      return False
    if H[i-1]-H[i]==1:
      H[i-1]-=1
  return True

print('Yes' if solve() else 'No')

Verdicts: Runtime Error

Accepted
Problem: There are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.  For each square, you will perform either of the following operations once:    * Decrease the height of the square by 1.   * Do nothing.  Determine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.

Submission attempts (in order):
n_len = int(input())
n_list = [int(x) for x in input().split()]
n_border = 0
    

for ind in range(n_len - 1):
    n1 = n_list[ind]
    n2 = n_list[ind+1]
    print(n1,n2,n_border)
    if n1 - 1 > n_border:
        n_border = n1 - 1
    if (n1 - 1 <= n2) & (n_border <= n2):
        pass
    else:
        print('No')
        break
print('Yes')

n_len = int(input())
n_list = [int(x) for x in input().split()]
n_border = 0
flag = 0

for ind in range(n_len - 1):
    n1 = n_list[ind]
    n2 = n_list[ind+1]
    print(n1,n2,n_border)
    if n1 - 1 > n_border:
        n_border = n1 - 1
    if (n1 - 1 <= n2) & (n_border <= n2):
        pass
    else:
        flag = 1
        break
        
if flag:
    print('No')
else:
    print('Yes')


n_len = int(input())
n_list = [int(x) for x in input().split()]
n_border = 0
    

for ind in range(n_len - 1):
    n1 = n_list[ind]
    n2 = n_list[ind+1]
    print(n1,n2,n_border)
    if n1 - 1 > n_border:
        n_border = n1 - 1
    if (n1 - 1 <= n2) & (n_border <= n2):
        pass
    else:
        flag = 1
        break
        
if flag:
    print('No')
else:
    print('Yes')

n_len = int(input())
n_list = [int(x) for x in input().split()]
flag = 0

n_border = 0

for ind in range(n_len - 1):
    n1 = n_list[ind]
    n2 = n_list[ind+1]
    print(n1,n2,n_border)
    if n1 - 1 > n_border:
        n_border = n1 - 1
    if (n1 <= n2) | (n1 - 1 <= n2) & (n_border <= n2):
        pass
    else:
        flag = 1
        break
        
if flag:
    print('No')
else:
    print('Yes')

n_len = int(input())
n_list = [int(x) for x in input().split()]
flag = 0

n_border = 0

for ind in range(n_len - 1):
    n1 = n_list[ind]
    n2 = n_list[ind+1]
    if n1 - 1 > n_border:
        n_border = n1 - 1
    #print(n1,n2,n_border)
    if (n1 <= n2) | (n1 - 1 <= n2) & (n_border <= n2):
        pass
    else:
        flag = 1
        break
        
if flag:
    print('No')
else:
    print('Yes')

Verdicts: Wrong Answer

Wrong Answer

Runtime Error

Wrong Answer

Accepted
Problem: There are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.  For each square, you will perform either of the following operations once:    * Decrease the height of the square by 1.   * Do nothing.  Determine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.

Submission attempts (in order):
cell_num = int(input())
height = list(map(int, input().split()))
flag = True

for i in range(cell_num):
    if height[i+1] - height[i] == 1: height[i+1] -= 1
    elif height[i+1] - height[i] > 1:
        flag = False
        break

if flag: print("Yes")
else: print("No")

cell_num = int(input())
height = list(map(int, input().split()))
flag = True

if cell_num != 1:
    for i in range(cell_num):
        if height[i+1] - height[i] == 1: height[i+1] -= 1
        elif height[i+1] - height[i] > 1:
            flag = False
            break

if flag: print("Yes")
else: print("No")

cell_num = int(input())
height = list(map(int, input().split()))
flag = True

if cell_num != 1:
    if height[0] - height[1] == 1:
        height[0] -= 1
    elif height[0] - height[1] > 1:
        flag = False
    
    for i in range(1,cell_num-1):
        if height[i] - height[i+1] > 1:
            flag = False
            break
        elif height[i] -  height[i+1] == 1 and height[i-1] < height[i]:
            height[i] -= 1
        else:
            flag = False
            break
            
if flag: print("Yes")
else: print("No")

cell_num = int(input())
height = list(map(int, input().split()))
flag = True

if cell_num != 1:
    if height[0] - height[1] <= 1:
        height[0] -= 1
    elif height[0] - height[1] > 1:
        flag = False
    
    for i in range(1,cell_num-1):
        if height[i] - height[i+1] > 1:
            flag = False
            break
        elif height[i] -  height[i+1] <= 1 and height[i-1] < height[i]:
            height[i] -= 1
        elif height[i] -  height[i+1] == 1 and height[i-1] == height[i]:
            flag = False
            break
            
if flag: print("Yes")
else: print("No")

Verdicts: Runtime Error

Runtime Error

Wrong Answer

Accepted
Problem: There are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.  For each square, you will perform either of the following operations once:    * Decrease the height of the square by 1.   * Do nothing.  Determine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.

Submission attempts (in order):
# -*- coding: utf-8 -*-
n = int(input())
h = reversed(list(map(int, input().split())))

cnt = 0
for i in range(n-1):
    if h[i+1] - h[i] > 1:
        print('No')
        exit(0)
    elif h[i+1] - h[i] == 1:
        h[i+1] -= 1

print('Yes')


# -*- coding: utf-8 -*-
n = int(input())
h = list(reversed(list(map(int, input().split()))))

cnt = 0
for i in range(n-1):
    if h[i+1] - h[i] > 1:
        print('No')
        exit(0)
    elif h[i+1] - h[i] == 1:
        h[i+1] -= 1

print('Yes')


Verdicts: Runtime Error

Accepted
Problem: There are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.  For each square, you will perform either of the following operations once:    * Decrease the height of the square by 1.   * Do nothing.  Determine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.

Submission attempts (in order):
N=int(input())
h_list=[int(x) for x in input().split()]

flag=True
for i in range(len(h_list)-1):   
    if sorted(h_list)==h_list:
        flag=True
        break
        
    tmp=h_list[i:]
    print(tmp[0:1],tmp[1:])
    if tmp[0]-min(tmp[1:])>=2:
        flag=False
        break
        
if flag:
    print("Yes")
else:
    print("No")

N=int(input())
h_list=[int(x) for x in input().split()]

flag=True

for j in range(1,len(tmp)):
    for i in range(len(h_list)-j):  
        if h_list[i]-h_list[i+j]>=2:
            flag=False
            break
    
if flag:
    print("Yes")
else:
    print("No")

N=int(input())
h_list=[int(x) for x in input().split()]

flag=True

m=h_list[0]
for j in range(len(h_list)-1):
    if m<h_list[j]:
        m=h_list[j]
    if h_list[j+1]>m:
        flag=False
        break        
    
    
if flag:
    print("Yes")
else:
    print("No")

N=int(input())
h_list=[int(x) for x in input().split()]

flag=True
for i in range(len(h_list)-1):   
    if h_list[i+1]-h_list[i]>=2:
        flag=False
        break
    
if flag:
    print("Yes")
else:
    print("No")

N=int(input())
h_list=[int(x) for x in input().split()]

flag=True

m=h_list[0]
for j in range(len(h_list)-1):
    if m<h_list[j]:
        m=h_list[j]
    if m-h_list[j+1]>=2:
        flag=False
        break        
    
if flag:
    print("Yes")
else:
    print("No")

Verdicts: Wrong Answer

Runtime Error

Wrong Answer

Wrong Answer

Accepted
Problem: There are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.  For each square, you will perform either of the following operations once:    * Decrease the height of the square by 1.   * Do nothing.  Determine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.

Submission attempts (in order):
n = int(input())
num_list = [int(i) for i in input().split()]

answer = "yes"

for i in range(n-1):
  if num_list[i] - num_list[i+1] >= 2:
    answer = "no"
    break
    
print(answer)

n = int(input())
num_list = list(map(int, input().split()))

ans = 'Yes'

for i in range(n - 1):
  
  if i == 0:
    if num_list[i] > num_list[i + 1]:
    num_list[i] -= 1
  
  if num_list[i] > num_list[i + 1]:
    ans = 'No'
    break
  
  if num_list[i] < num_list[i + 1]:
    num_list[i + 1] -= 1
    
print(ans)

n = int(input())
num_list = list(map(int, input().split()))
 
ans = 'Yes'
 
for i in range(n - 1):
  if i == 0:
    if num_list[i] > num_list[i + 1]:
      num_list[i] -= 1
  
  if num_list[i] > num_list[i + 1]:
    ans = 'No'
    break
  
  if num_list[i] < num_list[i + 1]:
    num_list[i + 1] -= 1
    
print(ans)

Verdicts: Wrong Answer

Runtime Error

Accepted
Problem: There are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.  For each square, you will perform either of the following operations once:    * Decrease the height of the square by 1.   * Do nothing.  Determine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.

Submission attempts (in order):


import sys


N = int(input())
array = list(map(int,input().split()))

level = 0
for i in range(len(array)-1):
    
    
    if array[i] + 1 <= array[i+1]:
        level = array[i]
        continue
    elif array[i] == array[i+1]:
        if level <= array[i] - 1:
            array[i] -= 1
            level = array[i]
        else:
            continue
    elif array[i] - 1 == array[i+1]:
        if level <= array[i] - 1:
            array[i] -= 1
            level = array[i]
        else:
            print("No")
            exit()
    else:
        print("No")
        exit()
print("YES")




import sys


N = int(input())
array = list(map(int,input().split()))


for i in range(len(array)-2):
    if array[i] == array[i+1] or array[i] - 1 == array[i+1]:
        array[i] -= 1
    elif array[i] + 1 == array[i+1]:
        pass
    else:
        #print("Impossible", array[i], array[i+1])
        print("No")
        exit()
print("YES")




import sys


N = int(input())
array = list(map(int,input().split()))

level = 0
for i in range(len(array)-1):
    level = max(array[i], level)
    
    if array[i] + 1 == array[i+1]:
        continue
    elif array[i] == array[i+1]:
        if level <= array[i] - 1:
            array[i] -= 1
            level = array[i]
        else:
            continue
    elif array[i] - 1 == array[i+1]:
        if level <= array[i] - 1:
            array[i] -= 1
            level = array[i]
        else:
            print("No")
            exit()
    else:
        print("No")
        exit()
print("YES")




import sys


N = int(input())
array = list(map(int,input().split()))

level = 0
for i in range(len(array)-1):
    
    
    if array[i] + 1 <= array[i+1]:
        level = array[i]
        continue
    elif array[i] == array[i+1]:
        if level <= array[i] - 1:
            array[i] -= 1
            level = array[i]
        else:
            continue
    elif array[i] - 1 == array[i+1]:
        if level <= array[i] - 1:
            array[i] -= 1
            level = array[i]
        else:
            print("No")
            exit()
    else:
        print("No")
        exit()
print("Yes")


Verdicts: Wrong Answer

Wrong Answer

Wrong Answer

Accepted
Problem: There are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.  For each square, you will perform either of the following operations once:    * Decrease the height of the square by 1.   * Do nothing.  Determine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.

Submission attempts (in order):

N = int(input())
h = list(map(int, input().split()))

for i in range(N-1):
    if h[i]-1 > h[i+1]:
        print('No')
    else:
        print('yes') 


N = int(input())
h = list(map(int, input().split()))

stop_flg = 0
h[0] = h[0]-1
for i in range(N-1):
    if stop_flg == 0:
        if h[i] <= h[i+1]-1:
            h[i+1] = h[i+1]-1
        elif h[i] == h[i+1]:
            continue
        else:
            stop_flg = 1

if stop_flg == 1:
    print('No')
else:
    print('Yes')

Verdicts: Wrong Answer

Accepted
Problem: There are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.  For each square, you will perform either of the following operations once:    * Decrease the height of the square by 1.   * Do nothing.  Determine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.

Submission attempts (in order):
N=int(input())
H=list(map(int, input().split()))

Hsub=[H[i+1]-H[i] for i in range(N-1)]

output='Yes'
for i in range(N):
  if Hsub>0:
    if H[i]-min(H[i+1])>1:
      output='No'
      
print(output)

N=int(input())
h=list(map(int, input().split()))

index=N-1
output='Yes'
while index>0:
  if h[index-1]-h[index]>1:
    output='No'
    break
  elif h[index-1]-h[index]==1:
    h[index-1]-=1
  else:
    pass
  index-=1
  
print(output)

Verdicts: Runtime Error

Accepted
Problem: There are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.  For each square, you will perform either of the following operations once:    * Decrease the height of the square by 1.   * Do nothing.  Determine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.

Submission attempts (in order):

n = int(input())
h = list(map(int,input().split()))
flg = True

for i in range(1,n):
    if h[i-1] < h[i]:
        h[i] -= 1
        if h[i-1] < h[i]:
            flg = False
            break
print("Yes" if flg else "No")


N = int(input())
H = list(map(int, input().split()))

fl = True
for i in range(1,N):
    if H[i]-H[i-1]>0:
        H[i] -= 1

for i in range(1,N):
    if H[i]-H[i-1]<0:
        fl = False
        break

print('Yes') if fl else print('No')


Verdicts: Wrong Answer

Accepted
Problem: There are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.  For each square, you will perform either of the following operations once:    * Decrease the height of the square by 1.   * Do nothing.  Determine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.

Submission attempts (in order):
N = int(input())
h = list(map(int,input().split()))
flag = 0
if N == 1:
    print("Yes")
else:
    for i in range(N-1):
        if h[i] > h[i+1]:
            h[i] -= 1
    for i in range(N-1):
        if h[i] <= h[i+1]:
            flag = 1:
        else:
            flag = 0:
            break
    if flag == 1:
        print('Yes')
    else:
        print('No')

print('No')

N = int(input())
h = list(map(int,input().split()))
ans = True
for i in range(N-1):
    if h[i] < h[i+1]:
        h[i]-=1
for i in range(N-1):
    if h[i] <= h[i+1]:
        ans = True
    else:
        ans = False
        break
if ans:
    print('Yes')
else:
    print('No')

N = int(input())
h = list(map(int,input().split()))
ans = True
for i in range(N-1,-1,-1):
    if h[i] > h[i+1]:
        h[i]-=1
for i in range(N-1):
    if h[i] <= h[i+1]:
        ans = True
    else:
        ans = False
        break
if ans:
    print('Yes')
else:
    print('No')

print('No')

N = int(input())
h = list(map(int,input().split()))
ans = True
for i in range(N-2,-1,-1):
    if h[i] > h[i+1]:
        h[i]-=1
for i in range(N-1):
    if h[i] <= h[i+1]:
        ans = True
    else:
        ans = False
        break
if ans:
    print('Yes')
else:
    print('No')

Verdicts: Runtime Error

Wrong Answer

Wrong Answer

Runtime Error

Wrong Answer

Accepted
Problem: There are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.  For each square, you will perform either of the following operations once:    * Decrease the height of the square by 1.   * Do nothing.  Determine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.

Submission attempts (in order):
n = int(input())
a = list(map(int, input().split()))
MAX = 0
ans = "YES"
for i in a:
  diff = MAX - i
  if diff < 0:
    MAX = i
  elif diff >= 2:
    ans = "NO"
    break
print(ans)
    
  

n = int(input())
a = list(map(int, input().split()))
MAX = 0
ans = "Yes"
for i in a:
  diff = MAX - i
  if diff < 0:
    MAX = i
  elif diff >= 2:
    ans = "No"
    break
print(ans)
    
  


Verdicts: Wrong Answer

Accepted
Problem: There are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.  For each square, you will perform either of the following operations once:    * Decrease the height of the square by 1.   * Do nothing.  Determine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.

Submission attempts (in order):
N = int(input())
num = [int(i) for i in input().split()]
coment = 'Yes'

for i in range(N):
  if num[i] - num[i+1] < -1:
    coment = 'No'
    break
  elif num[i] - num[i+1] < 0:
    if num[i+1] - num[i+2] < 0:
      coment = 'No'
      break

print(coment)
      

N = int(input())
num = [int(i) for i in input().split()]
coment = 'Yes'

if N = 1:
  coment = 'Yes'
  
elif N = 2:
  if num[0] - num[1] < -1:
    coment = 'No'
    
else:
  for i in range(N-2):
    if num[i] - num[i+1] < -1:
      coment = 'No'
      break
    elif num[i] - num[i+1] < 0:
      if num[i+1] - num[i+2] < 0:
        coment = 'No'
        break

print(coment)
      

N = int(input())
num = [int(i) for i in input().split()]
coment = 'Yes'

if N = 1:
  coment = 'Yes'
  
elif N = 2:
  if num[1] - num[0] < -1:
    coment = 'No'
    
else:
  for i in range(N-2):
    if num[i+1] - num[i] < -1:
      coment = 'No'
      break
    elif num[i+1] - num[i] < 0:
      if num[i+2] - num[i+1] < 0:
        coment = 'No'
        break

print(coment)

N = int(input())
num = [int(i) for i in input().split()]
coment = 'Yes'

if N == 1:
  coment = 'Yes'
  
elif N == 2:
  if num[1] - num[0] < -1:
    coment = 'No'
    
else:
  for i in range(N-2):
    if num[i+1] - num[i] < -1:
      coment = 'No'
      break
    elif num[i+1] - num[i] < 0:
      for j in range(N-2-i):
        if num[i+2+j] - num[i+1] < 0:
          coment = 'No'
          break
		elif num[i+2+j] - num[i+1] > 0:
          break
          
print(coment)

N = int(input())
num = [int(i) for i in input().split()]
coment = 'Yes'

if N == 1:
  coment = 'Yes'
  
elif N == 2:
  if num[1] - num[0] < -1:
    coment = 'No'
    
else:
  for i in range(N-2):
    if num[i+1] - num[i] < -1:
      coment = 'No'
      break
    elif num[i+1] - num[i] < 0:
      for j in range(N-2-i):
        if num[i+2+j] - num[i+1] < 0:
          coment = 'No'
          break
		elif num[i+2+j] - num[i+1] > 0:
          break
          
print(coment)

N = int(input())
num = [int(i) for i in input().split()]
coment = 'Yes'

if N == 1:
  coment = 'Yes'
  
elif N == 2:
  if num[1] - num[0] < -1:
    coment = 'No'
    
else:
  for i in range(N-2):
    if num[i+1] - num[i] < -1:
      coment = 'No'
      break
    elif num[i+1] - num[i] < 0:
      for j in range(N-2-i):
        if num[i+2+j] - num[i+1] < 0:
          coment = 'No'
          break
        elif num[i+2+j] - num[i+1] > 0:
          break
          
print(coment)

Verdicts: Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: There are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.  For each square, you will perform either of the following operations once:    * Decrease the height of the square by 1.   * Do nothing.  Determine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.

Submission attempts (in order):
N = int(input())

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

num = [1]*2

judge = None

for i in W:
  num[1] = i

  if num[0] > num[1]:
    if num[0] > num[1]-1: 
      judge = 'No'
      break
  num[0] = num[1]
if judge != 'No': judge = 'Yes'
print(judge)

N = int(input())

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

num = [1]*2

judge = None

for i in W:
  num[1] = i

  if num[0] < num[1]:
    num[1] -= 1
    if num[0] < num[1]: 
      judge = 'No'
      break
  num[0] = num[1]
if judge != 'No': judge = 'Yes'
print(judge)

import sys
N = int(input())
H = list(map(int, input().split()))
did_it = False
for i in range(N-1):
  a = H[i]
  b = H[i+1]
  if a > b:
    if did_it == False:
      b -= 1
      if a > b:
        print('No')
        sys.exit()
      else:
        did_it = True
    else:
      print('No')
      sys.exit()
print('Yes')

#from:#7967379
N = int(input())
W = list(map(int, input().split()))
judge = True

for i in range(N-1):
  if W[i]<W[i+1]:
    W[i] -= 1
  if W[i] > W[i+1]:
    judge = False
    break
print('Yes' if judge else 'No')

N = int(input())

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

a = 1
b = 1

judge = None

for i in W:
  b = i
  if a > b:
    judge = 'No'
    break
  a = b
if judge != 'No': judge = 'Yes'
print(judge)

N = int(input())

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

num = [1]*2

judge = None


num[0] = W[len(W)-2]
for i in reversed(W):
  num[1] = i
  if num[0] > num[1]:
    num[0] -= 1
    if num[0] > num[1]: 
      judge = 'No'
      break
  num[0] = num[1]
if judge != 'No': judge = 'Yes'
print(judge)

N = int(input())
H = list(map(int, input().split()))

Frg = True #True => 'Yes'

for i in range(N-1, 1,-1):
  if H[i-1] > H[i]:
    H[i-1] -= 1
    if H[i-1] > H[i]:
      Frg = False
      break

print('Yes' if Frg else 'No')

Verdicts: Wrong Answer

Wrong Answer

Wrong Answer

Wrong Answer

Wrong Answer

Wrong Answer

Accepted