#include <bits/stdc++.h>
using namespace std;
const double ME = 2.71828;
const int N = 3e5 + 20;
const int inf = (int)10e18;
const double pi = 3.141592653;
void LOSER() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
}
void file() {}
long long gcd(long long a, long long b) { return (!b) ? a : gcd(b, a % b); }
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
long long Fib_recur(long long n) {
  vector<long long> v(n + 5, 0);
  v[1] = 0;
  v[2] = 1;
  for (int i = int(3); i <= int(n); i++) v[i] = v[i - 1] + v[i - 2];
  return v[n];
}
bool isprime(int n) {
  if (n == 1)
    return false;
  else if ((!(n & 1)) && n != 2)
    return false;
  else {
    for (int i = 2; i <= sqrt(n); i++) {
      if (n % i == 0) return false;
    }
    return true;
  }
}
void Solve() {
  string s = "ROYGBIV";
  string ss[] = {" ", "G", "GB", "YBG", "YBGI", "YBGIV", "YBGIVB"};
  long long n;
  cin >> n;
  long long seven = n / 7;
  for (int i = 0; i < seven; i++) cout << s;
  if (n % 7 == 0) return;
  cout << ss[n % 7];
}
int main() {
  file();
  LOSER();
  Solve();
}
