Harryxun/stf_run huggingface dataset:
import math

n = int(input())
l = []
for i in range(n):
    l[i] = int(input())
lc = 1



for i in range(n):
    lc = math.gcd(lc , l[i])/lc*l[i]

for i in range(n):
    print(lc/l[i])
    print(" ")


### FIXED CODE ###

import math
import fractions
n = int(input())


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

lc = 1

def lcm(x, y):
    return (x * y) // fractions.gcd(x, y)


for i in range(n):
    lc = lcm(lc,l[i])
ans = 0
for i in range(n):
    ans+=lc//l[i]

print(ans%1000000007)
def lcm_core(a,b):
    g = gcd_core(a,b)
    return (a*b)//g

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

def lcm(arr):
    l = lcm_core(arr[0],arr[1])
    for i in range(2,len(arr)):
        l = lcm_core(l,arr[i])
    return l

n = int(input())
arr = list(map(int,input().split()))
l = lcm(arr)
ans = 0
m = 10**9+7
for i in range(n):
    ans += l//arr[i]
    ans %=  m
print(ans)



### FIXED CODE ###

import fractions
from functools import reduce

def gcd(*numbers):
  return reduce(fractions.gcd, numbers)

def gcd_list(numbers):
  return reduce(fractions.gcd, numbers)

def lcm_base(x, y):
    return (x * y) // fractions.gcd(x, y)

def lcm(*numbers):
    return reduce(lcm_base, numbers, 1)

def lcm_list(numbers):
    return reduce(lcm_base, numbers, 1)

N = int(input())
A = tuple(map(int, input().split()))

mod = 10 ** 9 + 7

l = lcm_list(A)

ans = 0

for i in range(N):
  ans += l // A[i]

ans = ans % mod

print(ans)
from collections import Counter

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

sc = [[0,0] for _ in range(M)]
X = [0 for _ in range(N)]

for i in range(M):
    sc[i][0],sc[i][1] = map(int,input().split())
    
def get_unique_list(seq):
    seen = []
    return [x for x in seq if x not in seen and not seen.append(x)]

sc = get_unique_list(sc)

sc_0 = [0 for _ in range(len(sc))]
judge = True

for i in range(len(sc)):
    sc_0[i]= sc[i][0]

cnt_sc0 = Counter(sc_0)
for i in sc_0:
    if cnt_sc0[i]> 1:
        judge = False
        break

if judge==True:    
    for i in range(len(sc)):
        X[sc[i][0]-1] = sc[i][1]
    
    for i in range(len(X)):
        if X[i] >= 1:
            x = X[i:]
            break

if judge==True:
    if len(x)==N:
        print(int("".join(map(str,x))))
else:
    print(-1)



### FIXED CODE ###

N, M = map(int,input().split())
s = []

for i in range(M):
    s.append(list(map(int,input().split())))

for num in range(1000):
    str_num = str(num)
    if len(str_num) != N:
        continue
    
    flag = True
    for i in range(M):
        keta = s[i][0]
        if str_num[keta - 1] != str(s[i][1]): 
            flag = False
    if flag:
        print(num)
        exit()

