#include<stdio.h>
//#include<conio.h>
#include<stack>
using namespace std;
    stack <int> arr;
    stack <int> brr;
    stack <int> crr;
int sum=0;
void func(int n,int present,int usable,int final)
{
     int i;
    if(n==0)
    return;
    
    
    func(n-1,present,final,usable);
    
    if(present==1 && final==2)
    {brr.push(arr.top());arr.pop();}
    else if(present==1 && final==3)
    {crr.push(arr.top());arr.pop();}
    else if(present==2 && final==1)
    {arr.push(brr.top());brr.pop();}
    else if(present==2 && final==3)
    {crr.push(brr.top());brr.pop();}
    else if(present==3 && final==1)
    {arr.push(crr.top());crr.pop();}
    else if(present==3 && final==2)
    {brr.push(crr.top());crr.pop();}
    
    sum=sum+1;
    printf("1->");
    for(i=0;i<arr.size();i++)
    printf("%d ",arr[i]);
    printf("\n");
    printf("2->");
    for(i=0;i<brr.size();i++)
    printf("%d ",brr[i]);
    printf("\n");
    printf("3->");
    for(i=0;i<crr.size();i++)
    printf("%d ",crr[i]);
    printf("\n\n");
    func(n-1,usable,present,final);
}

int main()
{
    int n;
    scanf("%d",&n);
    for(int i=n;i>0;i--)
    arr.push(i);
    func(n,1,2,3);
    printf("%d",sum);
    //getch();
}