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 (Python):
s = input()
if s == 'Sunny':
  print('Cloudy')
elif s == 'Cloudy':
  print('Rainy')
elif s == 'Rainy':
  print('Sunny')

Solution (Python):
S = input()

if "Sunny" == S:
  print("Cloudy")
elif "Cloudy" == S:
  print("Rainy")
else :
  print("Sunny")

Solution (Python):


s = input()

if s == 'Sunny':
    ans = 'Cloudy'
elif s == 'Cloudy':
    ans = 'Rainy'
else:
    ans = 'Sunny'
print(ans)

Solution (Python):
S = input()
weathers = ['Sunny', 'Cloudy', 'Rainy']

ind = weathers.index(S)
print(weathers[(ind+1)%3])

Solution (Python):
import sys

def read():
	return sys.stdin.readline().rstrip()

S = read()

weathers = ["Sunny", "Cloudy", "Rainy", "Sunny"]

for i, w in enumerate(weathers):
  if S == w:
    print(weathers[i + 1])
    break

Solution (Python):
S = input()
if S == 'Sunny':
    print('Cloudy')
elif S == 'Cloudy':
    print('Rainy')
elif S == 'Rainy':
    print('Sunny')

Solution (Python):
weather = input()

if weather == 'Sunny':
    print('Cloudy')
elif weather == 'Cloudy':
    print('Rainy')
else:
    print('Sunny')

Solution (Python):


d = ['Sunny', 'Cloudy', 'Rainy']
N = input()
i = d.index(N)
print(d[(i + 1) % 3])

Solution (Python):
S = input()

if S == 'Sunny':
	print('Cloudy')
elif S == 'Cloudy':
	print('Rainy')
else:
	print('Sunny')

Solution (Python):
weathers = ['Sunny', 'Cloudy', 'Rainy']

S = input()

print(weathers[(weathers.index(S)+1) % len(weathers)])

Solution (Python):
S = input()

if S == 'Sunny':
  ans = 'Cloudy'
elif S == 'Cloudy':
  ans = 'Rainy'
else:
  ans = 'Sunny'

print(ans)

Solution (Python):

import sys
import math
from bisect import bisect_left
from bisect import bisect_right
import collections
import copy
import heapq
from collections import defaultdict
from heapq import heappop, heappush
import itertools
input = sys.stdin.readline






















def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))

def main():
	S = input()
	S = S[:-1]
 
	if S == "Sunny":
		print("Cloudy")
	elif S == "Cloudy":
		print("Rainy")
	else:
		print("Sunny")
	




if __name__ == "__main__":
	main()

Solution (Python):
S = input()
if S == 'Sunny':
    print('Cloudy')
elif S == 'Cloudy':
    print('Rainy')
elif S == 'Rainy':
    print('Sunny')

Solution (Python):
s = input()

if s == "Sunny":
    print("Cloudy")
elif s == "Cloudy":
    print("Rainy")
elif s == "Rainy":
    print("Sunny")

Solution (Python):
def WeatherPrediction():
	weather = ['Sunny', 'Cloudy', 'Rainy']
	S = input()
	print(weather[(weather.index(S) + 1) % 3])

WeatherPrediction()

Solution (Python):
s = input()
if s == 'Sunny':
  print('Cloudy')
elif s == 'Cloudy':
  print('Rainy')
else:
  print('Sunny')

Solution (Python):
S = input()

if S == 'Sunny':
    print('Cloudy')
elif S == 'Cloudy':
    print('Rainy')
else:
    print('Sunny')

Solution (Python):
S = str(input())
if S == "Sunny":
    print("Cloudy")
elif S == "Cloudy":
    print("Rainy")
else:
    print("Sunny")

Solution (Python):
s = input()
if s == "Sunny":
  print("Cloudy")
elif s == "Cloudy":
  print("Rainy")
else :
  print("Sunny")

Solution (Python):
a = input()
if(a =='Sunny'):
    print('Cloudy')
if(a =='Cloudy'):
    print('Rainy')
if(a =='Rainy'):
    print('Sunny')

Solution (Python):
import sys
input = sys.stdin.readline

S=input().strip()

if S[0]=="S":
    print("Cloudy")
elif S[0]=="C":
    print("Rainy")
else:
    print("Sunny")

Solution (Python):
while True:
    try:
        string = input()
        if string == 'Sunny':
            print('Cloudy')
        elif string == 'Cloudy':
            print('Rainy')
        elif string == 'Rainy':
            print('Sunny')
    except:
        break

Solution (Python):
today_wheather = input()
if today_wheather == "Sunny":
  print("Cloudy")
elif today_wheather == "Cloudy":
  print("Rainy")
else:
  print("Sunny")

Solution (Python):
S = input()

if S == "Sunny":
  print("Cloudy")
elif S == "Cloudy":
  print("Rainy")
