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:
import java.lang.*;
import java.awt.geom.Line2D;
import java.io.*;
import java.util.*;
import java.math.*;

public class C implements Runnable{
    class Val implements Comparable<Val> {
        int cnt, sz;
        
        public Val(int cnt, int sz) {
            this.cnt = cnt;
            this.sz = sz;
        }
        
        public int compareTo(Val a) {
            return (this.cnt==a.cnt)?(this.sz-a.sz):(this.cnt-a.cnt);
        }
    }
    
    
    public void run() { 
        TreeSet<Val> k = new TreeSet<Val>();
        TreeMap<Integer, Integer> r = new TreeMap<Integer, Integer>();
        int n = nextInt();
        for (int i = 0; i < n; ++i) {
            int cur = nextInt();
            if (!r.containsKey(cur)) {
                r.put(cur, 0);
            }
            int tmp = r.get(cur);
            if (tmp > 0) {
                k.remove(new Val(tmp, cur));
            }
            r.put(cur, tmp+1);
            k.add(new Val(tmp+1, cur));
        }
        
        int ans = 0;
        ArrayList<Integer> list = new ArrayList<Integer>();
        
        int[] szs = new int[3];
        while(k.size() >= 3) {
            Val p1 = k.pollLast();
            Val p2 = k.pollLast();
            Val p3 = k.pollLast();
            
            
            
            ++ans;
            szs[0] = p1.sz;
            szs[1] = p2.sz;
            szs[2] = p3.sz;
            Arrays.sort(szs);
            list.add(szs[2]);
            list.add(szs[1]);
            list.add(szs[0]);
            
            --p1.cnt;
            --p2.cnt;
            --p3.cnt;
            
            if (p1.cnt > 0) {
                k.add(p1);
            }
            if (p2.cnt > 0) {
                k.add(p2);
            }
            if (p3.cnt > 0) {
                k.add(p3);
            }
        }
        
        out.println(ans);
        for (int i = 0; i < list.size(); ++i) {
            out.print(list.get(i));
            if ((i+1)%3 == 0) {
                out.println();
            }
            else {
                out.print(" ");
            }
        }
        out.flush();
    }
    
    private static BufferedReader br = null;
    private static PrintWriter out = null;
    private static StringTokenizer stk = null;
    
    public static void main(String[] args) {
        br = new BufferedReader(new InputStreamReader(System.in));
        out = new PrintWriter(System.out);
        (new Thread(new C())).start();
    }
    
    private void loadLine() {
        try {
            stk = new StringTokenizer(br.readLine());
        }
        catch (IOException e) {
            e.printStackTrace();
        }
    }
    
    private String nextLine() {
        try {
            return br.readLine();
        }
        catch (IOException e) {
            e.printStackTrace();
        }
        return null;
    }
    
    private Integer nextInt() {
        while (stk==null||!stk.hasMoreTokens()) loadLine();
        return Integer.parseInt(stk.nextToken());
    }
    
    private Long nextLong() {
        while (stk==null||!stk.hasMoreTokens()) loadLine();
        return Long.parseLong(stk.nextToken());
    }
    
    private String nextWord() {
        while (stk==null||!stk.hasMoreTokens()) loadLine();
        return (stk.nextToken());
    }
    
    private Double nextDouble() {
        while (stk==null||!stk.hasMoreTokens()) loadLine();
        return Double.parseDouble(stk.nextToken());
    }
}