main()
{
int n,l;
while(1)
{
q1=_q[0],q2=_q[1];
heap.n=1;
test.set();
test.get();
scanf("%d",&n);
test.ball=n;
/*open(test);
node=20;
while(heap.n>1 && heap.n<9000 && node--)
open(heap.exmin());*/
best.set();
best.score=2147483647;
// Greedy Search
/*while(test.num>0)
{
best.set();
best.score=2147483647;
if(best.pn>0)
{
test.add(best.path[0].x,best.path[0].y);
printf("%d %d\n",best.path[0].x+1,best.path[0].y+1);
}*/
tp[5]=test;
dfs(5,0,0);
//}
//----------------------------------------------------------------
best.print();
}
}
