#include <bits/stdc++.h>
using namespace std;
template <class T>
inline T bigmod(T b, T p, T M) {
  long long int ret = 1;
  for (; p > 0; p >>= 1) {
    if (p & 1) ret = (ret * b) % M;
    b = (b * b) % M;
  }
  return (T)ret;
}
template <class T>
inline T modinverse(T a, T M) {
  return bigmod(a, M - 2, M);
}
template <class T>
inline T gcd(T a, T b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
template <class T>
inline T lcm(T a, T b) {
  return a * b / gcd<T>(a, b);
}
template <class T>
inline T power(T b, T p) {
  long long int x = 1;
  while (p--) x *= b;
  return x;
}
const long long int mod = 1e9 + 7;
const int siz = 202;
string save[3], s;
char ch;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  ;
  save[0] = "qwertyuiop";
  save[1] = "asdfghjkl;";
  save[2] = "zxcvbnm,./";
  cin >> ch;
  cin >> s;
  for (int i = 0; i < s.size(); i++) {
    for (int j = 0; j < 3; j++) {
      for (int k = 0; k < save[j].size(); k++) {
        if (save[j][k] == s[i]) {
          if (ch == 'L')
            cout << save[j][k + 1];
          else
            cout << save[j][k - 1];
        }
      }
    }
  }
  cout << endl;
  return 0;
}
