Problem: The Easter Rabbit laid n eggs in a circle and is about to paint them. 

Each egg should be painted one color out of 7: red, orange, yellow, green, blue, indigo or violet. Also, the following conditions should be satisfied:

  * Each of the seven colors should be used to paint at least one egg. 
  * Any four eggs lying sequentially should be painted different colors. 



Help the Easter Rabbit paint the eggs in the required manner. We know that it is always possible.

Input

The only line contains an integer n — the amount of eggs (7 ≤ n ≤ 100).

Output

Print one line consisting of n characters. The i-th character should describe the color of the i-th egg in the order they lie in the circle. The colors should be represented as follows: "R" stands for red, "O" stands for orange, "Y" stands for yellow, "G" stands for green, "B" stands for blue, "I" stands for indigo, "V" stands for violet.

If there are several answers, print any of them.

Examples

Input

8


Output

ROYGRBIV


Input

13


Output

ROYGBIVGBIVYG

Note

The way the eggs will be painted in the first sample is shown on the picture: 

<image>

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
namespace NT {
int mod = 1e9 + 7;
vector<int> fact;
vector<int> inv_fact;
inline int norm(long long a) {
  a %= mod;
  if (a < 0) a += mod;
  return a;
}
inline bool is_ok(long long x) { return (0 <= x and x < mod); }
inline int add(long long a, long long b) {
  if (not is_ok(a)) a = norm(a);
  if (not is_ok(b)) b = norm(b);
  long long ret = a + b;
  if (ret >= mod) ret -= mod;
  return ret;
}
inline int sub(long long a, long long b) {
  if (not is_ok(a)) a = norm(a);
  if (not is_ok(b)) b = norm(b);
  long long ret = a - b;
  if (ret < 0) ret += mod;
  return ret;
}
inline int mul(long long a, long long b) {
  if (not is_ok(a)) a = norm(a);
  if (not is_ok(b)) b = norm(b);
  return (a * b) % mod;
}
int bin_pow(long long a, long long b) {
  int ret = 1;
  while (b) {
    if (b & 1) ret = mul(ret, a);
    a = mul(a, a);
    b >>= 1;
  }
  return ret;
}
int inv(long long a) { return bin_pow(a, mod - 2); }
void preprocess_factorial(int n) {
  fact.resize(n + 1);
  inv_fact.resize(n + 1);
  fact[0] = 1;
  for (int i = 1; i <= n; i++) fact[i] = mul(fact[i - 1], i);
  inv_fact[n] = inv(fact[n]);
  for (int i = n - 1; i >= 0; i--) inv_fact[i] = mul(inv_fact[i + 1], i + 1);
}
int comb(int a, int b) {
  if (a < b) return 0;
  return mul(mul(fact[a], inv_fact[b]), inv_fact[a - b]);
}
}  // namespace NT
void solve() {
  int n;
  cin >> n;
  string a = "ROYGBIV", b = "GBIV";
  cout << a;
  for (int i = 0; i < n - 7; i++) {
    cout << b[i % 4];
  }
  cout << '\n';
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int t = 1;
  while (t--) solve();
}