#include<iostream>
#include<queue>
using namespace std;
void Zhang() {
    int key = 11;
    int a,l = 1,r = 100;
    while (l < r) {
        int mid = (l + r / 2);
        if (a == key) {
            cout << mid << endl;
            exit(0);
        }
        else if (a < key) {
            l = mid + 1;
        }
        else {
            r = mid;
        }
    }
}
void Zheng() {
    queue <int> q;
    int x = 0,y = 0;
    bool v[100][100];
    v[x][y] = 1;
    while (! q.empty()) {
        int top = q.front();
        q.pop();
        for (int i = 1;i <= 10;i++) {
            int xx = 1;
            int yy = 1;
            if (!xx) {
                v[xx][yy] = 1;
            }
        }
    }
}
void Biao() {
    long double a,b;
    cin >> a >> b;
    cout << a + b << endl;
}
void Do() {
    int a,b,c;
    cin >> a >> b >> c;
    cout << b << endl;
}
int main() {
    Do();
    return 0;
    Zhang(); Zheng(); Biao();
}