else:
  print("Sunny")

Solution (Python):
S = input()
if S == 'Sunny':
    print('Cloudy')
elif S == 'Cloudy':
    print('Rainy')
else:
    print('Sunny')

Solution (Python):
s = input()
if s[0] == 'C':
    print("Rainy")
elif s[0] == 'S':
    print("Cloudy")
else:
    print("Sunny")

Solution (Python):
S = str(input())

if S == 'Sunny':
    print('Cloudy')
elif S == 'Cloudy':
    print('Rainy')
else:
    print('Sunny')

Solution (Python):
from heapq import heappush, heappop
from collections import deque,defaultdict,Counter
import itertools
from itertools import permutations,combinations
import sys
import bisect
import string
import math
import time
import random
def I():
    return int(input())
def MI():
    return map(int,input().split())
def LI():
    return [int(i) for i in input().split()]
def LI_():
    return [int(i)-1 for i in input().split()]
def show(*inp,end='\n'):
    if show_flg:
        print(*inp,end=end)
YN=['Yes','No']
mo=10**9+7
ts=time.time()
sys.setrecursionlimit(10**6)

show_flg=False
show_flg=True

an=0
k=0
s=input()
d=dict()
d['Sunny']='Cloudy'
d['Cloudy']='Rainy'
d['Rainy']='Sunny'
print(d[s])

Solution (Python):
S = input()
if S == 'Sunny':
    print('Cloudy')
elif S == 'Cloudy':
    print('Rainy')
else:
    print('Sunny')

Solution (Python):
S=input()

if S=='Sunny':
  print('Cloudy')
elif S=='Cloudy':
  print('Rainy')
elif S=='Rainy':
  print('Sunny')

Solution (Python):



S = input()


if S == 'Sunny':
    ans = 'Cloudy'
elif S == 'Cloudy':
    ans = 'Rainy'
else:
    ans = 'Sunny'


print(ans)

Solution (Python):
s = input()

if s == "Sunny":
	print("Cloudy")
elif s == "Cloudy":
	print("Rainy")
else:
	print("Sunny")

Solution (Python):
S = input()

if S == 'Sunny':
  print('Cloudy')
  
if S == 'Cloudy':
  print('Rainy')
  
if S == 'Rainy':
  print('Sunny')

Solution (Python):

import sys

def solve():
    S = input()
    if S == "Sunny":
        print("Cloudy")
    elif S == "Cloudy":
        print("Rainy")
    else:
        print("Sunny")


if __name__ == "__main__":
    solve()

Solution (Python):
S = input() 
if S == "Sunny":
    print("Cloudy")
elif S == "Cloudy": 
    print("Rainy")
else:
    print("Sunny")

Solution (Python):
S = input()
if S == 'Sunny' :
	print('Cloudy')
	
elif S == 'Cloudy':
	print('Rainy')
else:
	print('Sunny')

Solution (Python):
S=input()

if S=='Sunny':
    print('Cloudy')
elif S=='Cloudy':
    print('Rainy')
else:
    print('Sunny')

Solution (Python):
def Weather_Prediction_abc141():    
    s = input()

    if s == 'Sunny':
        print('Cloudy')
    elif s == 'Cloudy':
        print('Rainy')
    else:
        print('Sunny')
        
if __name__ == '__main__':
    Weather_Prediction_abc141()

Solution (Python):
n = input()
if n == "Sunny":
  print("Cloudy")
if n == "Cloudy":
  print("Rainy")
if n == "Rainy":
  print("Sunny")

Solution (Python):
S = input()
 
if S == 'Sunny':
    print('Cloudy')
elif S == 'Cloudy':
    print('Rainy')
else:
    print('Sunny')

Solution (Python):
weathers = [ 'Sunny', 'Cloudy', 'Rainy' ]
now = input()
now_index = weathers.index(now)
next_index = (now_index + 1) % len(weathers)
print(weathers[next_index])

Solution (Python):
s = input()
if s == "Sunny":
    focast = "Cloudy"
elif s == "Cloudy":
    focast = "Rainy"
elif s == "Rainy":
    focast = "Sunny"
print(focast)

Solution (Python):
S = input()
if S == "Sunny":
    print("Cloudy")
elif S== "Cloudy":
    print("Rainy")
else:
    print("Sunny")

Solution (Python):
i =input()

if i =='Sunny':
  print('Cloudy')
elif i =='Cloudy':
  print('Rainy')
else:
  print('Sunny')

Solution (Python):
S = input()

if S == "Sunny":
    print("Cloudy")
elif S == "Rainy":
    print("Sunny")
else:
    print("Rainy")

Solution (Python):
from sys import stdin

readline = stdin.readline


def main():
    s = readline().rstrip()
    weather = ('Sunny', 'Cloudy', 'Rainy')
    print(weather[(weather.index(s)+1)%3])


