Bead Pattern Generation

You are given an integer \(n\) that denotes the length of a bead pattern. Your task is to generate a bead pattern of length \(n\) such that no two adjacent beads are of the same color. In order to minimize the use of blue beads (represented by 'b'), the optimal pattern alternates between red ('r') and green ('g').

In other words, you should use only 'r' and 'g' in your output, starting with 'r'. For instance, if \(n=3\), a valid bead pattern would be "rgr".

inputFormat

The input consists of a single integer \(n\) (\(1 \leq n \leq 10^5\)), which denotes the length of the bead pattern.

outputFormat

Output a single line containing the bead pattern of length \(n\) that satisfies the given conditions.

1

r