Bob is an avid fan of the video game "League of Leesins", and today he celebrates as the League of Leesins World Championship comes to an end! 

The tournament consisted of n (n ≥ 5) teams around the world. Before the tournament starts, Bob has made a prediction of the rankings of each team, from 1-st to n-th. After the final, he compared the prediction with the actual result and found out that the i-th team according to his prediction ended up at the p_i-th position (1 ≤ p_i ≤ n, all p_i are unique). In other words, p is a permutation of 1, 2, ..., n.

As Bob's favorite League player is the famous "3ga", he decided to write down every 3 consecutive elements of the permutation p. Formally, Bob created an array q of n-2 triples, where q_i = (p_i, p_{i+1}, p_{i+2}) for each 1 ≤ i ≤ n-2. Bob was very proud of his array, so he showed it to his friend Alice.

After learning of Bob's array, Alice declared that she could retrieve the permutation p even if Bob rearranges the elements of q and the elements within each triple. Of course, Bob did not believe in such magic, so he did just the same as above to see Alice's respond.

For example, if n = 5 and p = [1, 4, 2, 3, 5], then the original array q will be [(1, 4, 2), (4, 2, 3), (2, 3, 5)]. Bob can then rearrange the numbers within each triple and the positions of the triples to get [(4, 3, 2), (2, 3, 5), (4, 1, 2)]. Note that [(1, 4, 2), (4, 2, 2), (3, 3, 5)] is not a valid rearrangement of q, as Bob is not allowed to swap numbers belong to different triples.

As Alice's friend, you know for sure that Alice was just trying to show off, so you decided to save her some face by giving her any permutation p that is consistent with the array q she was given. 

Input

The first line contains a single integer n (5 ≤ n ≤ 10^5) — the size of permutation p.

The i-th of the next n-2 lines contains 3 integers q_{i, 1}, q_{i, 2}, q_{i, 3} (1 ≤ q_{i, j} ≤ n) — the elements of the i-th triple of the rearranged (shuffled) array q_i, in random order. Remember, that the numbers within each triple can be rearranged and also the positions of the triples can be rearranged.

It is guaranteed that there is at least one permutation p that is consistent with the input. 

Output

Print n distinct integers p_1, p_2, …, p_n (1 ≤ p_i ≤ n) such that p is consistent with array q. 

If there are multiple answers, print any. 

Example

Input


5
4 3 2
2 3 5
4 1 2


Output


1 4 2 3 5 
import java.io.*;
import java.util.*;
import java.math.*;
import java.lang.*;
 
import static java.lang.Math.*;
 
public class Solution implements Runnable 
{
	static class InputReader 
	{
		private InputStream stream;private byte[] buf = new byte[1024];
		private int curChar;
		private int numChars;
		private SpaceCharFilter filter;
		private BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        public InputReader(InputStream stream){this.stream = stream;}
		public int read(){if (numChars==-1) throw new InputMismatchException();if (curChar >= numChars){curChar = 0;try{numChars = stream.read(buf);}catch (IOException e){throw new InputMismatchException();	}if(numChars <= 0)return -1;}return buf[curChar++];}
     	public String nextLine(){String str = "";try{str = br.readLine();}catch (IOException e){e.printStackTrace();}return str;}
		public int nextInt(){int c = read();	while(isSpaceChar(c))c = read();	int sgn = 1; if (c == '-'){sgn = -1;c = read();	}int res = 0;do{if(c<'0'||c>'9') throw new InputMismatchException();res *= 10;res += c - '0';c = read();}while (!isSpaceChar(c));return res * sgn;}
        public long nextLong(){int c = read();while (isSpaceChar(c))c = read();int sgn = 1;if (c == '-'){sgn = -1;c = read();}long res = 0;do{if (c < '0' || c > '9')throw new InputMismatchException();res *= 10;res += c - '0';c = read();}while (!isSpaceChar(c));return res * sgn;}
		public double nextDouble(){int c = read();while (isSpaceChar(c))c = read();int sgn = 1;if (c == '-'){sgn = -1;c = read();}double res = 0;while (!isSpaceChar(c) && c != '.'){if (c == 'e' || c == 'E')return res * Math.pow(10, nextInt());if (c < '0' || c > '9')
		throw new InputMismatchException();res *= 10;res += c - '0';c = read();}if (c == '.'){c = read();double m = 1;while (!isSpaceChar(c)){if (c == 'e' || c == 'E')return res * Math.pow(10, nextInt());if (c < '0' || c > '9')throw new InputMismatchException();m /= 10;res += (c - '0') * m;c = read();}}return res * sgn;}
        public String readString(){int c = read();while (isSpaceChar(c))c = read();StringBuilder res = new StringBuilder();do{res.appendCodePoint(c);c = read();}while (!isSpaceChar(c));return res.toString();}
		public boolean isSpaceChar(int c){if (filter != null)return filter.isSpaceChar(c);return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;}
		public String next(){return readString();}
        public interface SpaceCharFilter{public boolean isSpaceChar(int ch);}
	}
		