if __name__ == '__main__':
    main()

Solution (Python):
S = input()

hoge = ['Sunny','Cloudy','Rainy']

x = hoge.index(S)
if(x == 2):
    x = -1

print(hoge[x+1])

Solution (Python):
weathers = ['Sunny', 'Cloudy', 'Rainy']

today = input()

for i, weather in enumerate(weathers):
    if today == weather:
        print(weathers[(i+1)%3])

Solution (Python):
s = str(input())
weather_list = ["Sunny", "Cloudy", "Rainy"]

index = weather_list.index(s)
if index != 2:
    print(weather_list[index + 1])
elif index == 2:
    print(weather_list[0])

Solution (Python):
S = input()

if S == 'Sunny':
	print('Cloudy')
elif S == 'Cloudy':
	print('Rainy')
else:
	print('Sunny')

Solution (Python):
A = input()

if A == "Sunny":
    print("Cloudy")
elif A == "Cloudy":
    print("Rainy")
else:
    print("Sunny")

Solution (Python):
s = input()

we =  ["Sunny", "Cloudy", "Rainy"]

for i in range(3):
    if we[i] == s:
        a = (i+1)%3
        print(we[a])
        break

Solution (Python):

S = input()


if S == "Sunny":
    print("Cloudy")
elif S =="Cloudy":
    print("Rainy")
elif S == "Rainy":
    print("Sunny")

Solution (Python):
S = str(input())

A = ['Sunny','Cloudy','Rainy']
i = 0

if S == 'Sunny':
    i = 1
elif S == 'Cloudy':
    i = 2
else:
    i =0

print(A[i])

Solution (Python):


S = input()
weather = ['Sunny', 'Cloudy', 'Rainy', 'Sunny']

for i in range(3):
    if S == weather[i]:
        print(weather[i+1])

Solution (Python):
S = str(input())

wether = ['Sunny','Cloudy', 'Rainy']

if S == wether[0]:
    print(wether[1])
elif S == wether[1]:
    print(wether[2])
elif S == wether[2]:
    print(wether[0])

Solution (Python):
S = input()

if S=="Sunny":
    print("Cloudy")

if S=="Cloudy":
    print("Rainy")

if S=="Rainy":
    print("Sunny")

Solution (Python):
s = input()
ss = ["Sunny", "Cloudy", "Rainy", "Sunny"]
print(ss[ss.index(s)+1])

Solution (Python):
weather = input()

if weather == "Sunny":
  	print("Cloudy")
elif weather == "Cloudy":
    print("Rainy")
elif weather == "Rainy":
   	print("Sunny")

Solution (Python):
s = input()
if s == 'Sunny':
  print('Cloudy')
elif s == 'Cloudy':
  print('Rainy')
elif s == 'Rainy':
  print('Sunny')

Solution (Python):
S = input()

if S == 'Sunny':
	print('Cloudy')
elif S == 'Cloudy':
	print('Rainy')
else:
	print('Sunny')

Solution (Python):
WeatherToday = input()
if WeatherToday == "Sunny":
  print("Cloudy")
elif WeatherToday == "Cloudy":
  print("Rainy")
else:
  print("Sunny")

Solution (Python):
import sys
input = sys.stdin.readline
sys.setrecursionlimit(100000)

def getN():
    return int(input())
def getList():
    return list(map(int, input().split()))
import math



s = input().strip()

if s == "Sunny":
    print("Cloudy")
elif s == "Cloudy":
    print("Rainy")

else:
    print("Sunny")

Solution (Python):
n = str(input())
if n == 'Sunny':
    print('Cloudy')
elif n == 'Cloudy':
    print('Rainy')
else:
    print('Sunny')

Solution (Python):
s = input()
ls = ["Sunny","Cloudy","Rainy"]
if s==ls[0]:
    print(ls[1])
if s==ls[1]:
    print(ls[2])
if s==ls[2]:
    print(ls[0])

Solution (Python):
S=input()
if S=='Sunny':
    print('Cloudy')
elif S=='Cloudy':
    print('Rainy')
else:
    print('Sunny')

Solution (Python):
S = input()

if S == 'Sunny':
  print('Cloudy')
elif S == 'Cloudy':
  print('Rainy')  
else:
  print('Sunny')

Solution (Python):
s = ["Sunny", "Cloudy", "Rainy"]
today = input()

print(s[(s.index(today)+1)%3])

Solution (Python):
a=['Sunny', 'Cloudy', 'Rainy']
s=input()
if s==a[0]:
  print(a[1])
elif s==a[1]:
  print(a[2])
else:
  print(a[0])

Solution (Python):
S = str(input())

test = ['Sunny','Cloudy','Rainy']

if S == test[0]:
    print(test[1])
elif S == test[1]:
    print(test[2])
else:
    print(test[0])

