#include <bits/stdc++.h>
using namespace std;
int n, ans[105], vis[7];
char col[7] = {'R', 'O', 'Y', 'G', 'B', 'I', 'V'};
bool dfs(int cur) {
  if (cur >= n) {
    if (ans[cur - 1] == ans[0] || ans[cur - 1] == ans[1] ||
        ans[cur - 1] == ans[2] || ans[cur - 2] == ans[0] ||
        ans[cur - 2] == ans[1] || ans[cur - 3] == ans[0] || vis[0] == 0 ||
        vis[1] == 0 || vis[2] == 0 || vis[3] == 0 || vis[4] == 0 ||
        vis[5] == 0 || vis[6] == 0)
      return true;
    else {
      for (int i = 0; i < cur; i++) printf("%c", col[ans[i]]);
      return false;
    }
  }
  for (int i = 0; i < 7; i++) {
    if (ans[cur - 1] == i || ans[cur - 2] == i || ans[cur - 3] == i) continue;
    vis[i]++;
    ans[cur] = i;
    if (!dfs(cur + 1)) return false;
    vis[i]--;
  }
  return true;
}
int main() {
  scanf("%d", &n);
  memset(ans, 0, sizeof(ans));
  memset(vis, 0, sizeof(vis));
  ans[0] = 0, vis[0] = 1;
  ans[1] = 1, vis[1] = 1;
  ans[2] = 2, vis[2] = 1;
  dfs(3);
  return 0;
}
