Nothing is eternal in the world, Kostya understood it on the 7-th of January when he saw partially dead four-color garland.
Now he has a goal to replace dead light bulbs, however he doesn't know how many light bulbs for each color are required. It is guaranteed that for each of four colors at least one light is working.
It is known that the garland contains light bulbs of four colors: red, blue, yellow and green. The garland is made as follows: if you take any four consecutive light bulbs then there will not be light bulbs with the same color among them. For example, the garland can look like "_RYBGRYBGRY_", "_YBGRYBGRYBG_", "_BGRYB_", but can not look like "_BGRYG_", "_YBGRYBYGR_" or "_BGYBGY_". Letters denote colors: '_R_' — red, '_B_' — blue, '_Y_' — yellow, '_G_' — green.
Using the information that for each color at least one light bulb still works count the number of dead light bulbs of each four colors.
## Input
The first and the only line contains the string _s_ (4 ≤ |_s_| ≤ 100), which describes the garland, the _i_\-th symbol of which describes the color of the _i_\-th light bulb in the order from the beginning of garland:
* '_R_' — the light bulb is red,
* '_B_' — the light bulb is blue,
* '_Y_' — the light bulb is yellow,
* '_G_' — the light bulb is green,
* '_!_' — the light bulb is dead.
The string _s_ can not contain other symbols except those five which were described.
It is guaranteed that in the given string at least once there is each of four letters '_R_', '_B_', '_Y_' and '_G_'.
It is guaranteed that the string _s_ is correct garland with some blown light bulbs, it means that for example the line "_GRBY!!!B_" can not be in the input data.
## Output
In the only line print four integers _k__r_, _k__b_, _k__y_, _k__g_ — the number of dead light bulbs of red, blue, yellow and green colors accordingly.
[samples]
## Note
In the first example there are no dead light bulbs.
In the second example it is obvious that one blue bulb is blown, because it could not be light bulbs of other colors on its place according to the statements.
世界上没有什么是永恒的，Kostya 在 1 月 7 日看到一串部分熄灭的四色彩灯时明白了这一点。
现在他的目标是更换熄灭的灯泡，但他不知道每种颜色需要多少灯泡。保证每种颜色至少有一个灯泡仍在工作。
已知彩灯由四种颜色的灯泡组成：红色、蓝色、黄色和绿色。彩灯的构造方式如下：如果你取任意四个连续的灯泡，则其中不会有相同颜色的灯泡。例如，彩灯可以是 "_RYBGRYBGRY_"、"_YBGRYBGRYBG_"、"_BGRYB_"，但不能是 "_BGRYG_"、"_YBGRYBYGR_" 或 "_BGYBGY_"。字母表示颜色：'_R_' — 红色，'_B_' — 蓝色，'_Y_' — 黄色，'_G_' — 绿色。
利用每种颜色至少有一个灯泡仍在工作的信息，计算每种颜色的熄灭灯泡数量。
第一行也是唯一一行包含字符串 #cf_span[s] (#cf_span[4 ≤ |s| ≤ 100])，描述了彩灯，其中第 #cf_span[i] 个字符表示从彩灯开始起第 #cf_span[i] 个灯泡的颜色：
字符串 #cf_span[s] 除了上述五种字符外，不包含其他字符。
保证在给定字符串中，四个字母 '_R_'、'_B_'、'_Y_' 和 '_G_' 至少各出现一次。
保证字符串 #cf_span[s] 是一个带有部分熄灭灯泡的合法彩灯，例如输入数据中不会出现类似 "_GRBY!!!B_" 的字符串。
请在唯一一行输出四个整数 #cf_span[kr, kb, ky, kg] —— 分别表示红色、蓝色、黄色和绿色熄灭灯泡的数量。
在第一个例子中，没有熄灭的灯泡。
在第二个例子中，显然有一个蓝色灯泡熄灭了，因为根据题意，该位置不可能是其他颜色的灯泡。
## Input
第一行也是唯一一行包含字符串 #cf_span[s] (#cf_span[4 ≤ |s| ≤ 100])，描述了彩灯，其中第 #cf_span[i] 个字符表示从彩灯开始起第 #cf_span[i] 个灯泡的颜色：'_R_' — 灯泡为红色，'_B_' — 灯泡为蓝色，'_Y_' — 灯泡为黄色，'_G_' — 灯泡为绿色，'_!_' — 灯泡熄灭。字符串 #cf_span[s] 除了上述五种字符外，不包含其他字符。保证在给定字符串中，四个字母 '_R_'、'_B_'、'_Y_' 和 '_G_' 至少各出现一次。保证字符串 #cf_span[s] 是一个带有部分熄灭灯泡的合法彩灯，例如输入数据中不会出现类似 "_GRBY!!!B_" 的字符串。
## Output
请在唯一一行输出四个整数 #cf_span[kr, kb, ky, kg] —— 分别表示红色、蓝色、黄色和绿色熄灭灯泡的数量。
[samples]
## Note
在第一个例子中，没有熄灭的灯泡。在第二个例子中，显然有一个蓝色灯泡熄灭了，因为根据题意，该位置不可能是其他颜色的灯泡。
**Definitions**
Let $ s \in \{R, B, Y, G, ?\}^n $ be a string of length $ n $, where $ 4 \leq n \leq 100 $, representing the garland.
Each character is either one of the four colors $ R, B, Y, G $ (working bulb) or $ ? $ (dead bulb, represented by placeholder).
The garland satisfies: for all $ i \in \{1, \dots, n-3\} $, the four consecutive characters $ s[i], s[i+1], s[i+2], s[i+3] $ are pairwise distinct.
**Constraints**
1. $ 4 \leq n \leq 100 $
2. Each of $ R, B, Y, G $ appears at least once in $ s $.
3. The pattern of non-dead bulbs is consistent with a repeating 4-color cycle: $ s[i] = s[i \mod 4] $ (with appropriate offset), up to dead bulbs.
**Objective**
Determine the number of dead bulbs for each color:
Let $ c_C $ be the total count of positions $ i $ such that $ s[i] = C $ (including dead bulbs).
Let $ w_C $ be the count of working bulbs of color $ C $.
Then the number of dead bulbs of color $ C $ is $ d_C = c_C - w_C $.
Since the garland is a repeating 4-cycle, the positions $ i \equiv r \pmod{4} $ for $ r \in \{0,1,2,3\} $ must all be assigned the same color.
Let $ \phi: \{0,1,2,3\} \to \{R,B,Y,G\} $ be the hidden color assignment per residue class.
For each residue $ r \in \{0,1,2,3\} $:
- If any $ s[i] \neq ? $ with $ i \equiv r \pmod{4} $, then $ \phi(r) $ is uniquely determined.
- Since all four colors appear, $ \phi $ is a bijection.
Compute:
For each color $ C \in \{R,B,Y,G\} $:
- Let $ r_C $ be the unique residue such that $ \phi(r_C) = C $.
- Let $ c_C = \#\{ i \in \{1,\dots,n\} \mid i \equiv r_C \pmod{4} \} $
- Let $ w_C = \#\{ i \in \{1,\dots,n\} \mid s[i] = C \} $
- Then $ d_C = c_C - w_C $
Output: $ (d_R, d_B, d_Y, d_G) $