Solution (Python):
S = input()
A = ['Sunny', 'Cloudy', 'Rainy']
print(A[(A.index(S) + 1) % 3])

Solution (Python):
import sys
 
stdin = sys.stdin
 
ni = lambda: str(ns())
ns = lambda: stdin.readline().rstrip()  

map = {"Sunny":"Cloudy","Cloudy":"Rainy","Rainy":"Sunny"}

print(map[ni()])

Solution (Python):
s = str(input())
if s == "Sunny":
  print("Cloudy")
if s == "Cloudy":
  print("Rainy")
if s == "Rainy":
  print("Sunny")

Solution (Python):
n = input()
weather = {0:"Sunny", 1:"Cloudy", 2:"Rainy"}

           
for k, v in weather.items():
  if v == n:
    nk = k
    break

nk = (nk+1) % 3

print(weather[nk])

Solution (Python):

import sys


def solve(S: str):
    if S == 'Sunny':
        print('Cloudy')
    elif S == 'Cloudy':
        print('Rainy')
    else:
        print('Sunny')
    return S


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    S = next(tokens)  
    solve(S)

if __name__ == '__main__':
    main()

Solution (Python):
S = input()
if S[0] == 'S':
    ans = 'Cloudy'
elif S[0] == 'C':
    ans = 'Rainy'
else:
    ans = 'Sunny'
    
print(ans)

Solution (Python):
s = input()

if s == "Sunny":
  print("Cloudy")
if s == "Cloudy":
  print("Rainy")
if s == "Rainy":
  print("Sunny")

Solution (Python):
s=input()
if s=='Sunny':
  print("Cloudy")
elif s=='Cloudy':
  print("Rainy")
else:
  print("Sunny")

Solution (Python):
W = [ "Sunny", "Cloudy", "Rainy" ]
 
S = input()
 
if S==W[0]:
  print(W[1])
elif S==W[1]:
  print(W[2])
else:
  print(W[0])

Solution (Python):
s = input()
we = ['Sunny','Cloudy', 'Rainy', 'Sunny']

for i in range(3):
    if we[i] == s:
        print(we[i+1])

Solution (Python):
S = input()
if S == 'Sunny':
    print('Cloudy')
elif S == 'Cloudy':
    print('Rainy')
elif S == 'Rainy':
    print('Sunny')

Solution (Python):
a=input()
b=['Sunny','Cloudy','Rainy']*2
print(b[b.index(a)+1])

Solution (Python):
s=input()
if s == "Sunny":
    ans="Cloudy"
elif s == "Cloudy":
    ans="Rainy"
elif s=="Rainy":
    ans="Sunny"
print(ans)

Solution (Python):
s=input()

if s=="Sunny":
    print("Cloudy")
if s=="Cloudy":
    print("Rainy")
if s=="Rainy":
    print("Sunny")

Solution (Python):
wehter = ['Sunny','Cloudy','Rainy']
s = input()
if s == wehter[0]:
    print(wehter[1])
elif s == wehter[1]:
    print(wehter[2])
else:
    print(wehter[0])

Solution (Python):
S = str(input())
if S == 'Sunny':
	print('Cloudy')
elif S == 'Cloudy':
	print('Rainy')
elif S == 'Rainy':
	print('Sunny')

Solution (Python):
S=input()
if S=='Sunny':
    print('Cloudy')
elif S=='Cloudy':
    print('Rainy')
elif S=='Rainy':
    print('Sunny')

Solution (Python):
S=input()
if S=="Sunny":
    print("Cloudy")
elif S=="Cloudy":
    print("Rainy")
else:
    print("Sunny")

Solution (Python):
S = input()
if S == "Sunny":
    print("Cloudy")
elif S == "Cloudy":
    print("Rainy")
else:
    print("Sunny")

Solution (Python):
S={'Sunny':'Cloudy','Cloudy':'Rainy','Rainy':'Sunny'}
print(S[input()])

Solution (Python):
print({"Sunny":"Cloudy","Cloudy":"Rainy","Rainy":"Sunny"}[input()])

Solution (Python):
S = input()
weathers = ['Sunny', 'Cloudy', 'Rainy']
pos = 0
for i, weather in enumerate(weathers):
    if weather == S:
        pos = i

print(weathers[(pos + 1) % 3])

Solution (Python):
S = input()
if S == "Sunny":
    print("Cloudy")
elif S == "Cloudy":
    print("Rainy")
else:
    print("Sunny")

Solution (Python):
s = 'Sunny'
c = "Cloudy"
r = "Rainy"

S = input()
if S == s:
    print(c)
elif S == c:
    print(r)
else:
    print(s)

Solution (Python):
weather_list = ['Sunny', 'Cloudy', 'Rainy']
input_value = input()
number = weather_list.index(input_value) + 1
if number <= 2:
    print(weather_list[number])
