Problem:
Score: 100 points

Problem Statement

The weather in Takahashi's town changes day by day, in the following cycle: Sunny, Cloudy, Rainy, Sunny, Cloudy, Rainy, ...

Given is a string S representing the weather in the town today. Predict the weather tomorrow.

Constraints

S is Sunny, Cloudy, or Rainy.

Input

Input is given from Standard Input in the following format:

S

Output

Print a string representing the expected weather tomorrow, in the same format in which input is given.

Sample Input 1

Sunny

Sample Output 1

Cloudy

In Takahashi's town, a sunny day is followed by a cloudy day.

Sample Input 2

Rainy

Sample Output 2

Sunny

Solution in C++14 (GCC 5.4.1) (judge verdict: Wrong Answer)

#include <stdio.h>
#include <queue>

using namespace std;

int n, m;
std::priority_queue<int> pq;

int main()
{
	int i;
	scanf("%d %d", &n, &m);

	for (i = 0; i < n; i++) {
		int x;
		scanf("%d", &x);
		pq.push(x);
	}

	for (i = 0; i < m; i++) {
		int price = pq.top(); pq.pop();
		price /= 2;
		pq.push(price);
	}
	long long ans = 0;

	for (i = 0; i < n; i++) {
		ans += pq.top(); pq.pop();
	}

	printf("%lld\n", ans);

	return 0;
}