#include <iostream>
using namespace std;
int main() {
    long long a, b;
    while(cin >> a >> b)
    {
        cout << a + b << endl;
    }
    return 0;
}

import sys
while True:
    s = sys.stdin.readline()
    if not s:
        break
    a, b = map(int, s.split(" "))
    print(a + b)

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
    int n;
    cin >> n;
    vector<int>nums(n);
    for(int i = 0; i < n; i += 1)
    {
        cin >> nums[i];
    }
    sort(nums.begin(),nums.end(),[&](int a, int b){return a > b;});
    long long ans = 0;
    for(int i = 0; i < n; i += 2)
    {
        ans += nums[i];
    }
    cout << ans << endl;
}

n = int(input())
nums = list(map(int, input().split(" ")))
nums.sort()
print(sum(nums[i] for i in range(n - 1, -1, -2)))

#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<unordered_map>
using namespace std;
int main()
{
    string s;
    getline(cin, s);
    unordered_map<char, int>mp;
    int mx = 0;
    for(auto c:s)
    {
        if(c >= 'a' && c <= 'z' || c >= 'A' && c <= 'Z')
        {
            mp[c] += 1;
            mx = max(mp[c], mx);
        }
    }
    vector<char>res;
    for(auto x:mp)
    {
        if(x.second == mx) res.push_back(x.first);
    }
    sort(res.begin(), res.end());
    cout << res[0] << endl;
    return 0;
}

from collections import defaultdict
s = input()
mp = defaultdict(int)
for x in s:
    if 'a' <= x <= 'z' or 'A' <= x <= 'Z':
        mp[x] += 1
mx = max(mp.values())
res = []
for key in mp.keys():
    if mp[key] == mx:
        res.append(key)
res.sort()
print(res[0])

#include <iostream>
using namespace std;
int main() {
    long long i;
    cin >> i;
    cout << (i <= 2 ? "YES" : "NO") << endl;
    return 0;
}

i = int(input())
print("YES" if i <= 2 else "NO")