else:
    print(weather_list[number - 3])

Solution (Python):
S = input()
if S == 'Sunny':
    print('Cloudy')
elif S == 'Cloudy':
    print('Rainy')
else:
    print('Sunny')

Solution (Python):
import sys
input = sys.stdin.readline

S = input().strip()
if S == 'Sunny':
    print('Cloudy')
elif S == 'Cloudy':
    print('Rainy')
elif S == 'Rainy':
    print('Sunny')

Solution (Python):
s = input()
w = ['Sunny','Cloudy','Rainy']
x = (w.index(s)+1) % 3
print(w[x])

Solution (Python):
s=input()
if s =="Sunny":
    print('Cloudy')
elif s=="Cloudy":
    print("Rainy")
else:
    print("Sunny")

Solution (Python):
S = raw_input()
pred={'Sunny':'Cloudy', 'Cloudy':'Rainy', 'Rainy':'Sunny'}
print(pred[S])

Solution (Python):
S = input()

if S == "Sunny":
  print("Cloudy")
elif S == "Cloudy":
  print("Rainy")
else:
  print("Sunny")

Solution (Python):
a = input()
b = ""
if a == 'Sunny':
    b = 'Cloudy'
elif a == 'Cloudy':
    b = 'Rainy'
else:
    b = 'Sunny'
print(b)

Solution (Python):
s= input()
if s=='Sunny':
  print('Cloudy')
elif s=='Cloudy':
  print('Rainy')
else:
  print('Sunny')

Solution (Python):

import sys


def solve(S: str):
    a = {'Sunny': 'Cloudy', 'Cloudy': 'Rainy', 'Rainy': 'Sunny'}
    print(a[S])



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    S = next(tokens)  
    solve(S)

if __name__ == '__main__':
    main()

Solution (Python):
w = ["Sunny", "Cloudy", "Rainy"]
s = input()

for i in range(len(w)):
  if w[i] == s:
    print(w[(i+1)%3])

Solution (Python):





from sys import stdin,setrecursionlimit


setrecursionlimit(10**6)
input=stdin.readline

s=input().rstrip()
print("Sunny" if s=="Rainy" else "Cloudy" if s=="Sunny" else "Rainy")

Solution (Python):
S1 = ['Sunny', 'Cloudy', 'Rainy']

print(S1[(S1.index(input())+1)%3])

Solution (Python):
s=input()
a='Sunny'
b='Cloudy'
c='Rainy'
if a in s:
  print(b)
elif b in s:
  print(c)
else:
  print(a)

Solution (Python):


weather = input()
weahters = ["Sunny", "Cloudy", "Rainy"]
index = weahters.index(weather)
if index == 2:
  next_index = 0
else:
  next_index = index + 1

print(weahters[next_index])

Solution (Python):


def whether_predict(s):
	w_list=["Sunny", "Cloudy", "Rainy"]
	num=w_list.index(s)
	predict_index= (num+1)%3
	return w_list[predict_index]

if __name__ == '__main__':
    input = input()
    print(whether_predict(input))

Solution (Python):
S = input()

if S == 'Sunny':
    print('Cloudy')
elif S == 'Cloudy':
    print('Rainy')
else:
    print('Sunny')

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 7)

S = input()

if S == "Sunny":
  print("Cloudy")
if S == "Rainy":
  print("Sunny")  
if S == "Cloudy":
  print("Rainy")

Solution (Python):
def main():
    s = input()
    if s[0] == 'S':
        print('Cloudy')
    elif s[0] == 'C':
        print('Rainy')
    else:
        print('Sunny')

if __name__ == '__main__':
    main()

Solution (Python):
S = input()
weather = ['Sunny', 'Cloudy', 'Rainy']
i = weather.index(S)
print(weather[(i+1)%3])

Solution (Python):
S = raw_input()
if S == "Sunny":
    print "Cloudy"
elif S == "Cloudy":
    print "Rainy"
elif S == "Rainy":
    print "Sunny"

Solution (Python):

import sys


def solve(S: str):
    if(S=='Sunny'):
        print('Cloudy')
    elif(S=='Cloudy'):
        print('Rainy')
    else:
        print('Sunny')
    return



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    S = next(tokens)  
    solve(S)

if __name__ == '__main__':
    main()

Solution (Python):


w = input()

if w == 'Sunny':
  print('Cloudy')
elif w == 'Cloudy':
  print('Rainy')
else:
  print('Sunny')

Solution (Python):
s = input()
d = {'Sunny': 'Cloudy', 'Cloudy': 'Rainy', 'Rainy': 'Sunny'}
print(d[s])

Solution (Python):
wet_list = ["Sunny", "Cloudy", "Rainy"]
S = input()
a = wet_list.index(S)

if a<2:
    print(wet_list[a+1])
else:
    print(wet_list[0])

