#include <bits/stdc++.h>
using namespace std;
long long power(long long x, long long y) {
  long long res = 1;
  x = x % 1000000007;
  while (y > 0) {
    if (y & 1) res = (res * x) % 1000000007;
    y = y >> 1;
    x = (x * x) % 1000000007;
  }
  return res;
}
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
bool isprime(long long n) {
  bool flag;
  if (n == 2) return true;
  for (long long i = 2; i * i <= n; i++) {
    if (n % i == 0) {
      return false;
    }
  }
  return true;
}
vector<long long> prim;
void seive_prime(long long n) {
  vector<bool> flag(n, true);
  for (int i = 2; i * i < n; i++) {
    if (flag[i]) {
      for (int j = i * i; j < n; j += i) {
        flag[j] = false;
      }
    }
  }
  for (int i = 2; i < n; i++) {
    if (flag[i]) prim.push_back(i);
  }
}
int issort(vector<long long> temp) {
  for (int i = 1; i < temp.size(); i++) {
    if (temp[i] < temp[i - 1]) return 0;
  }
  return 1;
}
void fun(char *s) {
  s++;
  s = NULL;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  string ip, st = "qwertyuiopasdfghjkl;zxcvbnm,./";
  map<char, long long> mp;
  for (long long i = 0; i < st.size(); i++) mp[st[i]] = i;
  char d;
  cin >> d;
  cin >> ip;
  long long key;
  if (d == 'R')
    key = -1;
  else
    key = 1;
  for (auto k : ip) {
    cout << st[mp[k] + key];
  }
}
