import java.util.Scanner;
class Main {
	private static int[] S = {0,1,2,3,4,5,6,7,8,9,10,11,12,13};
	private static int[] H = {0,1,2,3,4,5,6,7,8,9,10,11,12,13};
	private static int[] C = {0,1,2,3,4,5,6,7,8,9,10,11,12,13};
	private static int[] D = {0,1,2,3,4,5,6,7,8,9,10,11,12,13};
	public void kami() {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		for(int i = 1; i <= n; i++){
			String j = sc.next();
			if(j.equals("S")){
				int J = sc.nextInt();
				switch(J){
				case 1:
					S[J] = S[J] - J;
				case 2:
					S[J] = S[J] - J;
				case 3:
					S[J] = S[J] - J;
				case 4:
					S[J] = S[J] - J;
				case 5:
					S[J] = S[J] - J;
				case 6:
					S[J] = S[J] - J;
				case 7:
					S[J] = S[J] - J;
				case 8:
					S[J] = S[J] - J;
				case 9:
					S[J] = S[J] - J;
				case 10:
					S[J] = S[J] - J;
				case 11:
					S[J] = S[J] - J;
				case 12:
					S[J] = S[J] - J;
				case 13:
					S[J] = S[J] - J;
				}
			}else if(j.equals("H")){
				int J = sc.nextInt();
				switch(J){
				case 1:
					H[J] = H[J] - J;
				case 2:
					H[J] = H[J] - J;
				case 3:
					H[J] = H[J] - J;
				case 4:
					H[J] = H[J] - J;
				case 5:
					H[J] = H[J] - J;
				case 6:
					H[J] = H[J] - J;
				case 7:
					H[J] = H[J] - J;
				case 8:
					H[J] = H[J] - J;
				case 9:
					H[J] = H[J] - J;
				case 10:
					H[J] = H[J] - J;
				case 11:
					H[J] = H[J] - J;
				case 12:
					H[J] = H[J] - J;
				case 13:
					H[J] = H[J] - J;
				}
			}else if(j.equals("C")){
				int J = sc.nextInt();
				switch(J){
				case 1:
					C[J] = C[J] - J;
				case 2:
					C[J] = C[J] - J;
				case 3:
					C[J] = C[J] - J;
				case 4:
					C[J] = C[J] - J;
				case 5:
					C[J] = C[J] - J;
				case 6:
					C[J] = C[J] - J;
				case 7:
					C[J] = C[J] - J;
				case 8:
					C[J] = C[J] - J;
				case 9:
					C[J] = C[J] - J;
				case 10:
					C[J] = C[J] - J;
				case 11:
					C[J] = C[J] - J;
				case 12:
					C[J] = C[J] - J;
				case 13:
					C[J] = C[J] - J;
				}
			}else if(j.equals("D")){
				int J = sc.nextInt();
				switch(J){
				case 1:
					D[J] = D[J] - J;
				case 2:
					D[J] = D[J] - J;
				case 3:
					D[J] = D[J] - J;
				case 4:
					D[J] = D[J] - J;
				case 5:
					D[J] = D[J] - J;
				case 6:
					D[J] = D[J] - J;
				case 7:
					D[J] = D[J] - J;
				case 8:
					D[J] = D[J] - J;
				case 9:
					D[J] = D[J] - J;
				case 10:
					D[J] = D[J] - J;
				case 11:
					D[J] = D[J] - J;
				case 12:
					D[J] = D[J] - J;
				case 13:
					D[J] = D[J] - J;
				}
			}
		}
		for(int x = 1; x <= 13; x++){
			if(S[x] > 0){
				System.out.println("S " + S[x]);
			}
		}
		for(int x = 1; x <= 13; x++){
			if(H[x] > 0){
				System.out.println("H " + H[x]);
			}
		}
		for(int x = 1; x <= 13; x++){
			if(C[x] > 0){
				System.out.println("C " + C[x]);
			}
		}
		for(int x = 1; x <= 13; x++){
			if(D[x] > 0){
				System.out.println("D " + D[x]);
			}
		}
	}

