#include <bits/stdc++.h>
using namespace std;
long long const INF = INT_MAX;
const long long MOD = 998244353;
const long long N = 4e5 + 1;
void SpeedForce() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
}
int simple(int n) {
  int i, sq;
  if (n % 2 == 0) {
    return 0;
  }
  sq = (int)sqrt(n);
  for (i = 3; i <= sq; i++) {
    if ((n % i) == 0) {
      return 0;
    }
  }
  return 1;
}
long long gcd(long long a, long long b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
long long is_prime(long long n) {
  if (n <= 1 || n > 3 && (n % 2 == 0 || n % 3 == 0)) return 0;
  for (long long i = 5, t = 2; i * i <= n; i += t, t = 6 - t)
    if (n % i == 0) return 0;
  return 1;
}
long long binpow(long long x, long long n) {
  long long res = 1;
  while (n) {
    if (n % 2) {
      res = (res * x) % MOD;
    }
    x = (x * x) % MOD;
    n /= 2;
  }
  return res;
}
void solve() {
  int n;
  cin >> n;
  string s(n, ' ');
  for (int i = 0; i < n; ++i) {
    if (i % 4 == 0) s[i] = 'R';
    if (i % 4 == 1) s[i] = 'O';
    if (i % 4 == 2) s[i] = 'Y';
    if (i % 4 == 3) s[i] = 'G';
  }
  s[s.size() - 1] = 'V';
  s[s.size() - 2] = 'I';
  s[s.size() - 3] = 'B';
  cout << s;
}
int main() {
  SpeedForce();
  int T = 1;
  while (T--) {
    solve();
  }
}
