/**
 * 
 * 
 * @author (Dubi Kaufmann) 
 * @version (1.0   9-27-2004)
 */
public class brutforce
{
    // instance variables - replace the example below with your own
    public boolean[] pieces=new boolean[16];
    
    public int solutions,diagonal;
    /**
     * Constructor for objects of class brutforce
     */
    public static void main(String[] args) {
        brutforce mybrutforce=new brutforce();
        mybrutforce.solve();
    }
    
    
    
    public brutforce()
    {
        // initialise instance variables
        pieces[0] = true;
        pieces[1] = true;
        pieces[2] = true;
        pieces[3] = true;
        pieces[4] =true;
        pieces[5] = true;
        pieces[6] = true;
        pieces[7] = true;
        pieces[8] = true;
        pieces[9] = true;
        pieces[10] = true;
        pieces[11] = true;
        pieces[12] = true;
        pieces[13] = true;
        pieces[14] = true;
        pieces[15] = true;
        solutions=0;
        diagonal=0;
    }
   

   public int get_right(int piecenum){
       int temp=(int)Math.ceil((piecenum-(piecenum%4))%8/8.0);
       return (temp+1)%2;
   }
   public int get_top(int piecenum){
       int temp=(int)Math.ceil((piecenum-(piecenum%2))%4/4.0);
       return 8*((temp+1)%2);
   }
   public boolean checkThird(int piecenum1,int piecenum2,int piecenum3){
       if ((piecenum1+piecenum2+piecenum3>14) && (piecenum1+piecenum2+piecenum3<31))
            {
            int a4=30-piecenum1-piecenum2-piecenum3;
            if (pieces[a4]) 
                {
                if (a4!=piecenum3) 
                    {
                    if (get_right(piecenum3)==a4%2)
                    return true;
                    }
                }
            }
       return false;
    }
     public boolean checkThirdV(int piecenum1,int piecenum2,int piecenum3){
       if ((piecenum1+piecenum2+piecenum3>14) && (piecenum1+piecenum2+piecenum3<31))
            {
            int a13=30-piecenum1-piecenum2-piecenum3;
            if (pieces[a13]) 
                {
                if (a13!=piecenum3) 
                    {
                    if (get_top(piecenum3)==a13-(a13%8))
                        return true;
                    }
                }
            }
       return false;
   }
   public boolean checkfourth(int piecenum1,int piecenum2,int piecenum3){
       if ((piecenum1+piecenum2+piecenum3>14) && (piecenum1+piecenum2+piecenum3<31))
            {
            if (pieces[30-piecenum1-piecenum2-piecenum3]) return true;
            }
       return false;
   }
   public void solve()
   {
       for (int a1=0; a1<16; a1++)
       {
           System.out.println(get_top(a1));
            pieces[a1]=false;
            for (int a2=get_right(a1); a2<16; a2=a2+2)
                { 
                if (pieces[a2])
                    {
                    pieces[a2]=false;
                    for (int a3=get_right(a2); a3<16; a3=a3+2)   
                        {
                        if (checkThird(a1,a2,a3)&&pieces[a3])
                            {
                            int a4=30-a1-a2-a3;   
                            pieces[a3]=false;
                            pieces[a4]=false;
                            for (int a5=get_top(a1);a5<get_top(a1)+8; a5++)   
                               {
                                if (pieces[a5])
                                   {
                                   pieces[a5]=false; 
                                   for (int a6=get_top(a2)+get_right(a5);a6<get_top(a2)+8;a6=a6+2)
                                        {
                                        if  (pieces[a6])
                                            {
                                            pieces[a6]=false;  
                                            for (int a7=get_top(a3)+get_right(a6);a7<get_top(a3)+8;a7=a7+2)
                                                {
                                                if (checkThird(a5,a6,a7)&&pieces[a7])
                                                    {
                                                     int a8=30-a5-a6-a7;
                                                     pieces[a7]=false;
                                                     pieces[a8]=false;
                                                     for (int a9=get_top(a5);a9<get_top(a5)+8; a9++)
                                                        {
                                                        if (checkThirdV(a1,a5,a9)&&pieces[a9])
                                                            {
                                                            int a13=30-a1-a5-a9;
                                                            pieces[a9]=false;
                                                            pieces[a13]=false;
                                                            for (int a10=get_top(a6)+get_right(a9);a10<get_top(a6)+8;a10=a10+2)
                                                                {
                                                                if (checkThirdV(a2,a6,a10)&&pieces[a10])
                                                                    {
                                                                     int a14=30-a2-a6-a10;
                                                                     if (get_right(a13)==a14%2)
                                                                        {
                                                                         pieces[a10]=false;
                                                                         pieces[a14]=false;
                                                                         for (int a11=get_top(a7)+get_right(a10);a11<get_top(a7)+8;a11=a11+2)
                                                                            {
                                                                            if (pieces[a11]&&(checkThirdV(a3,a7,a11)&&checkThird(a9,a10,a11)))
                                                                                {
                                                                                    int a15=30-a3-a7-a11;
                                                                                    if (get_right(a14)==a15%2)
                                                                                        {
                                                                                         int a12=30-a9-a10-a11;
                                                                                         int a16=30-a13-a14-a15;
                                                                                         if ((a1+a6+a11+a16==30)&&(a4+a7+a10+a13==30)) diagonal++;
                                                                                         System.out.println(a13+","+a14+","+a15+","+a16);
                                                                                         System.out.println(a9+","+a10+","+a11+","+a12);
                                                                                         System.out.println(a5+","+a6+","+a7+","+a8);
                                                                                        System.out.println(a1+","+a2+","+a3+","+a4);
                                                                                        System.out.println(" ");
                                                                                        
                                                                                        
                                                                                        solutions++;
                                                                        
                                                                                        }
                                                                               }
                                                                           } 
                                                                          
                                                                         pieces[a10]=true;
                                                                         pieces[a14]=true;
                                                                         }
                                                                      }
                                                                 }
                                                             pieces[a9]=true;
                                                             pieces[a13]=true;
                                                             }
                                                        }
                                                     pieces[a7]=true;
                                                     pieces[a8]=true;
                                                    }
                                                }
                                            pieces[a6]=true;
                                            }
                                        }
                                   pieces[a5]=true;
                                   }
                                }
                            pieces[a4]=true;
                            pieces[a3]=true;
                            }
                        }
                    pieces[a2]=true;
                    }
               }
           pieces[a1]=true;
       }
   //System.out.println(" ");
   System.out.println("solutions="+solutions);
   System.out.println("diagonal="+diagonal);
   }
}