#include <bits/stdc++.h>
using namespace std;

#define forn(i,m,n) for(int i=m;i<n;i++)
#define vv vector
#define vi vv<int>
#define ii pair<int,int>
#define vii vv<ii>
#define mp make_pair
#define pb push_back
#define PI 3.141592653589
#define ll long long
#define pll pair<ll,ll>
#define vl vv<ll>
#define ff first
#define ss second
#define MOD 1000000007


bool is_prime[1000001];
vi prime;
void sieve(int n)
{
	memset(is_prime,true,sizeof(is_prime));
	for(int i=2;i*i<=n;i++)
	{
		if(is_prime[i])
		{
			for(int j=i*i;j<=n;j+=i)
			{
				is_prime[j]=false;
			}
		}
	}
	forn(i,2,n+1)
	{
		if(is_prime[i])
			prime.pb(i);
	}
}

ll ex(ll a,ll b)
{
    ll res=1;
    a=a%MOD;
    while(b)
    {
        if(b%2){res=(res*a)%MOD;b--;}
        b/=2;
        a=(a*a)%MOD;
    }
    return res;
}

ll fermat_inv(ll a){ return ex(a,MOD-2); }
ll max(ll a,ll b){ return a>b?a:b; }
ll min(ll a,ll b){ return a<b?a:b; }

int gcd(int a,int b) { return (a%b==0)?b:gcd(b,a%b); }


int main()
{
    ios_base::sync_with_stdio(false);
        cin.tie(NULL);
        /*#ifndef ONLINE_JUDGE
            freopen("input.txt", "r", stdin);
            freopen("output.txt", "w", stdout);
        #endif*/
    //sieve(1000000);

    int te=1;
    //cin>>te;
    while(te--)
    {
        char s,t;
        cin>>s>>t;
        if(t>='A'&&t<='C')
            cout<<t;
        else
        {   if(s=='Y')
                cout<<(char)(t-'a'+'A');
            else
                cout<<t;
        }
    }
}

#include <bits/stdc++.h>
#include <iostream>
#include <stack>
using namespace std;
int main() {
 int A,B;
 cin >> A >> B;
 cout << 2*A + 100 - B;
}