Harryxun/stf_run huggingface dataset:
n = int(input())
s = input()

a = "ABCDEFGHIJKLMNOPQRSTUVWXYZ" * 2
ans = ""
for i in s:
    ans[i] = a.index(a.index(s[i]) + n)
print(ans)


### FIXED CODE ###

n = int(input())
s = input()

a = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
ans = ""
for i in s:
    ans += a[(int(a.index(i)) + n)%26]
print(ans)
A = list(map(int , input().split()))
B = list(map(int , input().split()))
kitaiti =[(i+1)/2 for i in B]
ans = []
dd = [0]
for i in range(A[0]):
    dd.append(dd[i] + kitaiti[i])
for i in range(A[1] , A[0]):
    ans.append(dd[i] - dd[i - A[1]])
print(max(ans))

### FIXED CODE ###

A = list(map(int , input().split()))
B = list(map(int , input().split()))
kitaiti =[(i+1)/2 for i in B]
ans = []
dd = [0]
for i in range(A[0]):
    dd.append(dd[i] + kitaiti[i])
for i in range(A[1] , A[0]+1):
    ans.append(dd[i] - dd[i - A[1]])
print(max(ans))
a,s,c=int(input());print(["No","Yes"][a*c%2])

### FIXED CODE ###

a,b = map(int,input().split())
if (a*b)%2 == 0:
    print("No")
else:
    print("Yes")
N=int(input())
A=list(map(int,input()))
S=set(A)
print("YES" if len(A)==len(S) else "NO")

### FIXED CODE ###

N=int(input())
A=list(map(int,input().split()))
S=set(A)
print("YES" if len(A)==len(S) else "NO")
N = int(input())
a = [int(i) for i in input().split()]

li_ans = []
ans = 0

for num in (min(a), max(a)):
    for j in range(len(a)):
        ans += abs(a[j] - num) ** 2
    else:
        li_ans.appned(ans)
        ans = 0

if len(li_ans) == 0:
    print(0)
else:
    print(min(li_ans))


### FIXED CODE ###

N = int(input())

a = [int(i) for i in input().split()]

ans = []
sum = 0

for j in range(min(a), max(a)):
    for num in a:
        sum += (num - j) ** 2
    else:
        ans.append(sum)
        sum = 0

if len(ans) == 0:
    print(0)
else:
    print(min(ans))
import sys
n,y = map(int, input().split())

for a in range(n+1):
  for b in range(n+1-a):
    if a * 10000 + b * 5000 + (n-a-b) * 1000 == y:
      print(str(a) + ' ' + str(b) + ' ' + str(c))
#	  sys.exit()

print('-1 -1 -1')
sys.exit()

### FIXED CODE ###

import sys

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

for a in range(n+1):
	for b in range(n+1-a):
		c = n - a - b
		if (a * 10000 + b * 5000 + c * 1000 == y):
				print(str(a) + ' ' + str(b) + ' ' + str(c))
				sys.exit()
	
print('-1 -1 -1')
sys.exit()
N, K = map(int, input().split())
jewels = [0] + list(map(int, input().split())) + [0]
ans = 0
for get in range(min(N, K)+1):
  put = get
  for left in range(get+1):
    right = get - left
    values = jewels[left:] + jewels[:N+1-right]
    sum_v = sum(values)
    minus_values = values.filter(lambda x: x<0)
    minus_values.sort()
    cnt = 0
    for v in minus_values:
      sum_v -= v
    ans = max(ans, sum_v)
print(ans)
    
  

### FIXED CODE ###

N, K = map(int, input().split())
jewels = list(map(int, input().split())) + [0]
ans = 0
for get in range(1, min(N, K)+1):
  put = min(get, K-get)
  for left in range(get+1):
    right = get - left
    values = jewels[:left] + jewels[N-right:]
    sum_v = sum(values)
    minus_values = list(filter(lambda x: x<0, values))
    minus_values.sort()
    cnt = 0
    for v in minus_values:
      if cnt < put:
        sum_v -= v
        cnt += 1
      else:
          break
    ans = max(ans, sum_v)
