Problem: You took a peek on Thanos wearing Infinity Gauntlet. In the Gauntlet there is a place for six Infinity Gems:

  * the Power Gem of purple color, 
  * the Time Gem of green color, 
  * the Space Gem of blue color, 
  * the Soul Gem of orange color, 
  * the Reality Gem of red color, 
  * the Mind Gem of yellow color. 



Using colors of Gems you saw in the Gauntlet determine the names of absent Gems.

Input

In the first line of input there is one integer n (0 ≤ n ≤ 6) — the number of Gems in Infinity Gauntlet.

In next n lines there are colors of Gems you saw. Words used for colors are: purple, green, blue, orange, red, yellow. It is guaranteed that all the colors are distinct. All colors are given in lowercase English letters.

Output

In the first line output one integer m (0 ≤ m ≤ 6) — the number of absent Gems.

Then in m lines print the names of absent Gems, each on its own line. Words used for names are: Power, Time, Space, Soul, Reality, Mind. Names can be printed in any order. Keep the first letter uppercase, others lowercase.

Examples

Input

4
red
purple
yellow
orange


Output

2
Space
Time


Input

0


Output

6
Time
Mind
Soul
Power
Reality
Space

Note

In the first sample Thanos already has Reality, Power, Mind and Soul Gems, so he needs two more: Time and Space.

In the second sample Thanos doesn't have any Gems, so he needs all six.

Solution (in PYTHON3):

Solution:
# import sys 
# sys.stdin = open('input.txt', 'r') 
# sys.stdout = open('output.txt', 'w')
import math
# import re
gg="abcdefghijklmnopqrstuvwxyz"
# a=ord('a')
# print(chr(a), end="")
#sys.setrecursionlimit(int(1e6))
# n, m = map(int, input().split())
# graph = [[] for i in range(n)]
# for i in range(m):
# 	a,b = map(int, input().split())
# 	graph[a-1].append(b-1)
# 	graph[b-1].append(a-1)

# def dfs(node, count, visited):
# 	visited[node] = 1
# 	count[0]+=1
# 	for i in graph[node]:
# 		if not visited[i]:
# 			dfs(i, count, visited)


# visited = [0]*n
# t = 0
# node = None
# for i in range(n):
# 	if not visited[i]:
# 		count = [0]
# 		dfs(i, count, visited)
# 		if t<count[0]:
# 			t = max(t, count[0])
# 			node = i
# visited = [0]*n
# e = [0]
# dfs(node, e, visited)
# print(t)
# print(*visited)
n=int(input())
l=[]
for i in range(n):
	a=input()
	l.append(a)
# print(*l)
v=["Time" ,"Mind", "Soul", "Power", "Reality" ,"Space"]
c=["purple", "green", "blue", "orange", "red", "yellow"]
for i in range(n):
	# print(c.pop(c.index(l[i])))
	c.pop(c.index(l[i]))
print(len(c))
for i in range(len(c)):
	if(c[i]=="purple"):
		c[i]="Power"
	if(c[i]=="green"):
		c[i]="Time"
	if(c[i]=="orange"):
		c[i]="Soul"
	if(c[i]=="red"):
		c[i]="Reality"
	if(c[i]=="yellow"):
		c[i]="Mind"
	if(c[i]=="blue"):
		c[i]="Space"
# print(*c)
for i in c:
	print(i)