print(-1)
tap,out = map(int,input().split()
print(int((out-1)/(tap-1)))


### FIXED CODE ###

a,b = map(int,input().split())
m = 1
cnt = 0
while m < b:
    m -= 1
    m += a
    cnt += 1
print(cnt)
def main():
  def add(i,x):
    i+=1
    while i<=n:
      bit[i-1]+=x
      i+=i&-i
  def sum_sub(i):
    a=0
    i+=1
    while i:
      a+=bit[i-1]
      i-=i&-i
    return a
  def sum(i,j):
    a=sum_sub(j+1)
    if i!=0:a-=sum_sub(i-1)
    return a
  
  n,q,*x=map(int,open(0).read().split())
  a=x[:n]
  queries=[]
  for i in range(q):
    l,r=x[n+i*2:n+(i+1)*2]
    l-=1
    r-=1
    queries.append(r<<40|l<<20|i)
  ans=[0]*q
  queries.sort()
  for i in range(n):
    ind=queries[i]%(1<<20)
    queries[i]>>=20
    l=queries[i]%(1<<20)
    queries[i]>>=20
    r=queries[i]
    queries[i]=[r,l,ind]
  queries.append([10*20])
  lastAppeared=[-1]*n
  bit=[0]*n
  j=0
  for i in range(n):
    if lastAppeared[a[i]-1]!=-1:
      add(lastAppeared[a[i]-1],-1)
      add(i,1)
      lastAppeared[a[i]-1]=i
    else:
      add(i,1)
      lastAppeared[a[i]-1]=i
    while queries[j][0]==i:
      r,l,ind=queries[j]
      j+=1
      ans[ind]=sum(l,r-1)
  print(*ans)
if __name__ == "__main__":
  main()

### FIXED CODE ###

def main():
  def add(i,x):
    i+=1
    while i<=n:
      bit[i-1]+=x
      i+=i&-i
  def sum_sub(i):
    a=0
    i+=1
    while i:
      a+=bit[i-1]
      i-=i&-i
    return a
  def sum(i,j):
    a=sum_sub(j+1)
    if i!=0:a-=sum_sub(i-1)
    return a
  
  n,q,*x=map(int,open(0).read().split())
  a=x[:n]
  queries=[]
  for i in range(q):
    l,r=x[n+i*2:n+(i+1)*2]
    l-=1
    r-=1
    queries.append(r<<40|l<<20|i)
  ans=[0]*q
  queries.sort()
  for i in range(q):
    ind=queries[i]%(1<<20)
    queries[i]>>=20
    l=queries[i]%(1<<20)
    queries[i]>>=20
    r=queries[i]
    queries[i]=[r,l,ind]
  queries.append([10*20])
  lastAppeared=[-1]*n
  bit=[0]*n
  j=0
  for i in range(n):
    if lastAppeared[a[i]-1]!=-1:
      add(lastAppeared[a[i]-1],-1)
      add(i,1)
      lastAppeared[a[i]-1]=i
    else:
      add(i,1)
      lastAppeared[a[i]-1]=i
    while queries[j][0]==i:
      r,l,ind=queries[j]
      j+=1
      ans[ind]=sum(l,r-1)
  print(*ans)
if __name__ == "__main__":
  main()
s = [int(k) for k in list(input())]
s1 = 10*int(s[0])+int(s[1])
s2 = 10*int(s[2])+int(s[3])
if s2 == 0 and s1 > 12:
    print("NA")
elif s1 > 12 and s2 <= 12:
    print("YYMM")
elif s1 <= 12 and s2 > 12:
    print("MMYY")
else:
    print("AMBIGUOUS")

### FIXED CODE ###

import sys
import math
def i():return int(sys.stdin.readline().replace("\n",""))
def i2():return map(int,sys.stdin.readline().replace("\n","").split())
def s():return str(sys.stdin.readline().replace("\n",""))
def l():return list(sys.stdin.readline().replace("\n",""))
def intl():return [int(k) for k in sys.stdin.readline().replace("\n","").split()]
def lx():return list(map(lambda x:int(x)*-1,sys.stdin.readline().replace("\n","").split()))
def t():return tuple(map(int,sys.stdin.readline().replace("\n","").split()))

if __name__ == "__main__":pass
n,k = i2()
s = l()
s[k-1] = s[k-1].lower()
for k in s:
    print(k,end="")
from math import gcd 


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

gcd_l = [0]
gcd_r = [0]
for i in range(N):
    gcd_l.append(gcd(gcd_l[i], A[i]))
    gcd_r.append(gcd(gcd_r[i], A[-(i+1)]))

gcd_r = gcd_r[::-1]

ans = []
for i in range(N):
    ans.append(gcd(gcd_l[i], gcd_r[i+1]))

print(max(ans))

### FIXED CODE ###

from fractions import gcd


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

gcd_l = [0]
gcd_r = [0]
for i in range(N):
    gcd_l.append(gcd(gcd_l[i], A[i]))
    gcd_r.append(gcd(gcd_r[i], A[-(i+1)]))

gcd_r = gcd_r[::-1]

ans = []
for i in range(N):
    ans.append(gcd(gcd_l[i], gcd_r[i+1]))

print(max(ans))
n, m ,l = map(int, input().split())

A = [list(map(int,input().split())) for i in range(n)]
B = [list(map(int,input().split())) for j in range(m)]

C = [[0 for i in range(l)] for j in range(n)]

for i in range(l):
	for j in range(n):
		for k in range(m):
			C[i][j] += (A[i][k] * B[k][j])

Cp = [print(" ".join(map(str, C[i]))) for i in range(n)]
			

### FIXED CODE ###

n, m ,l = map(int, input().split())

A = [list(map(int,input().split())) for i in range(n)]
B = [list(map(int,input().split())) for j in range(m)]

C = [[0 for i in range(l)] for j in range(n)]

for i in range(n):
	for j in range(l):
		for k in range(m):
			C[i][j] += (A[i][k] * B[k][j])

Cp = [print(" ".join(map(str, C[i]))) for i in range(n)]
s = input()

print(s[0]+ str(len(s-2)) +s[-1])

### FIXED CODE ###

s = input()

print(s[0]+ str(len(s)-2) +s[-1])
n=int(input())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
count=0

def battle(a,ai,b):
  if a+ai <= b:
    ai=0
    count=a+ai
  elif a<=b:
    ai=ai-(b-a)
    count=b
  else:
    ai=ai
    count=b
  result ai,count
  
for i in range(n):
  c=0
  a[i+1],c=battle(a[i],a[i+1],b[i])
  count += c

print(count)

### FIXED CODE ###

n=int(input())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
count=0
def battle(a,ai,b):
  if a+ai <= b:
    count=a+ai
    ai=0
  elif a<=b:
    ai=ai-(b-a)
    count=b
  else:
    ai=ai
    count=b
  return ai,count
  
for i in range(n):
  c=0
  a[i+1],c=battle(a[i],a[i+1],b[i])
  count += c
 
print(count)
str =list(input())
counter =0
max=0
for s in str:
    if s ='S':
        counter =0
    else 
       counter +=1
       if max <counter
          max =counter
print(max)

### FIXED CODE ###

str =list(input())
counter =0
max=0
for s in str:
    if s =='S':
        counter =0
    else :
       counter +=1
       if max <counter:
          max =counter
print(max)
S = input()
T = input()
a = [a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,u,v,w,x,y,z]
if T == S + .index(a):
  print("YES")
  else:
    print("NO")
    
    

### FIXED CODE ###


    
s = input()
t = input()

if t[:-1] == s:
    print("Yes")
else:
    print("No")
a,s,b = input(str, input.split())
if s ="+":
    print(a + b)
else:
    print(a - b)

### FIXED CODE ###

a,s,b = map(str, input().split())
if s == "+":
    print(int(a) + int(b))
else:
    print(int(a) - int(b))
import collections


if __name__ == '__main__':
    n = int(input())
    a = [int(i) for i in input().split()]
    q = int(input())
    key = [i for i in range(10**5)]
    val = [0]*(10**5)
    dict = dict(zip(key,val))
    dict.update(collections.Counter(a))
    ans = sum(a)

    for i in range(q):
        b, c = map(int, input().split())
        ans= ans - b*dict[b] + c*dict[b]
        count = dict[b]
        dict[b]=0
        dict[c]+=count
        print(ans)


### FIXED CODE ###

import collections


if __name__ == '__main__':
    n = int(input())
    a = [int(i) for i in input().split()]
    q = int(input())
    key = [i for i in range(10**5+1)]
    val = [0]*(10**5+1)
    dict = dict(zip(key,val))
    dict.update(collections.Counter(a))
    ans = sum(a)

    for i in range(q):
        b, c = map(int, input().split())
        ans= ans - b*dict[b] + c*dict[b]
        count = dict[b]
        dict[b]=0
        dict[c]+=count
        print(ans)
N, M, K = map(int, input().split())

to = [[] for i in range(N)]
block = [[] for i in range(N)]
sets = []

is_visited = [False] * N
graph_g = [None] * N
graph_cnt = -1

def dfs(s, g):
    global graph_cnt
    if is_visited[s]:
        return graph_g[s]

    is_visited[s] = True
    if g == None:
        graph_cnt += 1
        graph_g[s] = graph_cnt
    else:
        graph_g[s] = g

    for edge in to[s]:
        dfs(edge, graph_cnt)


for i in range(M):
    A, B = map(int, input().split())
    to[A-1].append(B-1)
    to[B-1].append(A-1)

for i in range(K):
    C, D = map(int, input().split())
    block[C-1].append(D-1)
    block[D-1].append(C-1)

for i in range(N):
    dfs(i, None)

group_to_idx = [set() for i in range(graph_cnt+1)]
if len(group_to_idx) != 0:
    for i in range(N):
        group_to_idx[graph_g[i]].add(i)

ret = []
for i in range(N):
    cand = len(group_to_idx[graph_g[i]])
    fri = len(to[i])
    tmp_block = len(group_to_idx[graph_g[i]] & set(block[i]))

    tmp_ret = cand - fri - tmp_block - 1
    ret.append(tmp_ret)

print(*ret)

### FIXED CODE ###

import sys
sys.setrecursionlimit(4100000)

from collections import Counter

N, M, K = map(int, input().split())

to = [[] for i in range(N)]
block = [[] for i in range(N)]
sets = []

is_visited = [False] * N
graph_g = [None] * N
graph_cnt = -1

def dfs(s, g):
    global graph_cnt
    if is_visited[s]:
        return 0

    is_visited[s] = True
    if g == None:
        graph_cnt += 1
        graph_g[s] = graph_cnt
    else:
        graph_g[s] = g

    for edge in to[s]:
        if graph_g[edge] == None:
            dfs(edge, graph_cnt)


for i in range(M):
    A, B = map(int, input().split())
    to[A-1].append(B-1)
    to[B-1].append(A-1)

for i in range(N):
    if is_visited[i]:
        continue
    dfs(i, None)

for i in range(K):
    C, D = map(int, input().split())
    if graph_g[C-1] == graph_g[D-1]:
        block[C-1].append(D-1)
        block[D-1].append(C-1)

ct = Counter(graph_g)

ret = []
for i in range(N):
    cand = ct[graph_g[i]]
    fri = len(to[i])
    tmp_block = len(block[i])

    tmp_ret = cand - fri - tmp_block - 1
    ret.append(tmp_ret)

print(*ret)
N,K,X,Y = map(int,input().split())
price = 0
for i in range(1,N+1):
    if i <= K:
        price += X
    else:
        price += Y
print(price)

### FIXED CODE ###

N = int(input())
K = int(input()) 
X = int(input())
Y = int(input())
if N < K:
    print(X * N)
else:
    print(K * X + (N - K) * Y)
n,k=map(int , input().split())
string=list(input())
result=[]
for i in range(n):
  if i==k-1:
    result.append(chr(ord(string[i])+32))
  else:
    result.append(string[i])
 print(''.join(result)) 

### FIXED CODE ###

n,k=map(int , input().split())
string=list(input())
result=[]
for i in range(n):
  if i==k-1:
    result.append(chr(ord(string[i])+32))
  else:
    result.append(string[i])
print(''.join(result))
def edit_distance(s, t):
 s=raw_input()
 t=raw_input()
 dp = {}
 for i in range(len(s) + 1):
  dp[i] = {0: i}
 for j in range(len(t) + 1):
  dp[0][j] = j
 for i in range(1, len(s) + 1):
  for j in range(1, len(t) + 1):
   d = 0 if s[i-1] == t[j-1] else 1
   dp[i][j] = min(dp[i-1][j] + 1,
   dp[i][j-1] + 1,
   dp[i-1][j-1] + d)
 return dp[len(s)][len(t)]
n = input()
for p in range(n):
    print edit_distance(s, t)

### FIXED CODE ###

def edit_distance():
 s = raw_input()
 t = raw_input()
 a = len(s)
 b = len(t)
 x = [0 for i in range(b+1)]
 for i in range(a):
   q = s[i]
   x2 = x+[]
   for j in range(b):
    if (q ==t[j]):
     x[j+1] =x2[j]+1
    elif (x[j+1]<x[j]):
     x[j+1] =x[j]
 return x[-1]

n = input()
for i2 in range(n):
 print edit_distance()
N=int(input())

a=[0]*10**4

for x in range(1,(N+1)):
     for y in range(1,(N+1)):
         for z in range(1,(N+1)):
             n=(x+y+z)**2-(x*y+y*z+z*x)
             a[n+1]+=1

for n in range(1,N+1):
    print(a[n])







### FIXED CODE ###

N=int(input())

a=[0]*10**4

for x in range(1,100):
     for y in range(1,100):
         for z in range(1,100):
             n=(x+y+z)**2-(x*y+y*z+z*x)
             if n<=10000:
                 a[n-1]+=1

for n in range(N):
    print(a[n])
S = input()

days = ["SUN","MON","TUE","WED","THU","FRI","SAT"]

for d in len(days):
  if S == days[d]:
    break

print(6 - d)

### FIXED CODE ###

S = input()

days = ["SUN","MON","TUE","WED","THU","FRI","SAT"]

for i in range(len(days)):
  if S == days[i]:
    break

print(7 - i)
import math
a,b = map(int,input().split())
div = math.gcd(a,b)
pro = a*b
print(pro//div)

### FIXED CODE ###

def lcm(a,b):
  lar = max(a, b) 
  small = min(a, b) 
  i = lar 
  while(1) : 
    if (i % small == 0): 
      return i 
    i += lar 

x,y = map(int,input().split())
print(lcm(x,y))
import sys
sys.setrecursionlimit(10 ** 6)
input = sys.stdin.readline
K = int(input())
RUN = {
    0:[0, 1],
    1:[0, 1, 2],
    2:[1, 2, 3],
    3:[2, 3, 4],
    4:[3, 4, 5],
    5:[4, 5, 6],
    6:[5, 6, 7],
    7:[6, 7, 8],
    8:[7, 8, 9],
    9:[8, 9]
}
cnt = 0

def dfs(i, s, p):
    if i == 0:
        cnt = cnt + 1
        if cnt == K:
            print(s)
            exit()
    if s == 0:
        for ii in range(10):
            dfs(i-1, s+ii*10**(i-1), ii)
    else:
        for ii in RUN[p]:
            dfs(i-1, s+ii*10**(i-1), ii)

dfs(10, 0, 0)

### FIXED CODE ###

import sys
sys.setrecursionlimit(10 ** 6)
input = sys.stdin.readline
K = int(input())
RUN = {
    0:[0, 1],
    1:[0, 1, 2],
    2:[1, 2, 3],
    3:[2, 3, 4],
    4:[3, 4, 5],
    5:[4, 5, 6],
    6:[5, 6, 7],
    7:[6, 7, 8],
    8:[7, 8, 9],
    9:[8, 9]
}
cnt = 0
for i10 in range(10):
    ans10 = i10 * 10 ** 9
    if ans10 == 0:
        i9s = range(10)
    else:
        i9s = RUN[i10]
    for i9 in i9s:
        ans9 = ans10 + i9 * 10 ** 8
        if ans9 == 0:
            i8s = range(10)
        else:
            i8s = RUN[i9]
        for i8 in i8s:
            ans8 = ans9 + i8 * 10 ** 7
            if ans8 == 0:
                i7s = range(10)
            else:
                i7s = RUN[i8]
            for i7 in i7s:
                ans7 = ans8 + i7 * 10 ** 6
                if ans7 == 0:
                    i6s = range(10)
                else:
                    i6s = RUN[i7]
                for i6 in i6s:
                    ans6 = ans7 + i6 * 10 ** 5
                    if ans6 == 0:
                        i5s = range(10)
                    else:
                        i5s = RUN[i6]
                    for i5 in i5s:
                        ans5 = ans6 + i5 * 10 ** 4
                        if ans5 == 0:
                            i4s = range(10)
                        else:
                            i4s = RUN[i5]
                        for i4 in i4s:
                            ans4 = ans5 + i4 * 10 ** 3
                            if ans4 == 0:
                                i3s = range(10)
                            else:
                                i3s = RUN[i4]
                            for i3 in i3s:
                                ans3 = ans4 + i3 * 10 ** 2
                                if ans3 == 0:
                                    i2s = range(10)
                                else:
                                    i2s = RUN[i3]
                                for i2 in i2s:
                                    ans2 = ans3 + i2 * 10
                                    if ans2 == 0:
                                        i1s = range(1, 10)
                                    else:
                                        i1s = RUN[i2]
                                    for i1 in i1s:
                                        ans1 = ans2 + i1
                                        cnt += 1
                                        # print(cnt, ans1)
                                        if cnt == K:
                                            print(ans1)
                                            exit()
week = ['MON','TUE','WED','THU','FRI','SAT','SUN']
day = input()
ans = week.index('SUN')-week,index(day)
print(ans if ans!=0 else 7)

### FIXED CODE ###

week = ['MON','TUE','WED','THU','FRI','SAT','SUN']
day = input()
ans = week.index('SUN')-week.index(day)
print(ans if ans!=0 else 7)
N=int(input())
listA=list(map(int,input().split()))
listB=list(map(int,input().split()))
listC=list(map(int,input().split()))
sumB=int(sum(listB))
print("sumB",sumB)
for i in range(1,N-1):
    if listA[i] == listA[i-1]+1:
        sumB=sumB+int(listC[listA[i-2]])
print(sumB)

### FIXED CODE ###

N=int(input())
listA=list(map(int,input().split()))
listB=list(map(int,input().split()))
listC=list(map(int,input().split()))
sumB=int(sum(listB))
for i in range(1,N):
    if listA[i] == listA[i-1]+1:
        sumB=sumB+int(listC[listA[i-1]-1])
print(sumB)
d,n=map(int,input().split())
if d==0:
    print(n)
else:
    for i in range(n+1):
        a=100**d*i
print(a)


### FIXED CODE ###

d,n=map(int,input().split())
if d==0:
    if n==100:
        print(n+1)
    else:
        print(n)
elif d==1:
    if n==100:
        print(100*n+100)
    else:
        print(100*n)
elif d==2:
    if n==100:
        print(n*10000+10000)
    else:
        print(n*10000)
n = int(input())

a = np.zeros(n,dtype=int)
b = np.zeros(n,dtype=int)

for i in range(n):
    a[i],b[i] = map(float, input().split())

#listをsortする
if n==2:
    a0 = [a[0]]
    b0 = [b[0]]
    if a[1]>=a[0]:
        a0.append(a[1])
    else:
        a0.insert(0,a[1])
    if b[1]>=a[0]:
        b0.append(b[1])
    else:
        b0.insert(0,b[1])
else:
    a0 = [a[0]]
    b0 = [b[0]]
    if a[1]>=a[0]:
        a0.append(a[1])
    else:
        a0.insert(0,a[1])
    if b[1]>=a[0]:
        b0.append(b[1])
    else:
        b0.insert(0,b[1])    
    for i in range(2,n):
        if a[i]>=a0[len(a0)-1]:
            a0.append(a[i])
        elif a[i]<=a0[0]:
            a0.insert(0,a[i])
        else:
            l = 0
            for j in range(len(a0)-1):
                if a0[j]<=a[i] and a[i]<=a0[j+1] and l==0:
                    a0.insert(j+1,a[i])
                    l = 1
        if b[i]>=b0[len(b0)-1]:
            b0.append(b[i])
        elif b[i]<=b0[0]:
            b0.insert(0,b[i])
        else:
            m = 0
            for j in range(len(b0)-1):
                if b0[j]<=b[i] and b[i]<=b0[j+1] and m==0:
                    b0.insert(j+1,b[i])
                    m = 1

                    
if n%2 == 1:
    a0cen = a0[(n-1)//2]
    b0cen = b0[(n-1)//2]
    nn = b0cen - a0cen + 1
else:
    a0cen1 = a0[(n-2)//2]+a0[n//2]
    b0cen1 = b0[(n-2)//2]+b0[n//2]
    nn = int(b0cen1 -a0cen1 +1)

print(nn)           


### FIXED CODE ###

import numpy as np

        
n = int(input())

a = np.zeros(n,dtype=int)
b = np.zeros(n,dtype=int)

for i in range(n):
    a[i],b[i] = map(float, input().split())

#listをsortする
a.sort()
b.sort()
                    
if n%2 == 1:
    a0cen = a[(n-1)//2]
    b0cen = b[(n-1)//2]
    nn = b0cen - a0cen + 1
else:
    a0cen1 = a[(n-2)//2]+a[n//2]
    b0cen1 = b[(n-2)//2]+b[n//2]
    nn = int(b0cen1 -a0cen1 +1)

print(nn)
s = list(map(int,intput().split()))
s.sorted

print(s[len(s)-1] - s[0])

### FIXED CODE ###

n = int(input())
s = list(map(int,input().split()))
s.sort()

print(s[len(s)-1] - s[0])
n,m=map(int,input().split())
L=[list(map(int,input().split()) for _ in range(m)]
  
a=max(L)
b=min(M)
if a<=b:
  print(b-a+1)
else:
  print(0)

### FIXED CODE ###

n,m=map(int,input().split())
L=[]
M=[]
for i in range(m):
  l,m=map(int,input().split())
  L.append(l)
  M.append(m)
  
a=max(L)
b=min(M)
if a<=b:
  print(b-a+1)
else:
  print(0)
import sys
sys.setrecursionlimit(10 ** 9)

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

root = [-1] * (110000)
def find(x):
    if root[x] > 0:
        x = find(x)
    return x

def unite(a, b):
    a = find(a)
    b = find(b)
    if a != b:
        root[a] += root[b]
        root[b] = a
        

for _ in range(m):
    a, b = map(int, input().split())
    unite(a, b)

ans = 0
for i in range(1, n+1):
    if root[i]  < 0:
        ans += 1
print(ans-1)



### FIXED CODE ###

import sys
sys.setrecursionlimit(10 ** 9)

n, m = map(int, input().split())
root = [-1] * n
def find(x):
    if root[x] < 0:
        return x
    else:
        root[x] = find(root[x])
        return root[x]
    

def unite(x, y):
    x = find(x)
    y = find(y)
    if x == y:
        return
    root[x] += root[y]
    root[y] = x
        

for _ in range(m):
    a, b = map(int, input().split())
    a -= 1
    b -= 1
    unite(a, b)

ans = len([i for i in root if i < 0]) - 1
print(ans)
N = int(input())

sum_list = []

def findSumOfDigit(n):
    s = 0
    while(n > 0):
        s += n % 10
        n = int(n / 10)
    return s

for a in range(1, N-1):
    b = N - a
    sum_list.append(findSumOfDigit(a) + findSumOfDigit(b))

print(min(sum_list))


### FIXED CODE ###

N = int(input())

sum_list = []

def findSumOfDigit(n):
    s = 0
    while(n > 0):
        s += n % 10
        n = int(n / 10)
    return s

for a in range(1, N):
    b = N - a
    sum_list.append(findSumOfDigit(a) + findSumOfDigit(b))

print(min(sum_list))
import itertools

n = int(input())
p = [tuple(map(int, input().split())) for _ in range(n)]
c = {}

for i, j in itertools.combinations(range(len(p)), 2):
  d = (p[j][0] - p[i][0], p[j][1] - p[i][1])
  
  if d not in c:
    c[d] = 1
  else:
    c[d] += 1  

print(len(p) - max(c.values()))


### FIXED CODE ###

import itertools


def main():
  n = int(input())
  p = [tuple(map(int, input().split())) for _ in range(n)]
  c = {}

  if n == 1:
    print(1)
    return

  for i, j in itertools.product(range(len(p)), repeat=2):
    if i == j:
      continue

    d = (p[j][0] - p[i][0], p[j][1] - p[i][1])

    if d not in c:
      c[d] = 1
    else:
      c[d] += 1

  print(len(p) - max(c.values()))


if __name__ == '__main__':
  main()
n=int(input())
if n<1200:
  print('ABC')
elif n<2800&&n>=1200:
  print('ARC')
else:
  print('AGC')
  

### FIXED CODE ###

n=int(input())
if n<1200:
  print('ABC')
elif n>=2800:
  print('AGC')
else:
  print('ARC')
i  = input()
if i == 'Sunny':
    print('Cloudy'):
elif i == 'Cloudy':
    print('Rainy')
elif i = 'Rainy':
    print('Sunny')

### FIXED CODE ###

i  = input()
if i == 'Sunny':
    print('Cloudy')
elif i == 'Cloudy':
    print('Rainy')
elif i == 'Rainy':
    print('Sunny')