For a better world

#include <iostream>

using namespace std;

int main(void)
{
	
	char character;
	
	cin >> character;
	int integer(character);
	
	cout << integer << endl;
	
	return 0;
}

#include <iostream>
using namespace std;

int main(void)
{
	int N = 0;
	int i = 2;
	
	cin >> N;
	
	if (N>=1 and N<=10000000)
	{
		while (true)
		{
			if(N % i == 0) // 72 % 2 == 0, 
			{
				cout << i << endl; // 2 
				N = N / i; // 36 = 72 / 2
				i = 1; 
			}	
			i = i + 1;
			
			if (N==1)
			{
				break;
			}
		}
	}
	
	return 0;
	
}

import sys
input = sys.stdin.readline

N = int(input())
coordinates = []
for _ in range(N):
    coordinates.append(list(map(int, input().split())))

coordinates.sort(key=lambda x: (x[1], x[0]))
for i in coordinates:
    print (*i)

import sys 
input = sys.stdin.readline

N = int(input())
coordinates = []

for _ in range(N):
    coordinates.append(list(map(int, input().split())))

coordinates.sort(key=lambda x: (x[0], x[1]))

for i in coordinates:
    print (*i)

import sys
input = sys.stdin.readline

N = int(input())

product = []
for _ in range(N):
    product.append(int(input()))

product.sort(reverse=True)

cost = 0
buffer = []
for i in range(len(product)):
    buffer.append(product[i])
    if len(buffer) == 3:
        cost += buffer[0] + buffer[1]
        buffer = []
    
    if i == len(product)-1:
        cost += sum(buffer)

print (cost)

N = int(input())
lines = list(map(int, input().split()))
lines = sorted(lines)
_sum = 0
times = []
for num in lines:
    _sum = _sum + num
    times.append(_sum)
print (sum(times))

import sys 
from math import factorial

if __name__ == "__main__":
    input = sys.stdin.readline
    N, K = list(map(int, input().split()))
    result = factorial(N) // (factorial(K) * factorial(N-K))
    print (result % 10007)

import sys
from math import factorial

def solution_manual(n):
    if n == 0:
        return 1

    if n == 1:
        return 1
    
    return n * solution_manual(n-1)

if __name__ == "__main__":
    input = sys.stdin.readline

    N, K = list(map(int, input().split()))
    
    # 1. library
    #print (factorial(N) // (factorial(K) * factorial(N-K)))

    # 2. solution_manual
    print (solution_manual(N) // (solution_manual(K) * solution_manual(N-K)))

import sys
input = sys.stdin.readline
N, K = map(int, input().split())
cnt = 0
coins = []
for _ in range(N):
    coins.append(int(input()))

coins.reverse()
_sum = 0

for coin in coins:
    if coin > K:
        continue
    
    while True:
        _sum = _sum + coin
        cnt = cnt + 1
        if _sum > K:
            _sum = _sum - coin
            cnt = cnt -1
            break
    if _sum == K:
        print(cnt)
        break

#include <iostream>

using namespace std;

int main(void)
{
	int T = 0;
	int A = 0;
	int B = 0;
	
	cin >> T;
	
	for (int i=0; i<T; i++)
	{
		cin >> A >> B;
		if (A>0 and B<10)
		{
			cout << "Case #" << i+1 << ": " << A << " + " << B << " = " << A+B << endl;
		}
	}
	
	return 0;
}