Round # sol

#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;

#define int long long
#define double long double
#define _FastIO ios_base::sync_with_stdio(0); cin.tie(0)
#define F first
#define S second

signed main()
{
    _FastIO;
    /*
    // A
    int a , b;
    cin >> a >> b;
    cout << max({a + b , a - b , a * b}) << '\n';
    */

    // B
    /*
    int n;
    cin >> n;
    if(n / 100 == n % 10)
        cout << "Yes";
    else
        cout << "No";
    */
    /*
    string s;
    cin >> s;
    int n = s.size();
    /*
    for(int i = 0; i + i < n; i++){
        if(s[i] != s[n - i - 1]){
            cout << "No;
            return 0;
        }
    }
    cout << "Yes";
    */
    /*
    string h = s;
    reverse(s.begin() , s.end());
    if(h == s)
        cout << "Yes";
    else
        cout << "No";
    */

    /*
    // C
    int a[4];
    for(int i = 0; i < 4; i++)
        cin >> a[i];

    sort(a , a + 4);
    if(a[0] == 1 && a[1] == 4 && a[2] == 7 && a[3] == 9)
        cout << "YES";
    else
        cout << "NO";
    */
    /*
    // D
    string s = "3.1415926535897932384626433832795028841971693993751058209749445923078164062862089986280348253421170679";
    int n;
    cin >> n;
    cout << s.substr(0 , n + 2);
    */
    /*
    // E
    string a , b , c;
    cin >> a >> b >> c;
    cout << a[0] << b[1] << c[2];
    */
    /*
    // F
    string s;
    cin >> s;
    if(s.find("AC") < s.size())
        cout << "Yes";
    else
        cout << "No";
    */
    /*
    // G
    string s;
    cin >> s;
    bool ok = 0; , ans = 0;
    for(char i : s){
        if(i == 'C')
            ok = 1;
        if(i == 'F' && ok)
            ans = 1;
    }
    cout << (ans ? "Yes" : "No");
    if(ans)
        cout << "Yes";
    else
        cout << "No";
    */
    /*
    // H
    int n , m;
    cin >> n >> m;
    string s;
    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= m; j++){
            cin >> s;
            if(s == "snuke")
                cout << char('A' + j - 1) << i;
        }
    }
    */

    // 1 3 5 7 9 11
    // 4 12 20
    // 16 20
    // 36

    // 1 3 5 7 9
    // 1 8 16
    // 1 24

    // 2 4
    // 6

    // 2 4 6
    // 10 6
    // 16

    /*
    // I
    int n , tek = 0, x;
    cin >> n;
    while(n--){
        cin >> x;
        tek += x % 2;
    }
    if(tek % 2)
        cout << "NO";
    else
        cout << "YES";
    */
    /*
    int n , x;
    cin >> n;
    int a[n + 5];
    for(int i = 1; i <= n; i++){
        cin >> x;
        a[x] = i; // x ededin movqeyi
    }
    for(int i = 1; i <= n; i++){
        cout << a[i] << " ";
    }
    cout << '\n';
    */


    // b * 5 * 2 = b0

    // A0B*5

    //  1 15
    // 175 * 2 = 350

    // 1075 = 2150
    /*
    // K
    int a , b;
    cin >> a >> b;
    cout << a << "0" << b * 5;
    */


}