#include <stdio.h>
#include <stdlib.h>
#include <math.h>

struct triangle
{
	int a;
	int b;
	int c;
};

typedef struct triangle triangle;


void sort_by_area(triangle* tr, int n) {
        /**
        * Sort an array a of the length n
        */
    int compare(const void *a, const void *b)
    {
        double *valA = a;
        double *valB = b;
        if(*valA > *valB)
        {
            return 1;
        }
        else if(*valA < *valB)
        {
            return -1;
        }
        else return 0;

    }
    triangle* output=malloc(n * sizeof(triangle));
    double* area=malloc(n * sizeof(double));
    double* order=malloc(n * sizeof(double));

    int i=0, k=0;
    double p=0;
    while(i<n)
    {
        p=(double)(tr[i].a+tr[i].b+tr[i].c)/2;
        area[i]=sqrt(p*(p-tr[i].a)*(p-tr[i].b)*(p-tr[i].c));
        //area[i]=(tr[i].a+tr[i].b+tr[i].c);
        //printf("debug %f\n",area[i]);
        order[i]=area[i];
        i++;
    }
    qsort(order, n, sizeof(double), compare);
    i=0;
    while(i<n)
    {
//      printf("debug: %d\n",order[i]);
        k=0;
        while(k<n)
        {
            if(order[i]==area[k])
            {
                output[i]=tr[k];
                //printf("debug: %d %d %d\n",tr[k].a,tr[k].b,tr[k].c);
                k=n-1;
            }
            k++;
        }
        i++;
    }
    i=0;
    while(i<n)
    {
            tr[i]=output[i];
            i++;
    }


}
    

int main()
{
	int n;
	scanf("%d", &n);
	triangle *tr = malloc(n * sizeof(triangle));
	for (int i = 0; i < n; i++) {
		scanf("%d%d%d", &tr[i].a, &tr[i].b, &tr[i].c);
	}
	sort_by_area(tr, n);
	for (int i = 0; i < n; i++) {
		printf("%d %d %d\n", tr[i].a, tr[i].b, tr[i].c);
	}
	return 0;
}