As you know, Hogwarts has four houses: Gryffindor, Hufflepuff, Ravenclaw and Slytherin. The sorting of the first-years into houses is done by the Sorting Hat. The pupils are called one by one in the alphabetical order, each of them should put a hat on his head and, after some thought, the hat solemnly announces the name of the house the student should enter.

At that the Hat is believed to base its considerations on the student's personal qualities: it sends the brave and noble ones to Gryffindor, the smart and shrewd ones — to Ravenclaw, the persistent and honest ones — to Hufflepuff and the clever and cunning ones — to Slytherin. However, a first year student Hermione Granger got very concerned about the forthcoming sorting. She studied all the literature on the Sorting Hat and came to the conclusion that it is much simpler than that. If the relatives of the student have already studied at Hogwarts, the hat puts the student to the same house, where his family used to study. In controversial situations, when the relatives studied in different houses or when they were all Muggles like Hermione's parents, then the Hat sorts the student to the house, to which the least number of first years has been sent at that moment. If there are several such houses, the choice is given to the student himself. Then the student can choose any of the houses, to which the least number of first years has been sent so far. 

Hermione has already asked the students that are on the list before her about their relatives. Now she and her new friends Harry Potter and Ron Weasley want to find out into what house the Hat will put Hermione.

Input

The first input line contains an integer n (1 ≤ n ≤ 10000). It is the number of students who are in the list before Hermione. The next line contains n symbols. If all the relatives of a student used to study in the same house, then the i-th character in the string coincides with the first letter of the name of this house. Otherwise, the i-th symbol is equal to "?".

Output

Print all the possible houses where Hermione can be sent. The names of the houses should be printed in the alphabetical order, one per line.

Examples

Input

11
G????SS???H


Output

Gryffindor
Ravenclaw


Input

2
H?


Output

Gryffindor
Ravenclaw
Slytherin

Note

Consider the second example. There are only two students before Hermione. The first student is sent to Hufflepuff. The second disciple is given the choice between the houses where the least number of students has been sent, i.e. Gryffindor, Slytherin and Ravenclaw. If he chooses Gryffindor, Hermione is forced to choose between Ravenclaw and Slytherin, if he chooses Ravenclaw, Hermione will choose between Gryffindor and Slytherin, if he chooses Slytherin, Hermione will choose between Gryffindor and Ravenclaw. In the end, the following situation is possible (it depends on the choice of the second student and Hermione). Hermione will end up 1) in Gryffindor, 2) in Ravenclaw, 3) in Slytherin. Note that, despite the fact that in neither case Hermione will be given a choice between all the three options, they are all possible and they should all be printed in the answer. Hermione will not, under any circumstances, end up in Hufflepuff.

import java.util.*;
import java.math.*;
import static java.lang.Character.isDigit;
import static java.lang.Character.isLowerCase;
import static java.lang.Character.isUpperCase;
import static java.lang.Math.*;
import static java.math.BigInteger.*;
import static java.util.Arrays.*;
import static java.util.Collections.*;
import static java.lang.Character.isDigit;

public class Main{
    static void debug(Object...os){
        System.err.println(deepToString(os));
    }
    
    void run(){
        n=nextInt();
        cs=next().toCharArray();
        int res=solve();
        for(int i=0;i<4;i++){
            if((res>>i&1)==1){
                System.out.println(SS[i]);
            }
        }
    }
    int n;
    char[] cs;
    String[] SS={"Gryffindor","Hufflepuff","Ravenclaw","Slytherin"};
    String S="GHRS";
    
    class Array{
        int[] is;
        Array(int[] is){
            this.is=is;
        }
        public int hashCode(){
            return Arrays.hashCode(is);
        }
        public boolean equals(Object obj){
            Array other=(Array)obj;
            if(!Arrays.equals(is,other.is)) return false;
            return true;
        }
    }
    
    int solve(){
        Array init=new Array(new int[4]);
        HashSet<Array>[] sets=new HashSet[2];
        for(int i=0;i<2;i++)
            sets[i]=new HashSet<Array>();
        sets[0].add(init);
        for(int i=0;i<n;i++){
            int cur=i%2,nxt=(i+1)%2;
            sets[nxt].clear();
            for(Array a:sets[cur]){
                if(cs[i]=='?'){
                    int min=Integer.MAX_VALUE;
                    for(int j=0;j<4;j++)
                        min=min(min,a.is[j]);
                    for(int j=0;j<4;j++)
                        if(a.is[j]==min){
                            int[] is=a.is.clone();
                            is[j]++;
                            sets[nxt].add(new Array(is));
                        }
                }else {
                    int[] is = a.is.clone();
                    is[S.indexOf(cs[i])]++;
                    sets[nxt].add(new Array(is));
                }
            }
        }
        
        int res=0;
        for(Array a:sets[n%2]){
            int min=Integer.MAX_VALUE;
            for(int j=0;j<4;j++)
                min=min(min,a.is[j]);
            for(int j=0;j<4;j++)
                if(a.is[j]==min){
                    res|=1<<j;
                }
        }
        return res;
    }
    
    int nextInt(){
        try{
            int c=System.in.read();
            if(c==-1) return c;
            while(c!='-'&&(c<'0'||'9'<c)){
                c=System.in.read();
                if(c==-1) return c;
            }
            if(c=='-') return -nextInt();
            int res=0;
            do{
                res*=10;
                res+=c-'0';
                c=System.in.read();
            }while('0'<=c&&c<='9');
            return res;
        }catch(Exception e){
            return -1;
        }
    }
    
    long nextLong(){
        try{
            int c=System.in.read();
            if(c==-1) return -1;
            while(c!='-'&&(c<'0'||'9'<c)){
                c=System.in.read();
                if(c==-1) return -1;
            }
            if(c=='-') return -nextLong();
            long res=0;
            do{
                res*=10;
                res+=c-'0';
                c=System.in.read();
            }while('0'<=c&&c<='9');
            return res;
        }catch(Exception e){
            return -1;
        }
    }
    
    double nextDouble(){
        return Double.parseDouble(next());
    }
    
    String next(){
        try{
            StringBuilder res=new StringBuilder("");
            int c=System.in.read();
            while(Character.isWhitespace(c))
                c=System.in.read();
            do{
                res.append((char)c);
            }while(!Character.isWhitespace(c=System.in.read()));
            return res.toString();
        }catch(Exception e){
            return null;
        }
    }
    
    String nextLine(){
        try{
            StringBuilder res=new StringBuilder("");
            int c=System.in.read();
            while(c=='\r'||c=='\n')
                c=System.in.read();
            do{
                res.append((char)c);
                c=System.in.read();
            }while(c!='\r'&&c!='\n');
            return res.toString();
        }catch(Exception e){
            return null;
        }
    }
    public static void main(String[] args){
        new Main().run();
    }
}
