#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = 1e9 + 10;
const ll INFL = 4e18;

int main() {
    int N;
    cin >> N;

    int M = 6;
    vector<int> A = {1, 6, 30, 180, 360, 720};
    string S = ".oRSMC";

    vector<int> dp(N + 1, INF);
    dp[0] = 0;
    for (int i = 0; i < N; i++) {
        for (int x : A) {
            if (i + x <= N) {
                dp[i + x] = min(dp[i + x], dp[i] + 1);
            }
        }
    }

    string ans;
    int now = N;
    while (now > 0) {
        for (int i = 0; i < M; i++) {
            if (dp[now - A[i]] == dp[now] - 1) {
                ans.push_back(S[i]);
                now -= A[i];
                break;
            }
        }
    }

    reverse(ans.begin(), ans.end());
    cout << ans << endl;
}