print(ans)
s = str(input())
a = "abcdefghijklmnopqrstuvwxyz"
count = 0
n = 0
for i in range(len(a)):
    for j in range(len(s)):
        if a[i] == s[j]:
            count += 1
            break
    if count == 0:
        ans = a[i]
        print(ans)
        n = 1
        break
    else:
        count = 0
if n = 1:
    print("None")


### FIXED CODE ###

s = str(input())
a = "abcdefghijklmnopqrstuvwxyz"
count = 0
n = 0
for i in range(len(a)):
    for j in range(len(s)):
        if a[i] == s[j]:
            count += 1
            break
    if count == 0:
        ans = a[i]
        print(ans)
        n = 1
        break
    else:
        count = 0
if n == 0:
    print("None")
import sys
while(True):
    x, y = map(int(sys.stdin.readline()))
    if x == 0 and y == 0:
        break
    if x < y:
        print("%d %d" % (x, y))
    else:
        print("%d %d" % (y, x))

### FIXED CODE ###

import sys
while(True):
    x, y =  map(lambda x: (int, int)[x.isdigit()](x) ,sys.stdin.readline().split(None, 1))
    if x == 0 and y == 0:
        break
    if x < y:
        print("%d %d" % (x, y))
    else:
        print("%d %d" % (y, x))
import io
import sys
from functools import lru_cache

sys.setrecursionlimit(10 ** 7)
HOGE = 10 ** 9 + 7


def IN_S():
  return input()


def IN_I():
  return int(input())


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


def IN_L_S():
  return list(map(str, input().split()))


def STR_SPLIT(s, n):
  for l in range(0, len(s), n):
    yield s[0 + l:n + l]


def T_IN():
  global test_str
  sys.stdin = io.StringIO(test_str[1:-1])


test_str = '''
2000 3
'''


def MAIN():
  # T_IN()
  A()


def A():
  x = IN_L_I()
  n = x[0]
  k = x[1]

  for i in range(1, k + 1):
    blue = f(k, i)

    # red = 0
    # red += f(n - k, i - 1)
    # red += f(n - k, i)
    # red += f(n - k, i)
    # red += f(n - k, i + 1)
    red = f2(n - k - (i - 1), i + 1)

    res = int((blue * red) % HOGE)
    print(res)
  return None


def f(x: int, y: int):
  if x < y:
    return 0
  if x == y == 0:
    return 1
  if y < 1:
    return 0
  return f2(x - y, y)


def f2(x: int, y: int):
  return c(x + y - 1, y - 1)


def c(a: int, b: int):
  return pascal(a, b)


@lru_cache(maxsize=None)
def pascal(x, y):
  if x < 0 or y < 0:
    return 0
  if x < y:
    return 0

  if x == 0 or y == 0 or x == y:
    return 1
  else:
    return (pascal(x - 1, y - 1) + pascal(x - 1, y)) % HOGE


MAIN()


### FIXED CODE ###

import io
import sys


def IN_S():
  return input()


def IN_I():
  return int(input())


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


def IN_L_S():
  return list(map(str, input().split()))


def STR_SPLIT(s, n):
  for l in range(0, len(s), n):
    yield s[0 + l:n + l]


def T_IN():
  global test_str
  sys.stdin = io.StringIO(test_str[1:-1])


test_str = '''
ABBA
'''

def MAIN():
  # T_IN()
  if A():
    print("Yes")
  else:
    print("No")
  quit()

def A():
  s = IN_S()
  l = list(STR_SPLIT(s, 1))
  l.sort()
  if len(l) == 4 and l[0] == l[1] and l[2] == l[3] and l[1] != l[2]:
    return True
  return False


MAIN()
N = int(input())
num = list(map(int, input().split()))
counter = [0] * N
for j in range(N):
  while num[i]%2==0:
    num[i] = num[i]/2
    counter[i] += 1
print(min(counter))

### FIXED CODE ###

N = int(input())
num = list(map(int, input().split()))
counter = [0] * N
for i in range(N):
  while num[i]%2==0:
    num[i] = num[i]/2
    counter[i] += 1
print(min(counter))
n=int(input())
a+=list(map(int,input().split()))
c=0
for i in range(n-1):
  if a[i]!=i+1:
    c+=1
print("YES" if c<3 else "NO")
  


### FIXED CODE ###

n=int(input())
a=list(map(int,input().split()))
c=0
for i in range(n-1):
  if a[i]!=i+1:
    c+=1