	public static void main(String args[]) throws Exception{new Thread(null, new Solution(),"Main",1<<27).start();}

	public static long gcd(long a, long b) { 	if (a == 0) return b; return gcd(b % a, a);} 
  
	public static long findGCD(long arr[], int n) { 	long result = arr[0]; for (int i = 1; i < n; i++) result = gcd(arr[i], result);return result; }	 
	
	static void sortbycolomn(long arr[][], int col)
    { 
        Arrays.sort(arr, new Comparator<long[]>() { 
        @Override              
        public int compare(final long[] entry1,final long[] entry2) { 
            if (entry1[col] > entry2[col])return 1; 
            else return -1; 
        } 
        });   
    } 
	static int common(ArrayList<Integer>[] arr,int[] visited,int a,int b){
	    for(int i=0;i<arr[a].size();i++){
	        int x=arr[a].get(i);
	        if(visited[x]==0){
	            for(int j=0;j<arr[b].size();j++){
	                if(visited[arr[b].get(j)]==0 && arr[b].get(j)==x){
	                    visited[a]=1;
	                    visited[b]=1;
	                    return x;
	                }
	            }
	        }
	    }
	    return -1;
	}
	public void run()
    {
        InputReader in = new InputReader(System.in);
        PrintWriter w = new PrintWriter(System.out);
		
		int n=in.nextInt();
		ArrayList<Integer>[] arr=new ArrayList[n+1];
		for(int i=0;i<=n;i++)   arr[i]=new ArrayList<>();
		int a=0,b=0,c=0;
		for(int i=0;i<n-2;i++){
		    a=in.nextInt(); b=in.nextInt(); c=in.nextInt();
		    arr[a].add(b); arr[a].add(c);
		    arr[b].add(a); arr[b].add(c);
		    arr[c].add(a); arr[c].add(b);
		}
		
	/*	for(int i=1;i<=n;i++){
		    w.println(i);
		    for(int j=0;j<arr[i].size();j++)
		        w.print(arr[i].get(j)+" ");
		        w.println();
		}
		*/
		int[] visited=new int[n+1];
		int[] ans=new int[n];
		for(int i=1;i<=n;i++) if(arr[i].size()==2){ ans[0]=i; b=arr[i].get(0); c=arr[i].get(1); break;  }
		visited[ans[0]]=1;
		a=common(arr,visited,b,c);
		//w.println(a);
        int x=common(arr,visited,a,b);
        //w.println(x);
        if(x==-1){
            x=common(arr,visited,a,c);
            //w.println(x);
            ans[1]=b;
            ans[2]=c;
            ans[3]=a;
        }
        else{
            ans[1]=c;
            ans[2]=b;
            ans[3]=a;
        }
        for(int i=4;i<n;i++)
            ans[i]=common(arr,visited,ans[i-1],ans[i-2]);
        
        for(int i=0;i<n;i++)
            w.print(ans[i]+" ");
            w.println();
		
		
	    w.flush();
        w.close();
    }
}