Problem: As meticulous Gerald sets the table and caring Alexander sends the postcards, Sergey makes snowmen. Each showman should consist of three snowballs: a big one, a medium one and a small one. Sergey's twins help him: they've already made n snowballs with radii equal to r1, r2, ..., rn. To make a snowman, one needs any three snowballs whose radii are pairwise different. For example, the balls with radii 1, 2 and 3 can be used to make a snowman but 2, 2, 3 or 2, 2, 2 cannot. Help Sergey and his twins to determine what maximum number of snowmen they can make from those snowballs.

Input

The first line contains integer n (1 ≤ n ≤ 105) — the number of snowballs. The next line contains n integers — the balls' radii r1, r2, ..., rn (1 ≤ ri ≤ 109). The balls' radii can coincide.

Output

Print on the first line a single number k — the maximum number of the snowmen. Next k lines should contain the snowmen's descriptions. The description of each snowman should consist of three space-separated numbers — the big ball's radius, the medium ball's radius and the small ball's radius. It is allowed to print the snowmen in any order. If there are several solutions, print any of them.

Examples

Input

7
1 2 3 4 5 6 7


Output

2
3 2 1
6 5 4


Input

3
2 2 3


Output

0

Solution (in JAVA):

Solution:
//package sheet_C;
import java.io.*;
import java.util.*;
import java.util.Map.Entry;
public class NewYearSnowmen {
	public static void main(String[]args)throws Throwable{
		PrintWriter pw=new PrintWriter(System.out,true);
		MyScanner sc=new MyScanner();
		int n=sc.nextInt();
		
		TreeMap<Integer, Integer> map=new TreeMap<Integer, Integer>();
		
		for(int i=0;i<n;i++){
			int x=sc.nextInt();
			if(map.containsKey(x))
				map.put(x,map.get(x)+1);
			else
				map.put(x, 1);
		}
		
		PriorityQueue<pair> q=new PriorityQueue<pair>();
		
		for(Entry<Integer, Integer> e : map.entrySet())
			q.add(new pair(e.getKey(), e.getValue()));
		
		ArrayList<Triple> ans=new ArrayList<Triple>();
		
		while(q.size()>=3){
			pair x=q.poll();
			pair y=q.poll();
			pair z=q.poll();
			
			int [] a={x.x,y.x,z.x};
			Arrays.sort(a);
			ans.add(new Triple(a[2],a[1],a[0]));
			
			if(--x.cnt>0)
				q.add(x);
			if(--y.cnt>0)
				q.add(y);
			if(--z.cnt>0)
				q.add(z);
		}
		
		
		
		pw.println(ans.size());
		for(int i=0;i<ans.size();i++)
			pw.println(ans.get(i));
		pw.flush();
		pw.close();
	}
	
	static class pair implements Comparable<pair>{
		int x,cnt;
		
		pair(int x,int c){
			this.x=x;
			cnt=c;
		}
		
		public int compareTo(pair o) {
			return o.cnt-this.cnt;
		}
	}
	
	static class Triple{
		int x,y,z;
		
		Triple(int a,int b,int c){x=a;y=b;z=c;}
		
		public String toString(){
			return x+" "+y+" "+z;
		}
	}
	
	static class MyScanner {
	      BufferedReader br;
	      StringTokenizer st;
	 
	      public MyScanner() {
	         br = new BufferedReader(new InputStreamReader(System.in));
	      }
	 
	      String next() {
	          while (st == null || !st.hasMoreElements()) {
	              try {
	                  st = new StringTokenizer(br.readLine());
	              } catch (IOException e) {
	                  e.printStackTrace();
	              }
	          }
	          return st.nextToken();
	      }
	 
	      int nextInt() {
	          return Integer.parseInt(next());
	      }
	 
	      long nextLong() {
	          return Long.parseLong(next());
	      }
	 
	      double nextDouble() {
	          return Double.parseDouble(next());
	      }
	 
	      String nextLine(){
	          String str = "";
		  try {
		     str = br.readLine();
		  } catch (IOException e) {
		     e.printStackTrace();
		  }
		  return str;
	      }

	   }
}