f = open("27-B_demo (2).txt") # для файла A за­ме­ни­те на­зва­ние

s = f.readlines()

n = int(s[0]) # ко­ли­че­ство пар

summi = 0

d = 10**6

for i in range(1, n + 1):

x, y = map(int, s[i].split())

summi += max(x, y)

if abs(x - y) % 3 != 0:

d = min(d, abs(x - y))

if summi % 3 != 0:

print(summi)

else:

print(summi - d)

a=[list(map(int,s.split())) for s in open('27-B_demo.txt')][1:]

s=sum([max(x) for x in a])

d=min([abs(x[0]-x[1]) for x in a if (x[0]-x[1])%3!=0])

print(s if s%3!=0 else s-d)

f = open("27-B_2.txt") # для файла A ука­жи­те его на­зва­ние

s = f.readlines()

n = int(s[0])

maxi = 0

max_0 = 0

max_2 = 0

max_7 = 0

max_14 = 0

count = []

for i in range(1, n + 1):

s[i] = int(s[i])

if s[i] % 14 == 0:

max_14 = max(max_14, s[i])

count.append(max_14)

elif s[i] % 7 == 0:

max_7 = max(max_7, s[i])

elif max_2 % 2 == 0:

max_2 = max(max_2, s[i])

else:

max_0 = max(max_0, s[i])

if count[0] == count [1]:

maxi = max_14**2

else:

maxi = max(max_14 * max(max_7, max_0, max_2), max_7 * max_2)

print(maxi)

import java.io.BufferedReader;

import java.io.FileReader;

import java.util.ArrayList;

import java.util.Comparator;

import java.util.List;

public class EGE {

public static void main(String[] args) throws Throwable {

BufferedReader reader = new BufferedReader(new FileReader("27-B_2.txt"));

int n = Integer.parseInt(reader.readLine());

List<Integer> list = new ArrayList<>(n);

for (int i = 0; i < n; i++) {

list.add(Integer.parseInt(reader.readLine()));

}

list.sort(Comparator.reverseOrder());

for (int i = 0; i < n; i++) {

for (int j = 0; j < n; j++) {

if (i == j) continue;

int a = list.get(i);

int b = list.get(j);

int m = a * b;

if (m % 14 == 0) {

System.out.println(m);

return;

}

}

}

}

}

f = open('27-B_2.txt') # от­кры­ва­ем файл

a = [int(line) for line in f] # создаём спи­сок, i-ый эле­мент ко­то­ро­го яв­ля­ет­ся чис­лом, по­лу­чен­ным из i-ой стро­ки

count = a.pop(0) # уби­ра­ем из спис­ка пер­вое число, обо­зна­ча­ю­щее ко­ли­че­ство эле­мен­тов в нём (но за­по­ми­ная его)

a.sort(reverse=True) # сор­ти­ру­ем спи­сок по убы­ва­нию

for i in range(count):

for j in range(count):

if i == j: # ис­хо­дя из усло­вия нам под­хо­дят толь­ко раз­ные (i, j)

continue

m = a[i] * a[j]

if m % 14 == 0:

# так как спи­сок от­сор­ти­ро­ван, про­из­ве­де­ние пер­вой удо­вле­тво­ря­ю­щей пары и будет мак­си­маль­ным

print(m)

exit(0)

f = open('27-B_2.txt')

f.readline()

a = [int(i) for i in f]

a.sort()

a = a[::-1]

max1 = 0

for i in range(0,len(a)-1):

if a[i]*a[i+1] < max1: break

for j in range(i+1,len(a)):

if (a[i]*a[j]) % 14 == 0:

max1 = max(max1,a[i]*a[j])

print(max1)

f = open('27-A_2.txt')

n = int(f.readline())

m = [int (x) for x in f]

m2 = [0]

m7 = [0]

m14 = [0]

ma = max(m)

for i in range(n):

if m[i]%14 == 0 and m[i]!= ma:

m14.append(m[i])

elif m[i]%7 == 0:

m7.append(m[i])

elif m[i]%2 == 0:

