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 JAVA):

Solution:
import java.util.*;
import java.io.*;
	
	public class q2 {
		private static InputStream stream;
		private static byte[] buf = new byte[1024];
		private static int curChar;
		private static int numChars;
		private static SpaceCharFilter filter;
		private static PrintWriter pw;
		private static long mod = 1000000000 + 7;
		private static int MAX=1000001;
		private static int block;
		
		
		private static void soln(){
		 
			int n=nextInt();
			
         HashSet<String> set=new HashSet<String>();
         set.add("red");
         set.add("purple");
         set.add("green");
         set.add("orange");
         set.add("blue");
         set.add("yellow");
         for(int i=0;i<n;i++) {
        	 String s=nextLine();
        	 set.remove(s);
         }
         System.out.println(set.size());
         for(String s : set) {
        	 if(s=="red") {
        		 System.out.println("Reality");
        	 }
 if(s=="purple") {
	 System.out.println("Power");   		 
        	 }
 if(s=="orange") {
	 System.out.println("Soul");
 }
 if(s=="blue") {
	 System.out.println("Space");
 }
 if(s=="yellow") {
	 System.out.println("Mind");
 }
 if(s=="green") {
	 System.out.println("Time");
 }
 
         }
        
				
		}
		
		public static boolean fun(int n,int[] arr,long x){
		   
		    long sum=0;
		    for(int i=0;i<n;i++){
		        sum+=arr[i];
		    }
		    if(sum>x){
		        return false;
		    }
		    for(int i=n;i<arr.length;i++){
		        sum=sum-arr[i-n];
		        sum=sum+arr[i];
		        if(sum>x){
		            return false;
		        }
		       
		    }
		    
		    return true;
		}
		
		public static void main(String[] args) throws Exception {
			new Thread(null,new Runnable(){
				@Override
				public void run() {
					
					InputReader(System.in);
					pw = new PrintWriter(System.out);
					
					soln();
					pw.close();
				}
			},"1",1<<26).start();
		}
	
		public static void InputReader(InputStream stream1) {
			stream = stream1;
		}
		private static int upperBound(int[] arr,int x) {
	        int l = 0, r =arr.length;
	        while (l < r) {
	            int m = (l + r) >> 1;
	            if (arr[m] <= x) l = m + 1;
	            else r = m;
	        }
	        return l;
	    }
	 
	    private static int lowestBound(int[] arr,int x) {
	        int l = 0, r = arr.length;
	        while (l < r) {
	            int m = (l + r) >> 1;
	            if (arr[m] < x) l = m + 1;
	            else r = m;
	        }
	        return l;
	    }
		static int GreEq(int[] arr,int x) {
			int low=0;
 
			int ans=-1;
			int high=arr.length-1;
			while(low<=high) {
				int mid=(low+high)/2;
				if(arr[mid]>=x) {
					ans=mid;
					high=mid-1;
				}else {
					low=mid+1;
				}
			}
			if(ans!= -1)
			return arr.length-ans;
			else
				return 0;
		}
		static int Gre(int[] arr,int x) {
			int low=0;
			int ans=-1;
			int high=arr.length-1;
			while(low<=high) {
				int mid=(high+low)/2;
				if(arr[mid]>x) {
					ans=mid;
					high=mid-1;
				}else {
					low=mid+1;
				}
			}
			if(ans!=-1)
			return arr.length-ans;
			else
				return 0;
		}
	
		private static boolean isWhitespace(int c) {
			return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
		}
	
		private static boolean isEndOfLine(int c) {
			return c == '\n' || c == '\r' || c == -1;
		}
	
		private static int read() {
			if (numChars == -1)
				throw new InputMismatchException();
			if (curChar >= numChars) {
				curChar = 0;
				try {
					numChars = stream.read(buf);
				} catch (IOException e) {
					throw new InputMismatchException();
				}
				if (numChars <= 0)
					return -1;
			}
			return buf[curChar++];
		}
	
		private static int nextInt() {
			int c = read();
			while (isSpaceChar(c))
				c = read();
			int sgn = 1;
			if (c == '-') {
				sgn = -1;
				c = read();
			}
			int res = 0;
			do {
				if (c < '0' || c > '9')
					throw new InputMismatchException();
				res *= 10;
				res += c - '0';
				c = read();
			} while (!isSpaceChar(c));
			return res * sgn;
		}
	
		private static long nextLong() {
			int c = read();
			while (isSpaceChar(c))
				c = read();
			int sgn = 1;
			if (c == '-') {
				sgn = -1;
				c = read();
			}
			long res = 0;
			do {
				if (c < '0' || c > '9')
					throw new InputMismatchException();
				res *= 10;
				res += c - '0';
				c = read();
			} while (!isSpaceChar(c));
			return res * sgn;
		}
	
		private static String nextToken() {
			int c = read();
			while (isSpaceChar(c))
				c = read();
			StringBuilder res = new StringBuilder();
			do {
				res.appendCodePoint(c);
				c = read();
			} while (!isSpaceChar(c));
			return res.toString();
		}
	
		private static String nextLine() {
			int c = read();
			while (isSpaceChar(c))
				c = read();
			StringBuilder res = new StringBuilder();
			do {
				res.appendCodePoint(c);
				c = read();
			} while (!isEndOfLine(c));
			return res.toString();
		}
	
		private static int[] nextIntArray(int n) {
			int[] arr = new int[n];
			for (int i = 0; i < n; i++) {
				arr[i] = nextInt();
			}
			return arr;
		}
	
		private static long[] nextLongArray(int n) {
			long[] arr = new long[n];
			for (int i = 0; i < n; i++) {
				arr[i] = nextLong();
			}
			return arr;
		}
	
		private static void pArray(int[] arr) {
			for (int i = 0; i < arr.length; i++) {
				System.out.print(arr[i] + " ");
			}
			System.out.println();
			return;
		}
	
		private static void pArray(long[] arr) {
			for (int i = 0; i < arr.length; i++) {
				System.out.print(arr[i] + " ");
			}
			System.out.println();
			return;
		}
	
		private static boolean isSpaceChar(int c) {
			if (filter != null)
				return filter.isSpaceChar(c);
			return isWhitespace(c);
		}
		private static char nextChar() {
			int c = read();
			while (isSpaceChar(c))
				c = read();
			char c1=(char)c;
			while(!isSpaceChar(c))
				c=read();
			return c1;
	}
		private interface SpaceCharFilter {
			public boolean isSpaceChar(int ch);
		}
	}