	public static void main(String[] args) {

		new Main().kami();
	}

} import java.util.Scanner; Scanner java.util class Main {
	private static int[] S = {0,1,2,3,4,5,6,7,8,9,10,11,12,13};
	private static int[] H = {0,1,2,3,4,5,6,7,8,9,10,11,12,13};
	private static int[] C = {0,1,2,3,4,5,6,7,8,9,10,11,12,13};
	private static int[] D = {0,1,2,3,4,5,6,7,8,9,10,11,12,13};
	public void kami() {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		for(int i = 1; i <= n; i++){
			String j = sc.next();
			if(j.equals("S")){
				int J = sc.nextInt();
				switch(J){
				case 1:
					S[J] = S[J] - J;
				case 2:
					S[J] = S[J] - J;
				case 3:
					S[J] = S[J] - J;
				case 4:
					S[J] = S[J] - J;
				case 5:
					S[J] = S[J] - J;
				case 6:
					S[J] = S[J] - J;
				case 7:
					S[J] = S[J] - J;
				case 8:
					S[J] = S[J] - J;
				case 9:
					S[J] = S[J] - J;
				case 10:
					S[J] = S[J] - J;
				case 11:
					S[J] = S[J] - J;
				case 12:
					S[J] = S[J] - J;
				case 13:
					S[J] = S[J] - J;
				}
			}else if(j.equals("H")){
				int J = sc.nextInt();
				switch(J){
				case 1:
					H[J] = H[J] - J;
				case 2:
					H[J] = H[J] - J;
				case 3:
					H[J] = H[J] - J;
				case 4:
					H[J] = H[J] - J;
				case 5:
					H[J] = H[J] - J;
				case 6:
					H[J] = H[J] - J;
				case 7:
					H[J] = H[J] - J;
				case 8:
					H[J] = H[J] - J;
				case 9:
					H[J] = H[J] - J;
				case 10:
					H[J] = H[J] - J;
				case 11:
					H[J] = H[J] - J;
				case 12:
					H[J] = H[J] - J;
				case 13:
					H[J] = H[J] - J;
				}
			}else if(j.equals("C")){
				int J = sc.nextInt();
				switch(J){
				case 1:
					C[J] = C[J] - J;
				case 2:
					C[J] = C[J] - J;
				case 3:
					C[J] = C[J] - J;
				case 4:
					C[J] = C[J] - J;
				case 5:
					C[J] = C[J] - J;
				case 6:
					C[J] = C[J] - J;
				case 7:
					C[J] = C[J] - J;
				case 8:
					C[J] = C[J] - J;
				case 9:
					C[J] = C[J] - J;
				case 10:
					C[J] = C[J] - J;
				case 11:
					C[J] = C[J] - J;
				case 12:
					C[J] = C[J] - J;
				case 13:
					C[J] = C[J] - J;
				}
			}else if(j.equals("D")){
				int J = sc.nextInt();
				switch(J){
				case 1:
					D[J] = D[J] - J;
				case 2:
					D[J] = D[J] - J;
				case 3:
					D[J] = D[J] - J;
				case 4:
					D[J] = D[J] - J;
				case 5:
					D[J] = D[J] - J;
				case 6:
					D[J] = D[J] - J;
				case 7:
					D[J] = D[J] - J;
				case 8:
					D[J] = D[J] - J;
				case 9:
					D[J] = D[J] - J;
				case 10:
					D[J] = D[J] - J;
				case 11:
					D[J] = D[J] - J;
				case 12:
					D[J] = D[J] - J;
				case 13:
					D[J] = D[J] - J;
				}
			}
		}
		for(int x = 1; x <= 13; x++){
			if(S[x] > 0){
				System.out.println("S " + S[x]);
			}
		}
		for(int x = 1; x <= 13; x++){
			if(H[x] > 0){
				System.out.println("H " + H[x]);
			}
		}
		for(int x = 1; x <= 13; x++){
			if(C[x] > 0){
				System.out.println("C " + C[x]);
			}
		}
		for(int x = 1; x <= 13; x++){
			if(D[x] > 0){
				System.out.println("D " + D[x]);
			}
		}
	}

	public static void main(String[] args) {

		new Main().kami();
	}

} Main private static int[] S = {0,1,2,3,4,5,6,7,8,9,10,11,12,13}; S {0,1,2,3,4,5,6,7,8,9,10,11,12,13} 0 1 2 3 4 5 6 7 8 9 10 11 12 13 private static int[] H = {0,1,2,3,4,5,6,7,8,9,10,11,12,13}; H {0,1,2,3,4,5,6,7,8,9,10,11,12,13} 0 1 2 3 4 5 6 7 8 9 10 11 12 13 private static int[] C = {0,1,2,3,4,5,6,7,8,9,10,11,12,13}; C {0,1,2,3,4,5,6,7,8,9,10,11,12,13} 0 1 2 3 4 5 6 7 8 9 10 11 12 13 private static int[] D = {0,1,2,3,4,5,6,7,8,9,10,11,12,13}; D {0,1,2,3,4,5,6,7,8,9,10,11,12,13} 0 1 2 3 4 5 6 7 8 9 10 11 12 13 public void kami() {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		for(int i = 1; i <= n; i++){
			String j = sc.next();
			if(j.equals("S")){
				int J = sc.nextInt();
				switch(J){
				case 1:
					S[J] = S[J] - J;
				case 2:
					S[J] = S[J] - J;
				case 3:
					S[J] = S[J] - J;
				case 4:
					S[J] = S[J] - J;
				case 5:
					S[J] = S[J] - J;
				case 6:
					S[J] = S[J] - J;
				case 7:
					S[J] = S[J] - J;
				case 8:
					S[J] = S[J] - J;
				case 9:
					S[J] = S[J] - J;
				case 10:
					S[J] = S[J] - J;
				case 11:
					S[J] = S[J] - J;
				case 12:
					S[J] = S[J] - J;
				case 13:
					S[J] = S[J] - J;
				}
			}else if(j.equals("H")){
				int J = sc.nextInt();
				switch(J){
				case 1:
					H[J] = H[J] - J;
				case 2:
					H[J] = H[J] - J;
				case 3:
					H[J] = H[J] - J;
				case 4:
					H[J] = H[J] - J;
				case 5:
					H[J] = H[J] - J;
				case 6:
					H[J] = H[J] - J;
				case 7:
					H[J] = H[J] - J;
				case 8:
					H[J] = H[J] - J;
				case 9:
					H[J] = H[J] - J;
				case 10:
					H[J] = H[J] - J;
				case 11:
					H[J] = H[J] - J;
				case 12:
					H[J] = H[J] - J;
				case 13:
					H[J] = H[J] - J;
				}
			}else if(j.equals("C")){
				int J = sc.nextInt();
				switch(J){
				case 1:
					C[J] = C[J] - J;
				case 2:
					C[J] = C[J] - J;
				case 3:
					C[J] = C[J] - J;
				case 4:
					C[J] = C[J] - J;
				case 5:
					C[J] = C[J] - J;
				case 6:
					C[J] = C[J] - J;
				case 7:
					C[J] = C[J] - J;
				case 8:
					C[J] = C[J] - J;
				case 9:
					C[J] = C[J] - J;
				case 10:
					C[J] = C[J] - J;
				case 11:
					C[J] = C[J] - J;
				case 12:
					C[J] = C[J] - J;
				case 13:
					C[J] = C[J] - J;
				}
			}else if(j.equals("D")){
				int J = sc.nextInt();
				switch(J){
				case 1:
					D[J] = D[J] - J;
				case 2:
					D[J] = D[J] - J;
				case 3:
					D[J] = D[J] - J;
				case 4:
					D[J] = D[J] - J;
				case 5:
					D[J] = D[J] - J;
				case 6:
					D[J] = D[J] - J;
				case 7:
					D[J] = D[J] - J;
				case 8:
					D[J] = D[J] - J;
				case 9:
					D[J] = D[J] - J;
				case 10:
					D[J] = D[J] - J;
				case 11:
					D[J] = D[J] - J;
				case 12:
					D[J] = D[J] - J;
				case 13:
					D[J] = D[J] - J;
				}
			}
		}
		for(int x = 1; x <= 13; x++){
			if(S[x] > 0){
				System.out.println("S " + S[x]);
			}
		}
		for(int x = 1; x <= 13; x++){
			if(H[x] > 0){
				System.out.println("H " + H[x]);
			}
		}
		for(int x = 1; x <= 13; x++){
			if(C[x] > 0){
				System.out.println("C " + C[x]);
			}
		}
		for(int x = 1; x <= 13; x++){
			if(D[x] > 0){
				System.out.println("D " + D[x]);
			}
		}
	} kami {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		for(int i = 1; i <= n; i++){
			String j = sc.next();
			if(j.equals("S")){
				int J = sc.nextInt();
				switch(J){
				case 1:
					S[J] = S[J] - J;
				case 2:
					S[J] = S[J] - J;
				case 3:
					S[J] = S[J] - J;
				case 4:
					S[J] = S[J] - J;
				case 5:
					S[J] = S[J] - J;
				case 6:
					S[J] = S[J] - J;
				case 7:
					S[J] = S[J] - J;
				case 8:
					S[J] = S[J] - J;
				case 9:
					S[J] = S[J] - J;
				case 10:
					S[J] = S[J] - J;
				case 11:
					S[J] = S[J] - J;
				case 12:
					S[J] = S[J] - J;
				case 13:
					S[J] = S[J] - J;
				}
			}else if(j.equals("H")){
				int J = sc.nextInt();
				switch(J){
				case 1:
					H[J] = H[J] - J;
				case 2:
					H[J] = H[J] - J;
				case 3:
					H[J] = H[J] - J;
				case 4:
					H[J] = H[J] - J;
				case 5:
					H[J] = H[J] - J;
				case 6:
					H[J] = H[J] - J;
				case 7:
					H[J] = H[J] - J;
				case 8:
					H[J] = H[J] - J;
				case 9:
					H[J] = H[J] - J;
				case 10:
					H[J] = H[J] - J;
				case 11:
					H[J] = H[J] - J;
				case 12:
					H[J] = H[J] - J;
				case 13:
					H[J] = H[J] - J;
				}
			}else if(j.equals("C")){
				int J = sc.nextInt();
				switch(J){
				case 1:
					C[J] = C[J] - J;
				case 2:
					C[J] = C[J] - J;
				case 3:
					C[J] = C[J] - J;
				case 4:
					C[J] = C[J] - J;
				case 5:
					C[J] = C[J] - J;
				case 6:
					C[J] = C[J] - J;
				case 7:
					C[J] = C[J] - J;
				case 8:
					C[J] = C[J] - J;
				case 9:
					C[J] = C[J] - J;
				case 10:
					C[J] = C[J] - J;
				case 11:
					C[J] = C[J] - J;
				case 12:
					C[J] = C[J] - J;
				case 13:
					C[J] = C[J] - J;
				}
			}else if(j.equals("D")){
				int J = sc.nextInt();
				switch(J){
				case 1:
					D[J] = D[J] - J;
				case 2:
					D[J] = D[J] - J;
				case 3:
					D[J] = D[J] - J;
				case 4:
					D[J] = D[J] - J;
				case 5:
					D[J] = D[J] - J;
				case 6:
					D[J] = D[J] - J;
				case 7:
					D[J] = D[J] - J;
				case 8:
					D[J] = D[J] - J;
				case 9:
					D[J] = D[J] - J;
				case 10:
					D[J] = D[J] - J;
				case 11:
					D[J] = D[J] - J;
				case 12:
					D[J] = D[J] - J;
				case 13:
					D[J] = D[J] - J;
				}
			}
		}
		for(int x = 1; x <= 13; x++){
			if(S[x] > 0){
				System.out.println("S " + S[x]);
			}
		}
		for(int x = 1; x <= 13; x++){
			if(H[x] > 0){
				System.out.println("H " + H[x]);
			}
		}
		for(int x = 1; x <= 13; x++){
			if(C[x] > 0){
				System.out.println("C " + C[x]);
			}
		}
		for(int x = 1; x <= 13; x++){
			if(D[x] > 0){
				System.out.println("D " + D[x]);
			}
		}
	} Scanner sc = new Scanner(System.in); sc new Scanner(System.in) int n = sc.nextInt(); n sc.nextInt() sc.nextInt sc for(int i = 1; i <= n; i++){
			String j = sc.next();
			if(j.equals("S")){
				int J = sc.nextInt();
				switch(J){
				case 1:
					S[J] = S[J] - J;
				case 2:
					S[J] = S[J] - J;
				case 3:
					S[J] = S[J] - J;
				case 4:
					S[J] = S[J] - J;
				case 5:
					S[J] = S[J] - J;
				case 6:
					S[J] = S[J] - J;
				case 7:
					S[J] = S[J] - J;
				case 8:
					S[J] = S[J] - J;
				case 9:
					S[J] = S[J] - J;
				case 10:
					S[J] = S[J] - J;
				case 11:
					S[J] = S[J] - J;
				case 12:
					S[J] = S[J] - J;
				case 13:
					S[J] = S[J] - J;
				}
			}else if(j.equals("H")){
				int J = sc.nextInt();
				switch(J){
				case 1:
					H[J] = H[J] - J;
				case 2:
					H[J] = H[J] - J;
				case 3:
					H[J] = H[J] - J;
				case 4:
					H[J] = H[J] - J;
				case 5:
					H[J] = H[J] - J;
				case 6:
					H[J] = H[J] - J;
				case 7:
					H[J] = H[J] - J;
				case 8:
					H[J] = H[J] - J;
				case 9:
					H[J] = H[J] - J;
				case 10:
					H[J] = H[J] - J;
				case 11:
					H[J] = H[J] - J;
				case 12:
					H[J] = H[J] - J;
				case 13:
					H[J] = H[J] - J;
				}
			}else if(j.equals("C")){
				int J = sc.nextInt();
				switch(J){
				case 1:
					C[J] = C[J] - J;
				case 2:
					C[J] = C[J] - J;
				case 3:
					C[J] = C[J] - J;
				case 4:
					C[J] = C[J] - J;
				case 5:
					C[J] = C[J] - J;
				case 6:
					C[J] = C[J] - J;
				case 7:
					C[J] = C[J] - J;
				case 8:
					C[J] = C[J] - J;
				case 9:
					C[J] = C[J] - J;
				case 10:
					C[J] = C[J] - J;
				case 11:
					C[J] = C[J] - J;
				case 12:
					C[J] = C[J] - J;
				case 13:
					C[J] = C[J] - J;
				}
			}else if(j.equals("D")){
				int J = sc.nextInt();
				switch(J){
				case 1:
					D[J] = D[J] - J;
				case 2:
					D[J] = D[J] - J;
				case 3:
					D[J] = D[J] - J;
				case 4:
					D[J] = D[J] - J;
				case 5:
					D[J] = D[J] - J;
				case 6:
					D[J] = D[J] - J;
				case 7:
					D[J] = D[J] - J;
				case 8:
					D[J] = D[J] - J;
				case 9:
					D[J] = D[J] - J;
				case 10:
					D[J] = D[J] - J;
				case 11:
					D[J] = D[J] - J;
				case 12:
					D[J] = D[J] - J;
				case 13:
					D[J] = D[J] - J;
				}
			}
		} int i = 1; int i = 1; i 1 i <= n i n i++ i++ i {
			String j = sc.next();
			if(j.equals("S")){
				int J = sc.nextInt();
				switch(J){
				case 1:
					S[J] = S[J] - J;
				case 2:
					S[J] = S[J] - J;
				case 3:
					S[J] = S[J] - J;
				case 4:
					S[J] = S[J] - J;
				case 5:
					S[J] = S[J] - J;
				case 6:
					S[J] = S[J] - J;
				case 7:
					S[J] = S[J] - J;
				case 8:
					S[J] = S[J] - J;
				case 9:
					S[J] = S[J] - J;
				case 10:
					S[J] = S[J] - J;
				case 11:
					S[J] = S[J] - J;
				case 12:
					S[J] = S[J] - J;
				case 13:
					S[J] = S[J] - J;
				}
			}else if(j.equals("H")){
				int J = sc.nextInt();
				switch(J){
				case 1:
					H[J] = H[J] - J;
				case 2:
					H[J] = H[J] - J;
				case 3:
					H[J] = H[J] - J;
				case 4:
					H[J] = H[J] - J;
				case 5:
					H[J] = H[J] - J;
				case 6:
					H[J] = H[J] - J;
				case 7:
					H[J] = H[J] - J;
				case 8:
					H[J] = H[J] - J;
				case 9:
					H[J] = H[J] - J;
				case 10:
					H[J] = H[J] - J;
				case 11:
					H[J] = H[J] - J;
				case 12:
					H[J] = H[J] - J;
				case 13:
					H[J] = H[J] - J;
				}
			}else if(j.equals("C")){
				int J = sc.nextInt();
				switch(J){
				case 1:
					C[J] = C[J] - J;
				case 2:
					C[J] = C[J] - J;
				case 3:
					C[J] = C[J] - J;
				case 4:
					C[J] = C[J] - J;
				case 5:
					C[J] = C[J] - J;
				case 6:
					C[J] = C[J] - J;
				case 7:
					C[J] = C[J] - J;
				case 8:
					C[J] = C[J] - J;
				case 9:
					C[J] = C[J] - J;
				case 10:
					C[J] = C[J] - J;
				case 11:
					C[J] = C[J] - J;
				case 12:
					C[J] = C[J] - J;
				case 13:
					C[J] = C[J] - J;
				}
			}else if(j.equals("D")){
				int J = sc.nextInt();
				switch(J){
				case 1:
					D[J] = D[J] - J;
				case 2:
					D[J] = D[J] - J;
				case 3:
					D[J] = D[J] - J;
				case 4:
					D[J] = D[J] - J;
				case 5:
					D[J] = D[J] - J;
				case 6:
					D[J] = D[J] - J;
				case 7:
					D[J] = D[J] - J;
				case 8:
					D[J] = D[J] - J;
				case 9:
					D[J] = D[J] - J;
				case 10:
					D[J] = D[J] - J;
				case 11:
					D[J] = D[J] - J;
				case 12:
					D[J] = D[J] - J;
				case 13:
					D[J] = D[J] - J;
				}
			}
		} {
			String j = sc.next();
			if(j.equals("S")){
				int J = sc.nextInt();
				switch(J){
				case 1:
					S[J] = S[J] - J;
				case 2:
					S[J] = S[J] - J;
				case 3:
					S[J] = S[J] - J;
				case 4:
					S[J] = S[J] - J;
				case 5:
					S[J] = S[J] - J;
				case 6:
					S[J] = S[J] - J;
				case 7:
					S[J] = S[J] - J;
				case 8:
					S[J] = S[J] - J;
				case 9:
					S[J] = S[J] - J;
				case 10:
					S[J] = S[J] - J;
				case 11:
					S[J] = S[J] - J;
				case 12:
					S[J] = S[J] - J;
				case 13:
					S[J] = S[J] - J;
				}
			}else if(j.equals("H")){
				int J = sc.nextInt();
				switch(J){
				case 1:
					H[J] = H[J] - J;
				case 2:
					H[J] = H[J] - J;
				case 3:
					H[J] = H[J] - J;
				case 4:
					H[J] = H[J] - J;
				case 5:
					H[J] = H[J] - J;
				case 6:
					H[J] = H[J] - J;
				case 7:
					H[J] = H[J] - J;
				case 8:
					H[J] = H[J] - J;
				case 9:
					H[J] = H[J] - J;
				case 10:
					H[J] = H[J] - J;
				case 11:
					H[J] = H[J] - J;
				case 12:
					H[J] = H[J] - J;
				case 13:
					H[J] = H[J] - J;
				}
			}else if(j.equals("C")){
				int J = sc.nextInt();
				switch(J){
				case 1:
					C[J] = C[J] - J;
				case 2:
					C[J] = C[J] - J;
				case 3:
					C[J] = C[J] - J;
				case 4:
					C[J] = C[J] - J;
				case 5:
					C[J] = C[J] - J;
				case 6:
					C[J] = C[J] - J;
				case 7:
					C[J] = C[J] - J;
				case 8:
					C[J] = C[J] - J;
				case 9:
					C[J] = C[J] - J;
				case 10:
					C[J] = C[J] - J;
				case 11:
					C[J] = C[J] - J;
				case 12:
					C[J] = C[J] - J;
				case 13:
					C[J] = C[J] - J;
				}
			}else if(j.equals("D")){
				int J = sc.nextInt();
				switch(J){
				case 1:
					D[J] = D[J] - J;
				case 2:
					D[J] = D[J] - J;
				case 3:
					D[J] = D[J] - J;
				case 4:
					D[J] = D[J] - J;
				case 5:
					D[J] = D[J] - J;
				case 6:
					D[J] = D[J] - J;
				case 7:
					D[J] = D[J] - J;
				case 8:
					D[J] = D[J] - J;
				case 9:
					D[J] = D[J] - J;
				case 10:
					D[J] = D[J] - J;
				case 11:
					D[J] = D[J] - J;
				case 12:
					D[J] = D[J] - J;
				case 13:
					D[J] = D[J] - J;
				}
			}
		} String j = sc.next(); j sc.next() sc.next sc if(j.equals("S")){
				int J = sc.nextInt();
				switch(J){
				case 1:
					S[J] = S[J] - J;
				case 2:
					S[J] = S[J] - J;
				case 3:
					S[J] = S[J] - J;
				case 4:
					S[J] = S[J] - J;
				case 5:
					S[J] = S[J] - J;
				case 6:
					S[J] = S[J] - J;
				case 7:
					S[J] = S[J] - J;
				case 8:
					S[J] = S[J] - J;
				case 9:
					S[J] = S[J] - J;
				case 10:
					S[J] = S[J] - J;
				case 11:
					S[J] = S[J] - J;
				case 12:
					S[J] = S[J] - J;
				case 13:
					S[J] = S[J] - J;
				}
			}else if(j.equals("H")){
				int J = sc.nextInt();
				switch(J){
				case 1:
					H[J] = H[J] - J;
				case 2:
					H[J] = H[J] - J;
				case 3:
					H[J] = H[J] - J;
				case 4:
					H[J] = H[J] - J;
				case 5:
					H[J] = H[J] - J;
				case 6:
					H[J] = H[J] - J;
				case 7:
					H[J] = H[J] - J;
				case 8:
					H[J] = H[J] - J;
				case 9:
					H[J] = H[J] - J;
				case 10:
					H[J] = H[J] - J;
				case 11:
					H[J] = H[J] - J;
				case 12:
					H[J] = H[J] - J;
				case 13:
					H[J] = H[J] - J;
				}
			}else if(j.equals("C")){
				int J = sc.nextInt();
				switch(J){
				case 1:
					C[J] = C[J] - J;
				case 2:
					C[J] = C[J] - J;
				case 3:
					C[J] = C[J] - J;
				case 4:
					C[J] = C[J] - J;
				case 5:
					C[J] = C[J] - J;
				case 6:
					C[J] = C[J] - J;
				case 7:
					C[J] = C[J] - J;
				case 8:
					C[J] = C[J] - J;
				case 9:
					C[J] = C[J] - J;
				case 10:
					C[J] = C[J] - J;
				case 11:
					C[J] = C[J] - J;
				case 12:
					C[J] = C[J] - J;
				case 13:
					C[J] = C[J] - J;
				}
			}else if(j.equals("D")){
				int J = sc.nextInt();
				switch(J){
				case 1:
					D[J] = D[J] - J;
				case 2:
					D[J] = D[J] - J;
				case 3:
					D[J] = D[J] - J;
				case 4:
					D[J] = D[J] - J;
				case 5:
					D[J] = D[J] - J;
				case 6:
					D[J] = D[J] - J;
				case 7:
					D[J] = D[J] - J;
				case 8:
					D[J] = D[J] - J;
				case 9:
					D[J] = D[J] - J;
				case 10:
					D[J] = D[J] - J;
				case 11:
					D[J] = D[J] - J;
				case 12:
					D[J] = D[J] - J;
				case 13:
					D[J] = D[J] - J;
				}
			} j.equals("S") j.equals j "S" {
				int J = sc.nextInt();
				switch(J){
				case 1:
					S[J] = S[J] - J;
				case 2:
					S[J] = S[J] - J;
				case 3:
					S[J] = S[J] - J;
				case 4:
					S[J] = S[J] - J;
				case 5:
					S[J] = S[J] - J;
				case 6:
					S[J] = S[J] - J;
				case 7:
					S[J] = S[J] - J;
				case 8:
					S[J] = S[J] - J;
				case 9:
					S[J] = S[J] - J;
				case 10:
					S[J] = S[J] - J;
				case 11:
					S[J] = S[J] - J;
				case 12:
					S[J] = S[J] - J;
				case 13:
					S[J] = S[J] - J;
				}
			} int J = sc.nextInt(); J sc.nextInt() sc.nextInt sc switch(J){
				case 1:
					S[J] = S[J] - J;
				case 2:
					S[J] = S[J] - J;
				case 3:
					S[J] = S[J] - J;
				case 4:
					S[J] = S[J] - J;
				case 5:
					S[J] = S[J] - J;
				case 6:
					S[J] = S[J] - J;
				case 7:
					S[J] = S[J] - J;
				case 8:
					S[J] = S[J] - J;
				case 9:
					S[J] = S[J] - J;
				case 10:
					S[J] = S[J] - J;
				case 11:
					S[J] = S[J] - J;
				case 12:
					S[J] = S[J] - J;
				case 13:
					S[J] = S[J] - J;
				} J case 1: 1 case 1: S[J] = S[J] - J S[J] S J S[J] - J S[J] S J J case 2: 2 case 2: S[J] = S[J] - J S[J] S J S[J] - J S[J] S J J case 3: 3 case 3: S[J] = S[J] - J S[J] S J S[J] - J S[J] S J J case 4: 4 case 4: S[J] = S[J] - J S[J] S J S[J] - J S[J] S J J case 5: 5 case 5: S[J] = S[J] - J S[J] S J S[J] - J S[J] S J J case 6: 6 case 6: S[J] = S[J] - J S[J] S J S[J] - J S[J] S J J case 7: 7 case 7: S[J] = S[J] - J S[J] S J S[J] - J S[J] S J J case 8: 8 case 8: S[J] = S[J] - J S[J] S J S[J] - J S[J] S J J case 9: 9 case 9: S[J] = S[J] - J S[J] S J S[J] - J S[J] S J J case 10: 10 case 10: S[J] = S[J] - J S[J] S J S[J] - J S[J] S J J case 11: 11 case 11: S[J] = S[J] - J S[J] S J S[J] - J S[J] S J J case 12: 12 case 12: S[J] = S[J] - J S[J] S J S[J] - J S[J] S J J case 13: 13 case 13: S[J] = S[J] - J S[J] S J S[J] - J S[J] S J J if(j.equals("H")){
				int J = sc.nextInt();
				switch(J){
				case 1:
					H[J] = H[J] - J;
				case 2:
					H[J] = H[J] - J;
				case 3:
					H[J] = H[J] - J;
				case 4:
					H[J] = H[J] - J;
				case 5:
					H[J] = H[J] - J;
				case 6:
					H[J] = H[J] - J;
				case 7:
					H[J] = H[J] - J;
				case 8:
					H[J] = H[J] - J;
				case 9:
					H[J] = H[J] - J;
				case 10:
					H[J] = H[J] - J;
				case 11:
					H[J] = H[J] - J;
				case 12:
					H[J] = H[J] - J;
				case 13:
					H[J] = H[J] - J;
				}
			}else if(j.equals("C")){
				int J = sc.nextInt();
				switch(J){
				case 1:
					C[J] = C[J] - J;
				case 2:
					C[J] = C[J] - J;
				case 3:
					C[J] = C[J] - J;
				case 4:
					C[J] = C[J] - J;
				case 5:
					C[J] = C[J] - J;
				case 6:
					C[J] = C[J] - J;
				case 7:
					C[J] = C[J] - J;
				case 8:
					C[J] = C[J] - J;
				case 9:
					C[J] = C[J] - J;
				case 10:
					C[J] = C[J] - J;
				case 11:
					C[J] = C[J] - J;
				case 12:
					C[J] = C[J] - J;
				case 13:
					C[J] = C[J] - J;
				}
			}else if(j.equals("D")){
				int J = sc.nextInt();
				switch(J){
				case 1:
					D[J] = D[J] - J;
				case 2:
					D[J] = D[J] - J;
				case 3:
					D[J] = D[J] - J;
				case 4:
					D[J] = D[J] - J;
				case 5:
					D[J] = D[J] - J;
				case 6:
					D[J] = D[J] - J;
				case 7:
					D[J] = D[J] - J;
				case 8:
					D[J] = D[J] - J;
				case 9:
					D[J] = D[J] - J;
				case 10:
					D[J] = D[J] - J;
				case 11:
					D[J] = D[J] - J;
				case 12:
					D[J] = D[J] - J;
				case 13:
					D[J] = D[J] - J;
				}
			} j.equals("H") j.equals j "H" {
				int J = sc.nextInt();
				switch(J){
				case 1:
					H[J] = H[J] - J;
				case 2:
					H[J] = H[J] - J;
				case 3:
					H[J] = H[J] - J;
				case 4:
					H[J] = H[J] - J;
				case 5:
					H[J] = H[J] - J;
				case 6:
					H[J] = H[J] - J;
				case 7:
					H[J] = H[J] - J;
				case 8:
					H[J] = H[J] - J;
				case 9:
					H[J] = H[J] - J;
				case 10:
					H[J] = H[J] - J;
				case 11:
					H[J] = H[J] - J;
				case 12:
					H[J] = H[J] - J;
				case 13:
					H[J] = H[J] - J;
				}
			} int J = sc.nextInt(); J sc.nextInt() sc.nextInt sc switch(J){
				case 1:
					H[J] = H[J] - J;
				case 2:
					H[J] = H[J] - J;
				case 3:
					H[J] = H[J] - J;
				case 4:
					H[J] = H[J] - J;
				case 5:
					H[J] = H[J] - J;
				case 6:
					H[J] = H[J] - J;
				case 7:
					H[J] = H[J] - J;
				case 8:
					H[J] = H[J] - J;
				case 9:
					H[J] = H[J] - J;
				case 10:
					H[J] = H[J] - J;
				case 11:
					H[J] = H[J] - J;
				case 12:
					H[J] = H[J] - J;
				case 13:
					H[J] = H[J] - J;
				} J case 1: 1 case 1: H[J] = H[J] - J H[J] H J H[J] - J H[J] H J J case 2: 2 case 2: H[J] = H[J] - J H[J] H J H[J] - J H[J] H J J case 3: 3 case 3: H[J] = H[J] - J H[J] H J H[J] - J H[J] H J J case 4: 4 case 4: H[J] = H[J] - J H[J] H J H[J] - J H[J] H J J case 5: 5 case 5: H[J] = H[J] - J H[J] H J H[J] - J H[J] H J J case 6: 6 case 6: H[J] = H[J] - J H[J] H J H[J] - J H[J] H J J case 7: 7 case 7: H[J] = H[J] - J H[J] H J H[J] - J H[J] H J J case 8: 8 case 8: H[J] = H[J] - J H[J] H J H[J] - J H[J] H J J case 9: 9 case 9: H[J] = H[J] - J H[J] H J H[J] - J H[J] H J J case 10: 10 case 10: H[J] = H[J] - J H[J] H J H[J] - J H[J] H J J case 11: 11 case 11: H[J] = H[J] - J H[J] H J H[J] - J H[J] H J J case 12: 12 case 12: H[J] = H[J] - J H[J] H J H[J] - J H[J] H J J case 13: 13 case 13: H[J] = H[J] - J H[J] H J H[J] - J H[J] H J J if(j.equals("C")){
				int J = sc.nextInt();
				switch(J){
				case 1:
					C[J] = C[J] - J;
				case 2:
					C[J] = C[J] - J;
				case 3:
					C[J] = C[J] - J;
				case 4:
					C[J] = C[J] - J;
				case 5:
					C[J] = C[J] - J;
				case 6:
					C[J] = C[J] - J;
				case 7:
					C[J] = C[J] - J;
				case 8:
					C[J] = C[J] - J;
				case 9:
					C[J] = C[J] - J;
				case 10:
					C[J] = C[J] - J;
				case 11:
					C[J] = C[J] - J;
				case 12:
					C[J] = C[J] - J;
				case 13:
					C[J] = C[J] - J;
				}
			}else if(j.equals("D")){
				int J = sc.nextInt();
				switch(J){
				case 1:
					D[J] = D[J] - J;
				case 2:
					D[J] = D[J] - J;
				case 3:
					D[J] = D[J] - J;
				case 4:
					D[J] = D[J] - J;
				case 5:
					D[J] = D[J] - J;
				case 6:
					D[J] = D[J] - J;
				case 7:
					D[J] = D[J] - J;
				case 8:
					D[J] = D[J] - J;
				case 9:
					D[J] = D[J] - J;
				case 10:
					D[J] = D[J] - J;
				case 11:
					D[J] = D[J] - J;
				case 12:
					D[J] = D[J] - J;
				case 13:
					D[J] = D[J] - J;
				}
			} j.equals("C") j.equals j "C" {
				int J = sc.nextInt();
				switch(J){
				case 1:
					C[J] = C[J] - J;
				case 2:
					C[J] = C[J] - J;
				case 3:
					C[J] = C[J] - J;
				case 4:
					C[J] = C[J] - J;
				case 5:
					C[J] = C[J] - J;
				case 6:
					C[J] = C[J] - J;
				case 7:
					C[J] = C[J] - J;
				case 8:
					C[J] = C[J] - J;
				case 9:
					C[J] = C[J] - J;
				case 10:
					C[J] = C[J] - J;
				case 11:
					C[J] = C[J] - J;
				case 12:
					C[J] = C[J] - J;
				case 13:
					C[J] = C[J] - J;
				}
			} int J = sc.nextInt(); J sc.nextInt() sc.nextInt sc switch(J){
				case 1:
					C[J] = C[J] - J;
				case 2:
					C[J] = C[J] - J;
				case 3:
					C[J] = C[J] - J;
				case 4:
					C[J] = C[J] - J;
				case 5:
					C[J] = C[J] - J;
				case 6:
					C[J] = C[J] - J;
				case 7:
					C[J] = C[J] - J;
				case 8:
					C[J] = C[J] - J;
				case 9:
					C[J] = C[J] - J;
				case 10:
					C[J] = C[J] - J;
				case 11:
					C[J] = C[J] - J;
				case 12:
					C[J] = C[J] - J;
				case 13:
					C[J] = C[J] - J;
				} J case 1: 1 case 1: C[J] = C[J] - J C[J] C J C[J] - J C[J] C J J case 2: 2 case 2: C[J] = C[J] - J C[J] C J C[J] - J C[J] C J J case 3: 3 case 3: C[J] = C[J] - J C[J] C J C[J] - J C[J] C J J case 4: 4 case 4: C[J] = C[J] - J C[J] C J C[J] - J C[J] C J J case 5: 5 case 5: C[J] = C[J] - J C[J] C J C[J] - J C[J] C J J case 6: 6 case 6: C[J] = C[J] - J C[J] C J C[J] - J C[J] C J J case 7: 7 case 7: C[J] = C[J] - J C[J] C J C[J] - J C[J] C J J case 8: 8 case 8: C[J] = C[J] - J C[J] C J C[J] - J C[J] C J J case 9: 9 case 9: C[J] = C[J] - J C[J] C J C[J] - J C[J] C J J case 10: 10 case 10: C[J] = C[J] - J C[J] C J C[J] - J C[J] C J J case 11: 11 case 11: C[J] = C[J] - J C[J] C J C[J] - J C[J] C J J case 12: 12 case 12: C[J] = C[J] - J C[J] C J C[J] - J C[J] C J J case 13: 13 case 13: C[J] = C[J] - J C[J] C J C[J] - J C[J] C J J if(j.equals("D")){
				int J = sc.nextInt();
				switch(J){
				case 1:
					D[J] = D[J] - J;
				case 2:
					D[J] = D[J] - J;
				case 3:
					D[J] = D[J] - J;
				case 4:
					D[J] = D[J] - J;
				case 5:
					D[J] = D[J] - J;
				case 6:
					D[J] = D[J] - J;
				case 7:
					D[J] = D[J] - J;
				case 8:
					D[J] = D[J] - J;
				case 9:
					D[J] = D[J] - J;
				case 10:
					D[J] = D[J] - J;
				case 11:
					D[J] = D[J] - J;
				case 12:
					D[J] = D[J] - J;
				case 13:
					D[J] = D[J] - J;
				}
			} j.equals("D") j.equals j "D" {
				int J = sc.nextInt();
				switch(J){
				case 1:
					D[J] = D[J] - J;
				case 2:
					D[J] = D[J] - J;
				case 3:
					D[J] = D[J] - J;
				case 4:
					D[J] = D[J] - J;
				case 5:
					D[J] = D[J] - J;
				case 6:
					D[J] = D[J] - J;
				case 7:
					D[J] = D[J] - J;
				case 8:
					D[J] = D[J] - J;
				case 9:
					D[J] = D[J] - J;
				case 10:
					D[J] = D[J] - J;
				case 11:
					D[J] = D[J] - J;
				case 12:
					D[J] = D[J] - J;
				case 13:
					D[J] = D[J] - J;
				}
			} int J = sc.nextInt(); J sc.nextInt() sc.nextInt sc switch(J){
				case 1:
					D[J] = D[J] - J;
				case 2:
					D[J] = D[J] - J;
				case 3:
					D[J] = D[J] - J;
				case 4:
					D[J] = D[J] - J;
				case 5:
					D[J] = D[J] - J;
				case 6:
					D[J] = D[J] - J;
				case 7:
					D[J] = D[J] - J;
				case 8:
					D[J] = D[J] - J;
				case 9:
					D[J] = D[J] - J;
				case 10:
					D[J] = D[J] - J;
				case 11:
					D[J] = D[J] - J;
				case 12:
					D[J] = D[J] - J;
				case 13:
					D[J] = D[J] - J;
				} J case 1: 1 case 1: D[J] = D[J] - J D[J] D J D[J] - J D[J] D J J case 2: 2 case 2: D[J] = D[J] - J D[J] D J D[J] - J D[J] D J J case 3: 3 case 3: D[J] = D[J] - J D[J] D J D[J] - J D[J] D J J case 4: 4 case 4: D[J] = D[J] - J D[J] D J D[J] - J D[J] D J J case 5: 5 case 5: D[J] = D[J] - J D[J] D J D[J] - J D[J] D J J case 6: 6 case 6: D[J] = D[J] - J D[J] D J D[J] - J D[J] D J J case 7: 7 case 7: D[J] = D[J] - J D[J] D J D[J] - J D[J] D J J case 8: 8 case 8: D[J] = D[J] - J D[J] D J D[J] - J D[J] D J J case 9: 9 case 9: D[J] = D[J] - J D[J] D J D[J] - J D[J] D J J case 10: 10 case 10: D[J] = D[J] - J D[J] D J D[J] - J D[J] D J J case 11: 11 case 11: D[J] = D[J] - J D[J] D J D[J] - J D[J] D J J case 12: 12 case 12: D[J] = D[J] - J D[J] D J D[J] - J D[J] D J J case 13: 13 case 13: D[J] = D[J] - J D[J] D J D[J] - J D[J] D J J for(int x = 1; x <= 13; x++){
			if(S[x] > 0){
				System.out.println("S " + S[x]);
			}
		} int x = 1; int x = 1; x 1 x <= 13 x 13 x++ x++ x {
			if(S[x] > 0){
				System.out.println("S " + S[x]);
			}
		} {
			if(S[x] > 0){
				System.out.println("S " + S[x]);
			}
		} if(S[x] > 0){
				System.out.println("S " + S[x]);
			} S[x] > 0 S[x] S x 0 {
				System.out.println("S " + S[x]);
			} System.out.println("S " + S[x]) System.out.println System.out System System.out "S " + S[x] "S " S[x] S x for(int x = 1; x <= 13; x++){
			if(H[x] > 0){
				System.out.println("H " + H[x]);
			}
		} int x = 1; int x = 1; x 1 x <= 13 x 13 x++ x++ x {
			if(H[x] > 0){
				System.out.println("H " + H[x]);
			}
		} {
			if(H[x] > 0){
				System.out.println("H " + H[x]);
			}
		} if(H[x] > 0){
				System.out.println("H " + H[x]);
			} H[x] > 0 H[x] H x 0 {
				System.out.println("H " + H[x]);
			} System.out.println("H " + H[x]) System.out.println System.out System System.out "H " + H[x] "H " H[x] H x for(int x = 1; x <= 13; x++){
			if(C[x] > 0){
				System.out.println("C " + C[x]);
			}
		} int x = 1; int x = 1; x 1 x <= 13 x 13 x++ x++ x {
			if(C[x] > 0){
				System.out.println("C " + C[x]);
			}
		} {
			if(C[x] > 0){
				System.out.println("C " + C[x]);
			}
		} if(C[x] > 0){
				System.out.println("C " + C[x]);
			} C[x] > 0 C[x] C x 0 {
				System.out.println("C " + C[x]);
			} System.out.println("C " + C[x]) System.out.println System.out System System.out "C " + C[x] "C " C[x] C x for(int x = 1; x <= 13; x++){
			if(D[x] > 0){
				System.out.println("D " + D[x]);
			}
		} int x = 1; int x = 1; x 1 x <= 13 x 13 x++ x++ x {
			if(D[x] > 0){
				System.out.println("D " + D[x]);
			}
		} {
			if(D[x] > 0){
				System.out.println("D " + D[x]);
			}
		} if(D[x] > 0){
				System.out.println("D " + D[x]);
			} D[x] > 0 D[x] D x 0 {
				System.out.println("D " + D[x]);
			} System.out.println("D " + D[x]) System.out.println System.out System System.out "D " + D[x] "D " D[x] D x public static void main(String[] args) {

		new Main().kami();
	} main {

		new Main().kami();
	} new Main().kami() new Main().kami new Main() String[] args args
