#include <stdio.h>
int main()
 {
    struct pont {
                int x;
            int y;
    int z;};
    struct pont p[10];
    for (int i =0;i<10;i++){
        scanf("%d",&p[i].x);
        scanf("%d",&p[i].y);
        scanf("%d",&p[i].z);
    }
    for (int i =0;i<10;i++){
        printf("%d. pont:\n",i+1);
        printf("%d ",p[i].x);
        printf("%d ",p[i].y);
        printf("%d \n",p[i].z);
    }
    int legnagyobb=-1;
    int index=999;
    for (int i =0;i<10;i++){
        if ((p[i].x*p[i].x)+(p[i].y*p[i].y)+(p[i].z*p[i].z)>legnagyobb){
            index=i;
            legnagyobb=(p[i].x*p[i].x)+(p[i].y*p[i].y)+(p[i].z*p[i].z);
        }
    }
    printf("A legtavolabbi: %d %d %d",p[index].x,p[index].y,p[index].z);
    return 0;
}