print("YES" if c<3 else "NO")
from collections import deque
N, M = map(int, input().split())
if N == 1:
    print(1)
    quit()

A = list(int(input()) for _ in range(M))
A = deque(A)
P = 10**9 + 7

dp = [0] * (N+1)
dp[0] = 1
dp[1] = 1
a = -1
if len(A):
    a = A.popleft()
    if 1 == a:
        dp[1] = 0
        a = A.popleft()

for i in range(2, N+1):
    if i != a:
        dp[i] = (dp[i-1] + dp[i-2]) % P
    else:
        dp[i] = 0
        if len(A):
            a = A.popleft()
print(dp[N])

### FIXED CODE ###

N, M = map(int, input().split())
if N == 1:
    print(1)
    quit()
if M > N//2:
    print(0)
    quit()

A = list(int(input()) for _ in range(M))
idx = 0
P = 10**9 + 7

dp = [0] * (N+1)
dp[0] = 1
dp[1] = 1
a = -1
if len(A):
    if 1 == A[idx]:
        dp[1] = 0
        if idx < M-1:
            idx += 1

if len(A):
    for i in range(2, N+1):
        if i != A[idx]:
            dp[i] = (dp[i-1] + dp[i-2]) % P
        else:
            dp[i] = 0
            if idx < M-1:
                idx += 1
else:
    for i in range(2, N+1):
        dp[i] = (dp[i-1] + dp[i-2]) % P
print(dp[N])
n,m=map(int,input().split())
a=list(map(int,input().split()))
S=sum(a)
p=0
for i in range(n):
       if a[i]>=S/(4*m):
              p+=1
if p>=m:
       print("Yes")
else:
       print("No")


### FIXED CODE ###

X,Y,Z= input().split()
d=X
a=Y
b=d
d=a
a=Z
c=d

print(a, b, c)
N = int(input())
Xs = [list(map(int, input().split(" "))) for _ in range(N)]
"""
input = ["2 3 5","2 1 5","1 2 5","3 2 5"]
input = ["0 0 100", "1 1 98"]
input = ["99 1 191", "100 1 192", "99 0 192"]
Xs = [list(map(int, x.split(" "))) for x in input]
"""
Xs.sort(key=lambda x:x[2], reverse=True)


def solv(Xs):
    for x in range(101):
        for y in range(101):
            h= Xs[0][2]
            Cx = Xs[0][0]
            Cy = Xs[0][1]
            H = h + abs(x - Cx) + abs(y - Cy)
            for i in range(len(Xs)):
                if H - abs(x - Xs[i][0]) - abs(y - Xs[i][1]) != Xs[i][2]:
                    break
                if i == len(Xs)-1:
                    return (x, y, H)


print("%d %d %d" % solv(Xs))


### FIXED CODE ###

N = int(input())
Xs = [list(map(int, input().split(" "))) for _ in range(N)]
"""
input = ["2 3 5","2 1 5","1 2 5","3 2 5"]
input = ["0 0 100", "1 1 98"]
input = ["99 1 191", "100 1 192", "99 0 192"]
Xs = [list(map(int, x.split(" "))) for x in input]
"""

Xs.sort(key=lambda x:x[2], reverse=True)


def solv(Xs):
    for x in range(101):
        for y in range(101):
            h= Xs[0][2]
            Cx = Xs[0][0]
            Cy = Xs[0][1]
            H = h + abs(x - Cx) + abs(y - Cy)
            for i in range(len(Xs)):
                h = max(H - abs(x - Xs[i][0]) - abs(y - Xs[i][1]), 0)
                if h != Xs[i][2]:
                    break
                if i == len(Xs)-1:
                    print("%d %d %d" % (x, y, H))
                    exit(0)


solv(Xs)
def main():
  t = input().split(" ")
  A = int(t[0])
  B = int(t[1])
  
  if B < 0:
    if (B - A) % 2 == 1
    	print("Positive")
    else :
    	print("Negative")
  elif 0 < A:
    print("Positive")
  else:
    print("Zero")
    
main()

### FIXED CODE ###

