import sys
from collections import deque

# 10845번처럼 list로 풀면 시간초과, deque 사용 필요

def size(queue):
    return len(queue)

def empty(queue):
    if len(queue)==0:
        return 1
    else:
        return 0

def push(queue, x):
    queue.append(x)

def pop(queue):
    if empty(queue)==0:
        return queue.popleft()
    else:
        return -1

def front(queue):
    if empty(queue)==0:
        return queue[0]
    else:
        return -1

def back(queue):
    if empty(queue)==0:
        return queue[-1]
    else:
        return -1

dq = deque()
n = int(input())
for _ in range(n):
    input_s = sys.stdin.readline().rstrip().split()
    order = input_s[0]
    if order == 'push':
        push(dq, input_s[1])
    elif order == 'pop':
        print(pop(dq))
    elif order == 'size':
        print(size(dq))
    elif order == 'empty':
        print(empty(dq))
    elif order == 'front':
        print(front(dq))
    else:
        print(back(dq))

n, letters = int(input()), input()
numbers = [ord(letter) - 96 for letter in letters]
nm_sum = 0
for i in range(n):
    nm_sum += numbers[i]*(31**i)
print(nm_sum % 1234567891)

import sys

def size(queue):
    return len(queue)

def empty(queue):
    if len(queue)==0:
        return 1
    else:
        return 0

def push(queue, x):
    queue.append(x)

def pop(queue):
    if empty(queue)==0:
        return queue.pop(0)
    else:
        return -1

def front(queue):
    if empty(queue)==0:
        return queue[0]
    else:
        return -1

def back(queue):
    if empty(queue)==0:
        return queue[-1]
    else:
        return -1

que = []
n = int(input())
for _ in range(n):
    input_s = sys.stdin.readline().rstrip().split()
    order = input_s[0]
    if order == 'push':
        push(que, input_s[1])
    elif order == 'pop':
        print(pop(que))
    elif order == 'size':
        print(size(que))
    elif order == 'empty':
        print(empty(que))
    elif order == 'front':
        print(front(que))
    else:
        print(back(que))

import sys

def size(stack):
    return len(stack)

def empty(stack):
    if len(stack)==0:
        return 1
    else:
        return 0

def push(stack, x):
    stack.append(x)

def pop(stack):
    if empty(stack)==0:
        return stack.pop()
    else:
        return -1

def top(stack):
    if empty(stack)==0:
        return stack[len(stack)-1]
    else:
        return -1

stk = []
n = int(input())
for _ in range(n):
    input_s = sys.stdin.readline().rstrip().split()
    order = input_s[0]
    if order == 'push':
        push(stk, input_s[1])
    elif order == 'pop':
        print(pop(stk))
    elif order == 'size':
        print(size(stk))
    elif order == 'empty':
        print(empty(stk))
    else:
        print(top(stk))

import sys
n = int(input())
stick_list = list(int(sys.stdin.readline()) for _ in range(n))

right = stick_list.pop()
cnt = 1

for i in range(len(stick_list)-1,-1,-1):
    now = stick_list.pop()
    if now > right:
        cnt += 1
        right = now
    else:
        pass

print(cnt)

# stack 구현 참고한 풀이 ↓
import sys
stick = sys.stdin.readline

def size(stack):
    return len(stack)

def empty(stack):
    if len(stack)==0:
        return 1
    else:
        return 0

def push(stack, x):
    stack.append(x)

def pop(stack):
    if empty(stack)==0:
        a = stack.pop()
        return a
    else:
        return -1

def top(stack):
    if empty(stack)==0:
        return stack[len(stack)-1]
    else:
        return -1

n = int(input())
stk = list()
max_s, cnt = 0,0

for _ in range(n):
    push(stk, int(stick))

for i in range(len(stk)-1, -1, -1):
    if stk[i] > max_s:
        cnt += 1
        max_s = stk[i]
print(cnt)

def make_list(empty): # 5줄씩 입력 받아 list 구성
    for _ in range(5):
        empty += list(map(int, input().split()))
    return empty

board = make_list([])
removed = make_list([])
idx = 0

