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:
"""
Python for Competitive Programming:
In short:
- Write your solution inside a function. Lookup variables in the global scope is more expensive, than using variables in the local scope.
- Avoid for loops like the plague. Favor Python builtins. Always use map, filter, concatenate strings with join, etc.
- Writing output is really expensive. Writting a gigantic string once, may be better than writting several small strings.
- Type casting is really expensive. Avoid if possible (string to int).
  - Casting string to int > casting int to string (but both of them are costly)
- Avoid dots. In other words: Cache function lookups. Example: Avoid using stdout.write directly, put it in a variable w = stdout.write.
- Careful with Dict vs Lists for graphs
"""

def main():
  from sys import stdin, stdout
  def solve(tc: int):
    # buf = "Testcase #{}: ".format(tc)
    buf = ""
    GAUNTLET = {
      "purple": "Power",
      "green": "Time",
      "blue": "Space",
      "orange": "Soul",
      "red": "Reality",
      "yellow": "Mind",
    }

    n = int(stdin.readline())
    available = set([a[:-1] for a in stdin.readlines()])
    buf += str(len(GAUNTLET.keys()) - len(available)) + "\n"
    for key in GAUNTLET:
      if key not in available:
        buf += (GAUNTLET[key]) + "\n"

    stdout.write(buf + "\n")

  TC = 1
  # TC = int(stdin.readline())
  
  for tc in range(TC):
    solve(tc)

if __name__ == '__main__':
	main()