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.*;
//import java.text.*;

public class Main{
    final long MOD = (long)1e9+7, IINF = (long)1e19;
    final int MAX = (int)500001, MX = (int)1e7+1, INF = (int)1e9;
//    DecimalFormat df = new DecimalFormat("0.00000000");
//    final double EPS = 1e-8;
    FastReader in;
    PrintWriter out;
    boolean multipleTC = false;
    
    public static void main(String[] args) throws Exception{new Main().run();};
    void run() throws Exception{
        in = new FastReader();
        out = new PrintWriter(System.out);
        for(int i = 1, t = (multipleTC)?ni():1; i<=t; i++)solve(i);
        out.flush();    
        out.close();
    }
    
    void solve(int TC){
        String[][] a = new String[][]{
            {"Power", "purple"},
            {"Time", "green"},
            {"Space", "blue"},
            {"Soul", "orange"},
            {"Reality", "red"},
            {"Mind", "yellow"}
        };
        boolean[] m = new boolean[6];
        int n = ni();
        for(int i = 0; i< n; i++){
            String s = n();
            for(int j = 0; j< 6; j++)if(a[j][1].equals(s))m[j] = true;
        }
        String[] an = new String[6];int c= 0;
        for(int i = 0; i< 6; i++)if(!m[i])an[c++] = a[i][0];
        pn(c);
        for(int i = 0; i< c; i++)pn(an[i]);
    }
    
    long modPow(long a, long p){
        long o = 1;
        while(p>0){
            if(p%2==1)o = mul(o,a);
            a = mul(a,a);
            p>>=1;
        }
        return o;
    }
    
    long mul(long a, long b){
        if(a>=MOD)a%=MOD;
        if(b>=MOD)b%=MOD;
        return (a*b)%MOD;
    }
    
    int[] reverse(int[] a){
        int[] o = new int[a.length];
        for(int i = 0; i< a.length; i++)o[i] = a[a.length-i-1];
        return o;   
    }
    
    int[] sort(int[] a){
        if(a.length==1)return a;
        int mid = a.length/2;
        int[] b = sort(Arrays.copyOfRange(a,0,mid)), c = sort(Arrays.copyOfRange(a,mid,a.length));
        for(int i = 0, j = 0, k = 0; i< a.length; i++){
            if(j<b.length && k<c.length){
                if(b[j]<c[k])a[i] = b[j++];
                else a[i] = c[k++];
            }else if(j<b.length)a[i] = b[j++];
            else a[i] = c[k++];
        }
        return a;
    }
    
    long[] sort(long[] a){
        if(a.length==1)return a;
        int mid = a.length/2;
        long[] b = sort(Arrays.copyOfRange(a,0,mid)), c = sort(Arrays.copyOfRange(a,mid,a.length));
        for(int i = 0, j = 0, k = 0; i< a.length; i++){
            if(j<b.length && k<c.length){
                if(b[j]<c[k])a[i] = b[j++];
                else a[i] = c[k++];
            }else if(j<b.length)a[i] = b[j++];
            else a[i] = c[k++];
        }
        return a;
    }
    
    int[] ia(int ind,int n){
        int[] out = new int[ind+n];
        for(int i = 0; i< n; i++)out[ind+i] = ni();
        return out;
    }

    long[] la(int ind, int n){
        long[] out = new long[ind+n];
        for(int i = 0; i< n; i++)out[ind+i] = nl();
        return out;
    }

    long gcd(long a, long b){return (b==0)?a:gcd(b,a%b);}
    int gcd(int a, int b){return (b==0)?a:gcd(b,a%b);}
    int bitcount(long n){return (n==0)?0:(1+bitcount(n&(n-1)));}
    void p(Object o){out.print(o);}
    void pn(Object o){out.println(o);}
    void pni(Object o){out.println(o);out.flush();}
    String n(){return in.next();}
    String nln(){return in.nextLine();}
    int ni(){return Integer.parseInt(in.next());}
    long nl(){return Long.parseLong(in.next());}
    double nd(){return Double.parseDouble(in.next());}

    class FastReader{
        BufferedReader br;
        StringTokenizer st;
        public FastReader(){
            br = new BufferedReader(new InputStreamReader(System.in));
        }

        public FastReader(String s) throws Exception{
            br = new BufferedReader(new FileReader(s));
        }

        String next(){
            while (st == null || !st.hasMoreElements()){
                try{
                    st = new StringTokenizer(br.readLine());
                }catch (IOException  e){
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        String nextLine(){
            String str = "";
            try{
                str = br.readLine();
            }catch (IOException e){
                e.printStackTrace();
            }
            return str;
        }
    }
}