#include<iostream>
using namespace std;
int Num;
#define SIZE 100000
typedef struct node{
int flakeNum[6];
struct node *next;
}node;
node hashPool[SIZE+10];
node hashTable[SIZE + 10];
int hashdex = 0;
node *getNewNode()
{
return &hashPool[hashdex++];
}
void insertNode(int key, node *newNode)
{
newNode->next = hashTable[key].next;
hashTable[key].next = newNode;
}
int main()
{
node * Curnode;
scanf("%d", &Num);
int key = 0;
for (int i = 0; i < Num; i++)
{
int key = 0;
Curnode = getNewNode();
for (int j = 0; j < 6; j++)
{
scanf("%d", &Curnode->flakeNum[j]);
key = key + Curnode->flakeNum[j]
}
}
}