m2.append(m[i])

print(max(max(m2)*max(m7),max(m14)*ma))

a = [int(s) for s in open('27-B_2.txt')][1:]

m2 = [x for x in a if x%2 == 0 and x%7 !=0 ]

m7 = [x for x in a if x%7 == 0 and x%2 !=0 ]

m14 = [x for x in a if x%14 == 0]

if m14:

a.remove(max(m14))

ans1 = max(m2)*max(m7) if m2 and m7 else 0

ans2 = max(m14)*max(a) if m14 else 0

print(max(ans1,ans2))

f = open("27989_B.txt") # для файла A ука­жи­те его на­зва­ние

s = f.readlines()

n = int(s[0])

k = 0

k_0 = 0

k_26 = 0

k_2 = 0

k_13 = 0

for i in range(1, n + 1):

s[i] = int(s[i])

if s[i] % 26 == 0:

k_26 += 1

elif s[i] % 13 == 0:

k_13 += 1

elif s[i] % 2 == 0:

k_2 += 1

else:

k_0 += 1

k = k_26 * k_0 + k_13 * k_2 + k_26 * k_13 + k_26 * k_2 + (k_26 * (k_26 - 1)) // 2

print(k)

#Ре­ше­ние на пи­то­не, под­счет чисел с раз­ной де­ли­мо­стью:

a=[int(s) for s in open('27989_B.txt')][1:]

m2=len([x for x in a if x%2==0 and x%13!=0])

m13=len([x for x in a if x%13==0 and x%2!=0])

m26=len([x for x in a if x%26==0])

m=len(a)

