#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)

void solve() {
  ll n;
  cin >> n;
  vector<pair<char, ll>> a = {
      {'.', 1}, {'o', 6}, {'R', 30}, {'S', 180}, {'M', 360}, {'C', 720},
  };
  auto [c, now] = a.back();
  a.pop_back();
  while (n) {
    if (n < now) {
      tie(c, now) = a.back();
      a.pop_back();
      continue;
    }
    cout << c;
    n -= now;
  }
  cout << '\n';
}

int main() {
  std::cin.tie(nullptr);
  std::ios_base::sync_with_stdio(false);
  int T = 1;
  for (int t = 0; t < T; t++) {
    solve();
  }
  return 0;
}