#include<algorithm>
#include<iostream>
#include<stdio.h>
#include<iostream>
#include<stdio.h>
#include<vector>
#include<set>
#include<string>
#include<iomanip>
#include<queue>
#include<functional>
#include<cmath>
#include<map>
#include<tuple>
#include <numeric>
#define rep(i,n) for(int i=0; i<(int)n; i++)//n回繰り返す
#define rrep(i,n)for(int i=n-1;i>=0;i--)
#define REP(i,n) for (int i = 1; i <= (int)n; i++)//i=1からi=nまで
#define RREP(i,n)for(int i=n;i>=1;i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
using graph = vector<vector<int>>;
const ll mod = pow(10, 9) + 7;
const int INF = 1e9;
const ll LINF = 1e18;
const double pi = 3.14159265358979323846;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

int main() {
    char s, t;
    cin >> s >> t;
    if (s == 'Y') {
        t = t - ('a' - 'A');
        cout << t  << endl;
    }
    else {
        cout << t << endl;
    }
}




#include<bits/stdc++.h>
typedef long long int ll;
using namespace std;
int main()
{
  char S,T;
  cin>>S>>T;
  if(S=='Y')
     {
       if(T=='a')
         cout<<"A";
       else if(T=='b')
         cout<<"B";
       else if(T=='c')
         cout<<"C";
       else
         cout<<T;
     }
  else
    cout<<T;
  return 0;
}