print(m26*(m26-1)//2 + m26*(m-m26) + m2*m13)

#Вы­би­ра­ем числа по­сле­до­ва­тель­но­сти по оче­ре­ди и при­бав­ля­ем к счет­чи­ку пар число пар, ко­то­рое оче­ред­ное число об­ра­зу­ет с преды­ду­щи­ми:

a = [int(s) for s in open('27989_B.txt')][1:]

cnts = [0]*4

k = 0 # счет­чик ко­ли­че­ства пар

for x in a:

n = (x%2==0)*2 + (x%13==0) # n=0 - не де­лит­ся ни на 2, ни на 13.

# n=2 - де­лит­ся на 2; n=1 - де­лит­ся на 13; n=3 - де­лит­ся на 26;

if n == 3:

k += sum(cnts)

elif n != 0:

k += cnts[3-n] + cnts[3]

else: k += cnts[3]

cnts[n] += 1

print(k)

f = open("27991_B.txt") # для файла A ука­жи­те его на­зва­ние

s = f.readlines()

n = int(s[0])

max_ch = 0

max_n = 0

max_ch17 = 0

max_n17 = 0

for i in range(1, n + 1):

s[i] = int(s[i])

if s[i] % 2 == 0:

if s[i] % 17 == 0 and s[i] > max_ch17:

max_ch17 = s[i]

elif s[i] % 17 == 0 and s[i] <= max_ch17: # поиск вто­ро­го мак­си­му­ма

if s[i] > max_ch:

max_ch = s[i]

elif s[i] > max_ch:

max_ch = s[i]

elif s[i] % 2 != 0:

if s[i] % 17 == 0 and s[i] > max_n17:

max_n17 = s[i]

elif s[i] % 17 == 0 and s[i] <= max_n17:

if s[i] > max_n:

max_n = s[i]

elif s[i] > max_n:

max_n = s[i]

if max_n17 + max_n == 0 and max_ch17 + max_ch == 0:

print(0, 0)

elif max_n17 + max_n > max_ch17 + max_ch:

print(max_n17, max_n)

else:

print(max_ch17, max_ch)

f = open('27991_A.txt')

n = int(f.readline())

nums = [0]*4 # мак­си­маль­ное число в каж­дой из ка­те­го­рий (см. ниже)

pair = [0,0] # наи­луч­шая пара

for s in f:

x=int(s)

ctg = (x%17!=0)*2 + x % 2 # ctg - ка­те­го­рия (0-3):

# 0 - чет­ное, де­лит­ся на 17; 2 - чет­ное, не де­лит­ся на 17;

# 1 - не­чет­ное, де­лит­ся на 17; 3 - не­чет­ное, не де­лит­ся на 17;

second = max(nums[ctg],nums[ctg+2]) if ctg < 2 else nums[ctg-2]

if second > 0 and x + second > sum(pair):

pair = sorted([x,second],reverse=True)

nums[ctg] = max(nums[ctg],x)

print(*pair)

def func(x, y):

if len(x)>=2:

for i in y:

if (x[0]+i)%2==0 and (x[0]+i)>(x[0]+x[1]):

return (i, x[0])

elif (x[0]+i)<(x[0]+x[1]):

return (x[0], x[1])

elif len(x)==1:

for i in y:

if (x[0]+i)%2==0:

return (i, x[0])

with open("27991_B.txt") as f:

sp = sorted(map(int, f.readlines()[1:]),reverse=True)

sp_17 = [i for i in sp if i%17==0]

sp.sort(key=lambda x: x%17==0)

print(sp[:10], sp_17[:10])

print(func(sp_17, sp))

file = open('27991_A.txt')

a = sorted([int(i) for i in file][1:], reverse=True)

flag = True

for j in range(len(a)):

m = a[j]

for i in range(1, len(a)):

if (a[i] % 17) == 0 and (a[i] - m) % 2 == 0:

print(m, a[i])

flag = False

break

if flag == False:

break

f = open("28129_B.txt")

s = f.readlines()

m71 = 0

m72 = 0

m1 = 0

m2 = 0

max1 = 0

max2 = 0

for i in range(len(s)):

x = int(s[i])

if x % 7 == 0 and x % 160 == m71 % 160 and x > m71:

m71 = x

elif x % 7 == 0 and x % 160 != m71 % 160 and x > m71:

m72 = m71

m71 = x

elif (x % 7 == 0) and (x % 160 != m71 % 160) and (x > m72):

m72 = x

elif x % 7 != 0 and x % 160 == m1 % 160 and x > m1:

m1 = x

elif x % 7 != 0 and x % 160 != m1 % 160 and x > m1:

m2 = m1

m1 = x

elif x % 7 != 0 and x % 160 != m1 % 160 and x > m2:

m2 = x

if m71 == 0 and m72 == 0:

print(0, 0)

elif (m72 == 0) and (m2 == 0) and (m71 % 160 == m1 % 160):

print(0, 0)

else:

if (m71 + m72) > (max1 + max2):

max1 = m71

max2 = m72

if ((m71 + m1) > (max1 + max2)) and (m71 % 160 != m1 % 160):

max1 = m71

max2 = m1

if ((m71+m2)>(max1+max2)) and (m71 % 160 != m2 % 160):

max1 = m71

max2 = m2

if (((m72 + m1) > (max1 + max2)) and ((m72 % 160) != (m1 % 160))):

max1 = m72

max2 = m1

print(max1, max2)

f = open('28129_B.txt')

f.readline()

s = 0

b1 = 0

b2 = 0

a = [int(i) for i in f]

for i in range(len(a) - 1):

for j in range(i+1, len(a)):

if a[i] % 160 != a[j] % 160 and (a[i] % 7 == 0 or a[j] % 7 == 0):

if a[i] + a[j] > s:

s = a[i] + a[j]

b1 = a[i]

b2 = a[j]

print(b1,b2)

a = sorted([int(s) for s in open('28129_B.txt')][1:],reverse=True)

r=[[] for _ in range(160)]

for x in a: r[x%160].append(x) # рас­пре­де­ля­ем по остат­кам

ans = [[0,0]] # если не най­дем дру­гих ре­ше­ний

for i in range(160):

m7 = [x for x in r[i] if x%7==0]

if m7:

dop=[r[j][0] for j in range(160) if j!=i and r[j]]

if dop: ans.append(sorted([m7[0],max(dop)]))

print(*max(ans,key=lambda x: sum(x)))