import sun.reflect.generics.tree.Tree;
import java.io.InputStream;
import java.util.ArrayList;
import java.util.Collections;
import java.util.HashMap;
import java.util.TreeSet;
public class Poker {
public static void main(String[] args) {
// ArrayList<String> arr =new ArrayList<String>();
ArrayList<String>tr =new ArrayList<String>();
HashMap<Integer, String> hs=new HashMap<Integer, String>();
ArrayList<Integer> arr =new ArrayList<Integer>();
TreeSet<Integer> lqxarr =new TreeSet<Integer>();
TreeSet<Integer> lyarr =new TreeSet<Integer>();
TreeSet<Integer> smarr =new TreeSet<Integer>();
TreeSet<Integer> dparr =new TreeSet<Integer>();
String [] colors ={"hongtao","heitao","fangpian","meihua"};
String [] number ={"3","4","5","6","7","8","9","10","J","Q","k","A","2"};
int index =0;
for(int i=0;i<number.length;i++){
for(int k=0;k<colors.length;k++){
tr.add(colors[k]+number[i]);
hs.put(index,tr.get(index));
arr.add(index);
index++;
}
}
System.out.println(index);
arr.add(index);
tr.add("xiaowang");
hs.put(index,tr.get(index));
index ++;
arr.add(index);
tr.add("dawang");
hs.put(index,tr.get(index));
// Collections.shuffle(arr);
for(int i=0;i<arr.size();i++){
// System.out.println(arr1);
if(i>=arr.size()-3)
{
dparr.add( arr.get(i));
}
else if(i%3==0)
{
lqxarr.add(arr.get(i));
}
else if(i%3==1)
{
lyarr.add(arr.get(i));
}
else if(i%3==2)
{
smarr.add(arr.get(i));
}
}
lookPoker("lingqingxia",lqxarr,hs);
lookPoker("liouyan",lyarr,hs);
lookPoker("sanmao",smarr,hs);
lookPoker("dipai",dparr,hs);
for(int h:hs.keySet()) {
System.out.println(h+" "+hs.get(h));
}
}
public static void lookPoker(String name,TreeSet<Integer> array,HashMap<Integer, String> hs){
System.out.print(name +"de pai is ");
for(Integer in :array) {
String value = hs.get(in);
System.out.print( value+ " ");
}
System.out.println("\t");
}
}