def main():
  t = input().split(" ")
  A = int(t[0])
  B = int(t[1])
  
  if B < 0:
    if (B - A) % 2 == 1:
    	print("Positive")
    else :
    	print("Negative")
  elif 0 < A:
    print("Positive")
  else:
    print("Zero")
    
main()
#101 b
n = str(input())
N = int(N)
S = 0
for i in n:
    S += i
if N%S == 0:
    print('Yes')
else:
    print('No')

### FIXED CODE ###

n = str(input())
N = int(n)
S = 0
for i in n:
    S += int(i)
if N%S == 0:
    print('Yes')
else:
    print('No')
import sys

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

array = [0 for i in range(2 * (10 ** 5)+1)]
for v in a:
  array[v] += 1
  
if array[1] != 0:
  print(0)
  sys.exit()
  
for i in range(1, len(array)):
  if array[i] == 0:
    continue
    
  for j in range(i*2, len(array), i):
    array[j] = 0
    
count = 0
for v in array:
  if v == 1:
    count += 1
    
print(count)

### FIXED CODE ###

import sys

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

array = [0 for i in range((10 ** 6)+1)]
for v in a:
  array[v] += 1
  
for i in range(1, len(array)):
  if array[i] == 0:
    continue
    
  for j in range(i*2, len(array), i):
    array[j] = 0
    
count = 0
for v in array:
  if v == 1:
    count += 1
    
print(count)
int(input(x))**3

### FIXED CODE ###

int = int(input())

print(int**3)
a,b=map(int,input().split())
grid=[["."]*(a+2)]+[list("."+input()+".")for i in range(b)]+[["."]*(a+2)]
for s in range(1,1+b):
    for t in range(1,1+a):
        if grid[s][t]=="#" and all([grid[s+x][t+y]=="."for x,y in ([0,-1],[0,1],[1,0],[-1,0])]):
            print("No")
            exit()
print("Yes")

### FIXED CODE ###

h,w=map(int,input().split())
grid=[["."]*(w+2)]+[list("."+input()+".")for i in range(h)]+[["."]*(w+2)]
for s in range(1,1+h):
    for t in range(1,1+w):
        if grid[s][t]=="#" and all([grid[s+x][t+y]=="."for x,y in ([0,-1],[0,1],[1,0],[-1,0])]):
            print("No")
            exit()
print("Yes")
P=int(input())
Q=int(input())
R=int(input())
print("{}".format(min([P+Q,Q+R,R+P])))

### FIXED CODE ###

P, Q,R = map(int, input().split())
print("{}".format(min([P+Q,Q+R,R+P])))
n=int(input())
a=list(map(int,input().split()))
flg = True
if n%2==0:
  if 0 in a or len(set(a))!=n//2:
    flg=False
else:
  if len([0 for i in a if a==0])!=1 or len(set(a))!~n//2+1:
    flg=False
