#include <bits/stdc++.h>
using namespace std;
const long long int N = 1e9 + 7;
;
const int N2 = 1e9;
void _print(long long t) { cout << t; }
void _print(int t) { cout << t; }
void _print(string t) { cout << t; }
void _print(char t) { cout << t; }
void _print(long double t) { cout << t; }
void _print(double t) { cout << t; }
void _print(unsigned long long t) { cout << t; }
template <class T, class V>
void _print(pair<T, V> p);
template <class T>
void _print(vector<T> v);
template <class T>
void _print(set<T> v);
template <class T, class V>
void _print(map<T, V> v);
template <class T>
void _print(multiset<T> v);
template <class T, class V>
void _print(pair<T, V> p) {
  cout << "{";
  _print(p.ff);
  cout << ",";
  _print(p.ss);
  cout << "}";
}
template <class T>
void _print(vector<T> v) {
  cout << "[ ";
  for (T i : v) {
    _print(i);
    cout << " ";
  }
  cout << "]";
}
template <class T>
void _print(set<T> v) {
  cout << "[ ";
  for (T i : v) {
    _print(i);
    cout << " ";
  }
  cout << "]";
}
template <class T>
void _print(multiset<T> v) {
  cout << "[ ";
  for (T i : v) {
    _print(i);
    cout << " ";
  }
  cout << "]";
}
template <class T, class V>
void _print(map<T, V> v) {
  cout << "[ ";
  for (auto i : v) {
    _print(i);
    cout << " ";
  }
  cout << "]";
}
long long binpow(long long a, long long b) {
  long long res = 1;
  while (b > 0) {
    if (b & 1) {
      res = (res * a) % 10;
    }
    a = (a * a) % 10;
    b >>= 1;
  }
  return res;
}
void solve() {
  string s = "qwertyuiopasdfghjkl;zxcvbnm,./";
  char ch;
  cin >> ch;
  string p, ans;
  cin >> p;
  for (int i = 0; i < p.length(); i++) {
    if (ch == 'R') {
      for (int j = 0; j < s.length(); j++) {
        if (s[j] == p[i]) {
          ans.push_back(s[j - 1]);
        }
      }
    } else {
      for (int j = 0; j < s.length(); j++) {
        if (s[j] == p[i]) {
          ans.push_back(s[j + 1]);
        }
      }
    }
  }
  cout << ans;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  int t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