Solution (Python):
s = input()
if s=="Sunny":print("Cloudy")
elif s=="Cloudy":print("Rainy")
elif s=="Rainy":print("Sunny")

Solution (Python):

import sys
from operator import itemgetter
from fractions import gcd
from math import ceil, floor, sqrt
from copy import deepcopy
from collections import Counter, deque
import heapq
from functools import reduce
sys.setrecursionlimit(200000)


















def main():
    a = ["Sunny", "Cloudy", "Rainy"]
    S = input()
    if S == a[0]:
        print(a[1])
    elif S == a[1]:
        print(a[2])
    else:
        print(a[0])
    return


if __name__ == '__main__':
    if not __debug__:
        import doctest
        doctest.testmod()
    main()

Solution (Python):
S = input()
if S[0] == "S" :
  print("Cloudy")
elif S[0] == "C" :
  print("Rainy")
else :
  print("Sunny")

Solution (Python):
s = input()

if s == 'Sunny':
  print("Cloudy")
if s == 'Cloudy':
  print("Rainy")
if s == 'Rainy':
  print('Sunny')

Solution (Python):
w = {"Sunny":"Cloudy", "Cloudy":"Rainy", "Rainy":"Sunny"}
print(w[input()])

Solution (Python):
s = input()

if s=='Sunny':
    print('Cloudy')
elif s=='Cloudy':
    print('Rainy')
else :
    print('Sunny')

Solution (Python):
S = str(input())
s = ['Sunny','Cloudy','Rainy']

if s[0] == S:
    print(s[1])
if s[1] == S:
    print(s[2])
if s[2] == S:
    print(s[0])

Solution (Python):
inputval = input()

if inputval == 'Sunny':
    print('Cloudy')
elif inputval == 'Cloudy':
    print('Rainy')
else:
    print('Sunny')

Solution (Python):
S = input()

if S == 'Sunny':
    print('Cloudy')
elif S == 'Cloudy':
    print('Rainy')
else:
    print('Sunny')

Solution (Python):

"""
Created on Fri Sep 13 22:46:19 2019

"""

S=input()

if S=='Sunny':
    print('Cloudy')
elif S=='Cloudy':
    print('Rainy')
else:
    print('Sunny')

Solution (Python):
weather = {'Sunny': 'Cloudy', 'Cloudy': 'Rainy', 'Rainy': 'Sunny'}
 
today = input()
print(weather[today])

Solution (Python):
s = input()
if s == "Sunny":
    print("Cloudy")
elif s == "Cloudy":
    print("Rainy")
else:
    print("Sunny")

Solution (Python):
today = input()

weather = ["Sunny", "Cloudy", "Rainy"]

days = weather.index(today)
tomorrow = days + 1
if tomorrow == 3:
    tomorrow = 0
    
print(weather[tomorrow])

Solution (Python):
s = input()
wether = ["Sunny","Cloudy","Rainy"]
index = wether.index(s)+1

print(wether[(wether.index(s)+1)%3])

Solution (Python):
S=input()
W=["Sunny","Cloudy","Rainy","Sunny"]
print(W[W.index(S)+1])

Solution (Python):
s = input()
if s == 'Sunny':
  print('Cloudy')
elif s == 'Cloudy':
  print('Rainy')
elif s == 'Rainy':
  print('Sunny')

Solution (Python):
s = input()
if s[0] == "S":
    print('Cloudy')
elif s[0] == "C":
    print('Rainy')
else:
    print('Sunny')

Solution (Python):
N = input()

l = ["Sunny", "Cloudy", "Rainy"]

idx = l.index(N)

if idx == 2:
    print(l[0])
else:
    print(l[idx+1])

Solution (Python):
S = input()

if S=='Sunny':
    ans='Cloudy'
elif S=='Cloudy':
    ans='Rainy'
else:
    ans='Sunny'
print(ans)

Solution (Python):
s = input()

if s == 'Rainy':
	s = 'Sunny'
elif s == 'Cloudy':
	s = 'Rainy'
else:
	s = 'Cloudy'
print(s)

Solution (Python):
S = input()

if S == "Sunny":
  print("Cloudy")
elif S == "Cloudy":
  print("Rainy")
elif S == "Rainy":
  print("Sunny")

Solution (Python):
s=input()

if s=="Sunny":
    print("Cloudy")
elif s=="Cloudy":
    print("Rainy")
else:
    print("Sunny")

Solution (Python):
W = ["Sunny", "Cloudy", "Rainy"]
S = str(input())

if S == W[0]:
    print(W[1])
elif S == W[1]:
    print(W[2])
else:
    print(W[0])

Solution (Python):
S = input()

if S == 'Sunny' :
  print('Cloudy')
if S == 'Cloudy' :
  print('Rainy')
if S == 'Rainy' :
  print('Sunny')

