The big flag-raising

   
   

    
    In the Maritime University , there is a tradition that is big flag-raising . At 5:50 in the morning , wearing uniforms and lining up for each student is a big headache . In order to improve the efficiency of collection and  save more sleep time .The school leadership decides to divide the specific area into N small areas of equal size.Now assume that we don’t consider the length  of the queue .The small areas will be seen as a straight line. In order to look more orderly, students in each small area are required to wear the same uniform .The adjacent small area should not wear the same uniform.Moreover, the head area and the tail area can’t wear the same uniform.There are some phalanxes(each phalanx occupies one small area) dressed in the specific uniform (one of three given kinds of uniform), and we want to know how many different permutation solutions(Assume that the number of phalanxes waring each kind of uniform is a certain number)。
   
   

Input

   
   

    
    The input will contain multiple test cases ,
    
    
Each case will only contain a number N(1 <= N <= 50).
   
   

 

Output

   
   

    
    Output the answer in a line.
   
   

 

Sample Input

   
   

    
    1
2
   
   

 

Sample Output

   
   

    
    3
6
   
   
#include<stdio.h>
int main()
{
    int n,i;
    double a[51];
    a[1]=3,a[2]=a[3]=6;
    for(i=4;i<=50;i++)
        a[i]=a[i-2]*2+a[i-1];
    while(scanf("%d",&n)!=EOF)
        printf("%.0lf\n",a[n]);
    return 0;
}

    
    

     
     

    
    
找规律，不解释，推出来公式就好写了