while True:
    board[board.index(removed[idx])] = 0 # 호명되는 숫자는 0으로 바꾸기
    idx += 1

    horz = [board[i:i + 5] for i in range(0, 25, 5)] # 가로 1줄 = 1개의 원소인 len(5)짜리 list
    vert = [[horz[i][j] for i in range(5)] for j in range(5)] # 세로 1줄 = 1개의 원소인 len(5)짜리 list
    diagonal_1 = [horz[i][i] for i in range(5)] # \방향 대각선
    diagonal_2 = [horz[i][j] for i,j in zip(range(5), range(4,-1,-1))] # / 방향 대각선

    bingo = horz.count([0,0,0,0,0]) + vert.count([0,0,0,0,0]) # 가로 or 세로줄 확인
    if sum(diagonal_1) == 0: # 대각선 확인
        bingo += 1
    if sum(diagonal_2) == 0:
        bingo += 1

    if bingo >= 3: # 한번에 2줄이 지워질 수도 있으니 == 이 아닌 >=
        print(idx)
        break

import sys # 입력값이 많을 경우 input() 보단 sys.stdin.readline()
n = int(input())
L = sorted(list(int(sys.stdin.readline()) for _ in range(n)))

print(round(sum(L)/n))
print( L[(n-1)//2] )

from collections import Counter
L_cnt=Counter(L).most_common()
if n > 1: # n==1 이면 1개 입력된 값만 출력하면 되므로 조건 분기 필요
    if L_cnt[0][1] == L_cnt[1][1]:print(L_cnt[1][0]) # count가 같은게 여러개면 2번째 값 출력
    else : print(L_cnt[0][0]) # count most가 1개면 바로 출력
else : print(L[0]) 

print(max(L)-min(L))

# dict.fromkeys() : 180ms
n = input()
n_dict = dict.fromkeys(input().split() , 0).keys()
m = input()
m_list = input().split()

for e in m_list:
    print(1 if e in n_dict else 0)

# set : 168ms
n = int(input())
n_list = set(input().split())
m = int(input())
m_list = input().split()

for e in m_list:
    print(1 if e in n_list else 0)

db, bd = map(int, input().split())
db_dict = {}
db_list = sorted(list(input() for _ in range(db)))
for i in db_list:
    db_dict[i] = 0

for j in range(bd):
    p = input()
    if p in db_dict:
        db_dict[p] = 1

print(sum(db_dict.values()))
for k,v in db_dict.items():
    if v == 1: print(k)

# 풀이 1 : 문자열 replace 방식
n = input()
ln = len(n)
n_list = []

if ln % 3 ==0: # 문자열을 일정 길이로 나누는 건 아래처럼 map으로 하는 것도 가능
    pass
else:
    n = '0'*(3-(ln%3)) + n

for i in range(0, ln, 3):
    a = n[i:i+3]
    if a in ['000','001']:
        b = oct(int(a.replace('00','0b'),2)).replace('0o','')
        n_list.append(b)
    elif a in ['010','011']:
        b = oct(int('0b' + a[1:], 2)).replace('0o','')
        n_list.append(b)
    else:
        b = oct(int('0b' + a,2)).replace('0o','')
        n_list.append(b)
print(int(''.join(n_list)))

# 풀이 2 : dictionary 이용
dic_8 = {'000':'0', '001':'1', '010':'2', '011':'3','100':'4','101':'5','110':'6','111':'7'}
n = input()
ln = len(n)
if ln % 3 ==0:
    pass
else:
    n = '0'*(3-(ln%3)) + n

n_list = list(map(''.join, zip(*[iter(n)]*3)))
ans = [dic_8[e] for e in n_list]
print(int(''.join(ans)))

n = int(input())
bg_paper = [[0]*100 for _ in range(100)]
area = 0

for _ in range(n):
    x,y = map(int, input().split())
    for i in range(x, x+10):
        for j in range(y, y+10):
            bg_paper[i][j] = 1

for line in bg_paper:
    area += sum(line)
print(area)

겹치는 부분을 찾아서 빼기보다는, 그때 그때 면적을 입력받아 해당 부분의 영역을 0 -> 1로 바꿔주는 풀이

while True:
    in_value = input()
    if in_value != '0 0 0':
        L = sorted(tuple(map(int, in_value.split())))
        if L[-1]**2 == (L[0]**2 + L[1]**2):
            print('right')
        else:
            print('wrong')
    else:
        break

n, m, k = map(int, input().split())
cnt = 0
while n >= 0 and m >= 0 and n + m >= k:
    n -= 2
    m -= 1
    cnt += 1
print(cnt - 1)