Solution (Python):
today = input("")
if today == "Sunny":
    print("Cloudy")
elif today == "Cloudy":
    print("Rainy")
elif today == "Rainy":
    print("Sunny")

Solution (Python):
s = input()

weather = ["Sunny", "Cloudy", "Rainy"]

print(weather[(weather.index(s) + 1) % len(weather)])

Solution (Python):
s = input()
if s == 'Sunny':
	print('Cloudy')
elif s == 'Cloudy':
	print('Rainy')
else:
	print('Sunny')

Solution (Python):
S = input()
weather = ["Sunny","Cloudy","Rainy"]
if S == weather[0]:
    print(weather[1])
elif S == weather[1]:
    print(weather[2])
else:
    print(weather[0])

Solution (Python):
a = input()
if a == "Sunny":
    print("Cloudy")
elif a == "Cloudy":
    print("Rainy")
else:
    print("Sunny")

Solution (Python):
s = input()
if s == "Sunny":
  print("Cloudy")
elif s == "Cloudy":
  print("Rainy")
else:
  print("Sunny")

Solution (Python):
S = input()

if S == 'Sunny':
    print('Cloudy')
if S == 'Rainy':
    print('Sunny')
if S == 'Cloudy':
    print('Rainy')

Solution (Python):

from fractions import gcd

from math import factorial as f

from math import ceil,floor,sqrt

from sys import exit

from copy import deepcopy
import numpy as np

import bisect
import re


ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))



def main():
    w = ['Sunny', 'Cloudy', 'Rainy','Sunny']
    s = input()
    for i in range(3):
        if w[i] == s:
            print(w[i+1])
            
main()

Solution (Python):
weathers = {'Sunny': 'Cloudy', 'Cloudy': 'Rainy', 'Rainy': 'Sunny'}
today = input()
print(weathers[today])

Solution (Python):
S = input()
if S == "Sunny":
    print("Cloudy")
elif S == "Cloudy":
    print("Rainy")
else:
    print("Sunny")

Solution (Python):
weather = ['Sunny','Cloudy','Rainy']

S = input()

if S==weather[0]:
    print(weather[1])
elif S==weather[1]:
    print(weather[2])

else:
    print(weather[0])

Solution (Python):
s = input()
if s == "Sunny":
         print("Cloudy")
elif s == "Cloudy":
         print("Rainy")
else:
         print("Sunny")

Solution (Python):
weather = input()
if weather == "Sunny":
    print("Cloudy")
elif weather == "Cloudy":
    print("Rainy")
else:
    print("Sunny")

Solution (Python):
S = input()
if S == "Sunny":
  print("Cloudy")
elif S == "Cloudy":
  print("Rainy")
else:
  print("Sunny")

Solution (Python):
s = input()
dict = {1:'Sunny', 2:'Cloudy', 3:'Rainy'}
for i in range(1,4):
    if s == dict[i]:
        if i < 3:
            print(dict[i+1])
            break
        else:
            print(dict[1])

Solution (Python):
w = ['Sunny', 'Cloudy', 'Rainy']
s = input()
i = w.index(s) +1
if i==3:
  i=0
print(w[i])

Solution (Python):
s = ['Sunny', 'Cloudy', 'Rainy']
a = input()
i = s.index(a)
if i == 2:
  idx = 0
else:
  idx = i+1
print(s[idx])

Solution (Python):
s=input()
W=['Sunny', 'Cloudy', 'Rainy']
def weather(s,W):
  for i in range(len(W)):
    if s == W[i]:
      if s == W[-1]:
        return W[0]
      else:
        return W[i+1]
print(weather(s,W))

Solution (Python):
S = input()

if S == 'Sunny':
    print("Cloudy")
elif S == "Cloudy":
    print("Rainy")
else:
    print("Sunny")

Solution (Python):
s=input()

if s == "Sunny":
    print("Cloudy")
elif s == "Cloudy":
    print("Rainy")
elif s == "Rainy":
    print("Sunny")

Solution (Python):
s_l = ['Sunny', 'Cloudy', 'Rainy' ]
a = input()
for i in range(len(s_l)):
    if a == s_l[i]:
        try:
            print(s_l[i+1])
        except:
            print(s_l[0])
        break

Solution (Python):

s = input()

table = ["Sunny","Cloudy","Rainy"]


i = table.index(s)

print(table[(i+1)%len(table)])

Solution (Python):
s = input()

w_list = ['Sunny','Cloudy','Rainy']

for i in range(len(w_list)):
    if(s == w_list[i]):
        print(w_list[(i+1)%len(w_list)])

Solution (Python):
S = input()

Slist = ["Sunny", "Cloudy", "Rainy" ]

if S == Slist[0]:
    TS = Slist[1]
elif S == Slist[1]:
    TS = Slist[2]
else:
    TS = Slist[0]

print(TS)

