#include <iostream>
#include <string.h>
#include <math.h>
#include <algorithm>
using namespace std;
/*typedef struct node{
	int data;
	struct node *next;

}node,*Lnode;*/
int main(){
	int m,n;
	cin >> m;
	/*for(int j=0;j<m;j++){
		scanf("%d",&n);
		Lnode L=new node;
		Lnode H=L;
		for(int i=1;i<=n;i++)
		{L->data=i;
		if(i!=n){
		L->next=new node;
		L=L->next;
		L->next=NULL;}
		
		}
	   L->next=H;
		int count=0,count1=0;
		
		while(count1!=n){
		while(H->data==-999)
		  H=H->next;
			count++;
			//H=H->next;
			//while(H->data==-999)
			//H=H->next;
				if(count==3){
					cout <<H->data <<' ';
					H->data=-999;
			while(H->data==-999)
			H=H->next;
					count1++;
					count=0;
				}
				else{
					H=H->next;
			while(H->data==-999)
			H=H->next;
				}
		
		}
	}*/
	int a[51];
	for(int i=1;i<=50;i++)
		a[i]=i;
	for(int j=1;...