import java.util.Scanner;
class Main {
	private static int[] S = {0,1,2,3,4,5,6,7,8,9,10,11,12,13};
	private static int[] H = {0,1,2,3,4,5,6,7,8,9,10,11,12,13};
	private static int[] C = {0,1,2,3,4,5,6,7,8,9,10,11,12,13};
	private static int[] D = {0,1,2,3,4,5,6,7,8,9,10,11,12,13};
	public void kami() {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		for(int i = 1; i <= n; i++){
			String j = sc.next();
			if(j.equals("S")){
				int J = sc.nextInt();
				switch(J){
				case 1:
					S[J] = S[J] - J;
				case 2:
					S[J] = S[J] - J;
				case 3:
					S[J] = S[J] - J;
				case 4:
					S[J] = S[J] - J;
				case 5:
					S[J] = S[J] - J;
				case 6:
					S[J] = S[J] - J;
				case 7:
					S[J] = S[J] - J;
				case 8:
					S[J] = S[J] - J;
				case 9:
					S[J] = S[J] - J;
				case 10:
					S[J] = S[J] - J;
				case 11:
					S[J] = S[J] - J;
				case 12:
					S[J] = S[J] - J;
				case 13:
					S[J] = S[J] - J;
				}
			}else if(j.equals("H")){
				int J = sc.nextInt();
				switch(J){
				case 1:
					H[J] = H[J] - J;
				case 2:
					H[J] = H[J] - J;
				case 3:
					H[J] = H[J] - J;
				case 4:
					H[J] = H[J] - J;
				case 5:
					H[J] = H[J] - J;
				case 6:
					H[J] = H[J] - J;
				case 7:
					H[J] = H[J] - J;
				case 8:
					H[J] = H[J] - J;
				case 9:
					H[J] = H[J] - J;
				case 10:
					H[J] = H[J] - J;
				case 11:
					H[J] = H[J] - J;
				case 12:
					H[J] = H[J] - J;
				case 13:
					H[J] = H[J] - J;
				}
			}else if(j.equals("C")){
				int J = sc.nextInt();
				switch(J){
				case 1:
					C[J] = C[J] - J;
				case 2:
					C[J] = C[J] - J;
				case 3:
					C[J] = C[J] - J;
				case 4:
					C[J] = C[J] - J;
				case 5:
					C[J] = C[J] - J;
				case 6:
					C[J] = C[J] - J;
				case 7:
					C[J] = C[J] - J;
				case 8:
					C[J] = C[J] - J;
				case 9:
					C[J] = C[J] - J;
				case 10:
					C[J] = C[J] - J;
				case 11:
					C[J] = C[J] - J;
				case 12:
					C[J] = C[J] - J;
				case 13:
					C[J] = C[J] - J;
				}
			}else if(j.equals("D")){
				int J = sc.nextInt();
				switch(J){
				case 1:
					D[J] = D[J] - J;
				case 2:
					D[J] = D[J] - J;
				case 3:
					D[J] = D[J] - J;
				case 4:
					D[J] = D[J] - J;
				case 5:
					D[J] = D[J] - J;
				case 6:
					D[J] = D[J] - J;
				case 7:
					D[J] = D[J] - J;
				case 8:
					D[J] = D[J] - J;
				case 9:
					D[J] = D[J] - J;
				case 10:
					D[J] = D[J] - J;
				case 11:
					D[J] = D[J] - J;
				case 12:
					D[J] = D[J] - J;
				case 13:
					D[J] = D[J] - J;
				}
			}
		}
		for(int x = 1; x <= 13; x++){
			if(S[x] > 0){
				System.out.println("S " + S[x]);
			}
		}
		for(int x = 1; x <= 13; x++){
			if(H[x] > 0){
				System.out.println("H " + H[x]);
			}
		}
		for(int x = 1; x <= 13; x++){
			if(C[x] > 0){
				System.out.println("C " + C[x]);
			}
		}
		for(int x = 1; x <= 13; x++){
			if(D[x] > 0){
				System.out.println("D " + D[x]);
			}
		}
	}

	public static void main(String[] args) {

		new Main().kami();
	}

}