if flg:
  print(2**(n//2)%(10**9+7))
else:
  print(0)


### FIXED CODE ###

n=int(input())
a=list(map(int,input().split()))
flg = True
if n%2==0:
  if 0 in a or len(set(a))!=n//2:
    flg=False
else:
  if len([0 for i in a if i==0])!=1 or len(set(a))!=n//2+1:
    flg=False
if flg:
  print(2**(n//2)%(10**9+7))
else:
  print(0)
import numpy as np

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

suma=np.sum(A)
remain=N-suma
       
if remain>=0:
       print(remain)
else:
       print(-1)

### FIXED CODE ###

import numpy as np

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

suma=np.sum(A)
remain=N-suma

if remain>=0:
	print(remain)
else:
	print(-1)
import sys
input = sys.stdin.readline

from itertools import accumulate
from scipy.special import comb


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

    nums = [0] * 1001

    for e in l:
        nums[e] += 1

    acm = list(accumulate(nums))

    l.sort()
    ans = 0
    tmp = [0] * 1001
    tmp2 = [0] * 1001
    for i in range(n-2):
        for j in range(i+1, n-1):
            a = l[i]
            b = l[j]
            k = min(1000, a+b-1)

            # b < c のときの数
            cnt = acm[k] - acm[b]

            # b == c のときの補正
            if nums[b] >= 3 and a == b and tmp[b] == 0:
                cnt += int(comb(nums[b], 3))
                tmp[b] = 1

            if nums[b] >= 2 and a != b and tmp2[b] == 0:
                cnt += int(comb(nums[b], 2))
                tmp2[b] = 1

            ans += cnt

    print(ans)


if __name__ == "__main__":
    main()


### FIXED CODE ###

import sys
input = sys.stdin.readline

from bisect import bisect_left


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

    l.sort()

    ans = 0
    for i in range(n - 2):
        for j in range(i + 1, n - 1):
            a = l[i]
            b = l[j]
            mx = bisect_left(l, a + b)
            ans += mx - j - 1

    print(ans)


if __name__ == "__main__":
    main()
#!/usr/bin/env python
# -*- coding: utf-8 -*-
from sys import stdin

n = int(input())
x_list_str = stdin.readline().rstrip().split()
x_list = [int(i) for i in x_list_str]

# 体力のリスト
sum_hp_list = []

min_x = min(x_list)
max_x = max(x_list)

for i in range(min_x, max_x):
    sum_hp = 0
    for x in x_list:
        sum_hp += (x-i)**2
    sum_hp_list.append(sum_hp)

print(min(sum_hp_list))


### FIXED CODE ###

#!/usr/bin/env python
# -*- coding: utf-8 -*-
from sys import stdin

n = int(input())
x_list_str = stdin.readline().rstrip().split()
x_list = [int(i) for i in x_list_str]

# 体力のリスト
sum_hp_list = []

min_x = min(x_list)
max_x = max(x_list)

if min_x == max_x:
    print(0)
    exit()

for i in range(min_x, max_x):
    sum_hp = 0
    for x in x_list:
        sum_hp += (x-i)**2
    sum_hp_list.append(sum_hp)

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

c = 0
highest = 0
for i in range(n):
	if highest <= h[i]:
		c += 1
        highest = h[i]

print(c)

### FIXED CODE ###

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

c = 0
highest = 0
for i in range(n):
	if highest <= h[i]:
		c += 1
		highest = h[i]

print(c)
n = int(input())
red = {tuple(int(i) for i in input().split()): False for _ in range(n)}
blue = {tuple(int(i) for i in input().split()): False for _ in range(n)}
c = 0
for b in sorted(blue.keys()):
    for r in sorted(red.keys(), key=itemgetter(1), reverse=True):
        if not red[r] and b[0] > r[0] and b[1] > r[1]:
            red[r] = True
            blue[b] = True
            c += 1
            break
print(c)

### FIXED CODE ###

from operator import itemgetter


n = int(input())
red = {tuple(int(i) for i in input().split()): False for _ in range(n)}
blue = {tuple(int(i) for i in input().split()): False for _ in range(n)}
c = 0
for b in sorted(blue.keys()):
    for r in sorted(red.keys(), key=itemgetter(1), reverse=True):
        if not red[r] and b[0] > r[0] and b[1] > r[1]:
            red[r] = True
            blue[b] = True
            c += 1
            break
print(c)
a = []
while True:
    l = list(input().split)
    if l == [0,0]:
        break
    a.append(l)
	

for i in range(len(a)):
	H,W = a[i]
	print("#" * W)
	print(("#"+"#"*(W-2)+"#"+"\n")*(H-2),end="")    # Python3
	print("#" * W)
	print("")

### FIXED CODE ###

a = []
while True:
    l = list(map(int,input().split()))
    if l == [0,0]:
        break
    a.append(l)


for i in range(len(a)):
	H,W = a[i]
	for i in range(H):
		print("#"*W)
	print("")
N,M=map(int,input().split())
L = []
R = []
for i in range(M):
    x1,y1=[int(i) for i in input().split()]
    L.append(x1)
    R.append(y1)

landl=set(range(L[0],R[0]+1))


print(len(list(landl & set(range(L[i],R[i]+1)) for i in range(1,M))[0]))



### FIXED CODE ###

N,M=map(int,input().split())
L = []
R = []
for i in range(M):
    x1,y1=[int(i) for i in input().split()]
    L.append(x1)
    R.append(y1)

L2=max(L)
R2=min(R)

if L2<=R2:
    print(R2-L2+1)
else:
    print(0)
def euclid(a, b):
    r = a % b
    if 0 == r:
        return b
    return euclid(b, r)


def greatest_common_divisor(a, b):
    return int(a * b / euclid(a, b))


n = int(input())
t = [int(input()) for _ in range(n)]

if 1 == n:
    print(t[0])
elif 2 == n:
    print(greatest_common_divisor(t[0], t[1]))
else:
    d = greatest_common_divisor(t[0], t[1])
    for i in range(2, len(t)):
        d = greatest_common_divisor(d, t[i])
    print(d)


### FIXED CODE ###


def gcd(a, b):
    if 0 == b:
        return a
    return gcd(b, a % b)


def lcm(a, b):
    return (a * b) // gcd(a, b)


def lcm_arr(arr):
    ans = arr[0]
    for i in range(1, n):
        ans = lcm(ans, arr[i])
    return ans


n = int(input())
ans = lcm_arr([int(input()) for _ in range(n)])
print(min(ans, 10 ** 18))
import fractions

A,B,C,D = input().strip().split(" ")
A = int(A)
B = int(B)
C = int(C)
D = int(D)

div1 = A // C
div2 = A // D
div3 = (B-1) // C
div4 = (B-1) // D

X = C*D // int(fractions.gcd(C,D))
div5 = B // X

del_nums = (div3 + div4) - (div1 + div2) + div5
result = B - A - del_nums
print(result)

### FIXED CODE ###

nums = input().strip()
pre_num = ""
result = ""
flag = True

for num in nums:
	if pre_num == num: flag = False
	pre_num = num

if flag: result = "Good"
else: result = "Bad"

print(result)
a,b,c = map(int, input().split())
x = 0
for i in range(a,b+1)
 if 80 %% i == 0:
  x += x+1
 print(x)



### FIXED CODE ###

a,b,c = map(int, input().split())
x = 0
for i in range(a,b+1):
 if c%i == 0:
  x = x+1
print(x)
# 入力
data = input().split()

# プレイヤ人数
player = int(data[0])
# はじめのポイント
initPoint = int(data[1])
# 質問回数
question = int(data[2])

# はじめの各プレイヤのポイント
playerPoint = []

for i in range(player):
  playerPoint.append(initPoint)

# 問題解答
for i in range(question):
  # 全員のポイントを-1
  playerPoint = [i-1 for i in playerPoint]
  # 正解者
  corrPlayer = int(input())
  # 正解者のポイントを+1(減らさない)
  playerPoint[corrPlayer -1] = playerPoint[corrPlayer -1] + 1
  
# 解答
for i in range(player):
  if playerPoint(i) <= 0:
    print('No)
  else:
    print('Yes')
  

  


### FIXED CODE ###

# 入力
data = input().split()
 
# プレイヤ人数
player = int(data[0])
# はじめのポイント
initPoint = int(data[1])
# 質問回数
question = int(data[2])
 
# 正解しない場合のプレイヤのポイント
playerPoint = []
 
for i in range(player):
  playerPoint.append(initPoint - question)
 
# 問題解答
for i in range(question):
  # 正解者
  corrPlayer = int(input())
  # 正解者のポイントを+1(減らさない)
  playerPoint[corrPlayer -1] = playerPoint[corrPlayer -1] + 1
  
# 解答
for i in range(player):
  if playerPoint[i] <= 0:
    print('No')
  else:
    print('Yes')
n=int(input())
a=list(map(int,input().split()))
a.sort()
s=0
for i in range(n):
    a[i] -= i + 1
    s += a[i]
b1 = a[n // 2]
b2 = a[(n // 2 )+ 1]
r1=0
r2=0
for i in range(n):
    r1+=abs(a[i]-b1)
    r2+=abs(a[i]-b2)
print(min(r1,r2))

### FIXED CODE ###

n=int(input())
a=list(map(int,input().split()))
for i in range(n):
    a[i] -= i + 1
a.sort()
b1 = a[n // 2]
b2 = a[(n // 2 ) - 1]
r1=0
r2=0
for i in range(n):
    r1+=abs(a[i]-b1)
    r2+=abs(a[i]-b2)
print(min(r1,r2))
import sys
c = [0 for i in range(37)]
for i in range(10):
    for j in range(10):
        for k in range(10):
            for l in range(10):
                t = i + j + k + l
                c[t] += 1
for line in sys.stdin:
    print(c[int(line)])

### FIXED CODE ###

import sys
t = [None for i in range(10000)]
c = 0
for i in range(10):
    for j in range(10):
        for k in range(10):
            for l in range(10):
                t[c] = i + j + k + l 
                c += 1
for line in sys.stdin:
    print(t.count(int(line)))
def main():
    N = int(input())
    A = list(map(int, input().split()))
    Ap = sorted([i for i in A if i >= 0])
    An = sorted([i for i in A if i < 0])
    if len(An) % 2 == 0:
      return sum(Ap) - sum(An)
    return sum(Ap) - sum(An) - 2 * min(Ap[0], -An[-1])
print(main())



### FIXED CODE ###

def main():
    N = int(input())
    A = list(map(int, input().split()))
    s = sum(abs(a) for a in A)
    if sum(1 for i in A if i < 0) & 1:
        s -= 2 * min(abs(a) for a in A)
    return s

print(main())
H,W = map(int,input().split())
grid = [[]] * H

for i in range(H):
  c = list(input())
  grid[i] = c
  
black = "#"
white = "."

ans = "Yes"


for i in range(H):
  for j in range(W):
    if grid[i][j] == black:
      here = grid[i][j]
      around = ""
      
      if i == 0:
        around += grid[i + 1][j]
      elif i == W - 1:
        around += grid[i - 1][j]
      else:
        around += (grid[i - 1][j] + grid[i + 1][j])
      
      if j == 0:
        around += grid[i][j + 1]
      elif j == H - 1:
        around += grid[i][j - 1]
      else:
        around += (grid[i][j + 1] + grid[i][j - 1])
      
      if all([i == white for i in around]):
        ans = "No"
        break

print(ans)


### FIXED CODE ###

H,W = map(int,input().split())
grid = [[]] * H

for i in range(H):
  c = list(input())
  grid[i] = c
  
black = "#"
white = "."

ans = "Yes"

for i in range(H):
  for j in range(W):
    if grid[i][j] == black:
      around = ""
      #ヨコ
      for t in range(max(0,j - 1),min(W,j + 2)):
        if t != j:
          around += grid[i][t]
      #タテ
      for k in range(max(0,i - 1),min(H,i + 2)):
        if k != i:
          around += grid[k][j]
      
      if all([s == white for s in around]):
        ans = "No"
        break
  if ans == "No":
    break
      
print(ans)
import math
N,M=map(int,input().split())

def nCr(n,r):
	return math.factorial(n)//(math.factorial(n-r)*math.factorial(r))

print(nCr(N,2)+nCr(M,2))

### FIXED CODE ###

import math
N,M=map(int,input().split())

def nCr(n,r):
	return math.factorial(n)//((math.factorial(n-r)) * math.factorial(r))

if N >= 2:
	A=nCr(N,2)
else:
	A=0
if M >= 2:
	B=nCr(M,2)
else:
	B=0
print(A+B)
n=int(input())
h=list(map(int,input().split()))

kaisuulist=[]
nowmax=0

for i in range(1,n):
  if h[i-1]<h[i]:
    kaisuulist.append(i-nowmax-1)
    nowmax=i

#print(kaisuulist)
print(max(max(kaisuulist),n-1-nowmax))

### FIXED CODE ###

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

kaisuulist=[]
nowmax=0

for i in range(1,n):
  if h[i-1]<h[i]:
    kaisuulist.append(i-nowmax-1)
    nowmax=i

#print(kaisuulist)
if not kaisuulist:
  print(n-1-nowmax)
else:
  print(max(max(kaisuulist),n-1-nowmax))
N = int(input())
masu=[int(x) for x in input().split(" ")]
c=0
for i in range(0,N,2)
	if masu[i]%2 !=0:
    	c+=1
print(c)

### FIXED CODE ###

N = int(input())
masu=[int(x) for x in input().split(" ")]
c=0
for i in range(0,N,2):
	if masu[i]%2 !=0: c += 1
print(c)
import math
X = input().split(" ")
A = int(X[0])
B = int(X[1])
C = A * B
D = math.gcd(A,B)
print(C // D)

### FIXED CODE ###

from fractions import gcd
X = input().split(" ")
A = int(X[0])
B = int(X[1])
C = A * B
D = gcd(A,B)
print(C // D)