Solution (Python):
S = input()
if S == 'Sunny':
    print('Cloudy')
elif S == 'Cloudy':
    print('Rainy')
elif S == 'Rainy':
    print('Sunny')

Solution (Python):
weather = input("")
if weather == "Sunny":
    print("Cloudy")
elif weather == "Cloudy":
    print("Rainy")
elif weather == "Rainy":
    print("Sunny")

Solution (Python):
s = input()

if s == 'Sunny':
  print('Cloudy')
elif s == 'Cloudy':
  print('Rainy')
else:
  print('Sunny')

Solution (Python):
S = input()

if S == 'Sunny':
  print('Cloudy')
elif S == 'Cloudy':
  print('Rainy')
else:
  print('Sunny')

Solution (Python):
from collections import Counter,defaultdict,deque
import sys,heapq,bisect,math,itertools,string,queue
sys.setrecursionlimit(10**8)
mod = 10**9+7
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpl_str(): return list(sys.stdin.readline().split())
def inpln(n): return list(int(sys.stdin.readline()) for i in range(n))

s = input()
if s == 'Sunny':
    print('Cloudy')
elif s == 'Cloudy':
    print('Rainy')
else:
    print('Sunny')

Solution (Python):
S = input()
if S == 'Sunny':
    print('Cloudy')
elif S == 'Cloudy':
    print('Rainy')
else:
    print('Sunny')

Solution (Python):
s=input()

if s[0] == 'S':
  print('Cloudy')
elif s[0] == 'C':
  print('Rainy')
else:
  print('Sunny')

Solution (Python):
s = input()
if s[0]=='S':
  print("Cloudy")
elif s[0]=='C':
  print("Rainy")
else:
  print("Sunny")

Solution (Python):
S = input()

if S == "Sunny":
  print("Cloudy")
if S == "Cloudy":
  print("Rainy")
if S == "Rainy":
  print("Sunny")

Solution (Python):
S = input()
ans = ""
if S == "Sunny":
    ans =  "Cloudy"
elif S == "Cloudy":
    ans = "Rainy"
else :
    ans = "Sunny"
print(ans)

Solution (Python):
S = input()
if S == "Sunny":
    ans = "Cloudy"
elif S == "Cloudy":
    ans = "Rainy"
else:
    ans = "Sunny"
print(ans)

Solution (Python):
S = raw_input()
MP = {'Sunny': 'Cloudy',
        'Cloudy': 'Rainy',
        'Rainy' : 'Sunny'}
print(MP[S])

Solution (Python):
import sys
import math
from copy import deepcopy
from collections import deque, defaultdict
from operator import mul
from functools import reduce
sys.setrecursionlimit(20000000)




def main():
    s = input()

    if s == 'Sunny':
        print('Cloudy')
        sys.exit()
    elif s == 'Cloudy':
        print('Rainy')
        sys.exit()
    else:
        print('Sunny')


if __name__ == '__main__':
    main()

Solution (Python):
S = str(input())

if S == "Sunny":
    print("Cloudy")
elif S == "Cloudy":
    print("Rainy")
elif S == "Rainy":
    print("Sunny")

Solution (Python):
from collections import Counter, defaultdict
import sys
sys.setrecursionlimit(10 ** 5 + 10)

from math import factorial
import heapq, bisect
import math
import itertools


import queue
from collections import deque


def main():
    a = input()

    if a == 'Sunny':
        print('Cloudy')
    if a == 'Cloudy':
        print('Rainy')
    if a == 'Rainy':
        print('Sunny')


if __name__ == '__main__':
    main()

Solution (Python):
s=input()
if s=="Sunny":
  print("Cloudy")
elif s=="Cloudy":
  print("Rainy")
else:
  print("Sunny")

Solution (Python):
a=input("")
if(a=="Sunny"):
  print("Cloudy")
elif(a=="Cloudy"):
  print("Rainy")
else:
  print("Sunny")

Solution (Python):
S = input()

if S == "Sunny":
    print("Cloudy")
elif S == "Cloudy":
    print("Rainy")
else:
    print("Sunny")

Solution (Python):


if __name__ == "__main__":
    s = input()
    if s == "Sunny": print("Cloudy")
    elif s == "Cloudy": print("Rainy")
    elif s == "Rainy": print("Sunny")

Solution (Python):
S = input()
if S == "Sunny":
    print("Cloudy")
elif S == "Cloudy":
    print("Rainy")
else:
    print("Sunny")

Solution (Python):
s = input()

if s == "Sunny":
  print("Cloudy")
elif s == "Cloudy":
  print("Rainy")
elif s == "Rainy":
  print("Sunny")

Solution (Python):
s = input()

if(s == 'Sunny'):
    print('Cloudy')
if(s == 'Cloudy'):
    print('Rainy')
if(s == 'Rainy'):
    print('Sunny')