Files
Algorithm/백준/1111.py
2026-04-11 11:47:08 +09:00

58 lines
1.2 KiB
Python

import sys
input = sys.stdin.readline
n = int(input())
arr = list(map(int, input().split()))
if(n==1):
print('A')
elif(n==2):
print('A')
elif(arr[1]==arr[0]):
flag = False
for i in range(1, n):
if(arr[i]!=arr[0]):
flag = True
if flag:
print('B')
else:
print(arr[0])
elif(n>2 and arr[2]-arr[1] == arr[1]-arr[0]):
d = arr[1]-arr[0]
flag = False
for i in range(1, n):
if(arr[i]-arr[i-1]!=d):
flag = True
if flag:
print('B')
else:
print(arr[n-1]+d)
elif(n>2 and arr[2]//arr[1] == arr[1]//arr[0]):
d = arr[1]//arr[0]
if(arr[1]/arr[0] < 1 and arr[1]*arr[0]<0):
print('B')
exit()
flag = False
for i in range(1, n):
if(arr[i]//arr[i-1]!=d):
flag = True
if flag:
print('B')
else:
print(arr[n-1]*d)
else:
if (arr[1] - arr[0]) == 0:
print('B')
exit()
a = (arr[2] - arr[1]) // (arr[1] - arr[0])
b = (arr[2] + arr[1] - (arr[1] + arr[0]) * a) // 2
flag = False
for i in range(1, n):
if arr[i] != arr[i - 1] * a + b:
flag = True
if flag:
print('B')
else:
print(arr[n - 1] * a + b)