/* 
 * Problem: NOI Winter Camp 2010 efield
 * Author: Guo Jiabao
 * Time: 2010.3.15 12:21
 * Label: Solved
 * Memo: Computing Geometry + Convex Hull + Graham Scan
*/
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <iostream>
#include <sstream>
#include <vector>
#include <list>
#include <deque>
#include <string>
#include <queue>
 
#define var(a,b) typeof(b) a(b)
#define foreach(a,b) for (var(a,b.begin());a!=b.end();++a)
using std::sort;
 
const int MAXN = 50002;
 
struct point
{
	double x,y;
	int id;
};
 
int N,ipole;
point P[MAXN],pole,convex[MAXN],A[MAXN];
 
point operator -(const point &a,const point &b)
{
	point t={a.x-b.x,a.y-b.y,0};
	return t;
}
 
double operator *(const point &a,const point &b)
{
	return a.x*b.y - b.x*a.y;
}
 
void init()
{
	freopen("efield.in","r",stdin);
	freopen("efield.out","w",stdout);
	scanf("%d",&N);
	ipole=0;
	for (int i=1;i<=N;i++)
	{
		double m,c;
		scanf("%lf%lf",&m,&c);
		P[i].x = m*c;
		P[i].y = m;
		P[i].id = i;
		if (P[i].y > P[ipole].y)
			ipole = i;
	}
	pole = P[ipole];
	P[ipole] = P[N--];
}
 
bool cmp(const point &a,const point &b)
{
	point p = a - pole;
	point q = b - pole;
	double fc = p * q;
	if (fc > 0)
		return true;
	if (fc < 0)
		return false;
	return (p.x * p.x + p.y * p.y > q.x * q.x + q.y * q.y);
}
 
void graham()
{
	int top;
	sort(&P[1],&P[N+1],cmp);
	convex[1] = pole;
	convex[top=2] = P[1];
	for (int i=2;i<=N;i++)
	{
		point p = convex[top] - convex[top-1];
		point q = P[i] - convex[top];
		if (p*q < 0)
		{
			top--;
			i--;
		}
		else
			convex[++top] = P[i];
	}
	N = top;
	convex[N+1] = convex[1];
}
 
void getSumArea()
{
	int i;
	printf("%d\n",N);
	for (i=1;i<N;i++)
		printf("%d ",convex[i].id);
	printf("%d\n",convex[i].id);
/*	double SumArea = 0;
	for (i=1;i<=N;i++)
		SumArea += convex[i] * convex[i+1];
	SumArea *= 0.5;*/
}
 
bool cmp2(const point &a,const point &b)
{
	return a * b > 0;
}
 
void getPair()
{
	int M = 1,i,j,ai,aj;
	double PairArea = 0;
	for (i=1;i<=N;i++)
	{
		A[i] = convex[i];
		if (convex[i].x < convex[i-1].x)
			M = i;
	}
	sort(&A[1],&A[N+1],cmp2);
	for (i=1,j=1;i<=N;i++)
	{
		while (j<M && A[i]*(convex[j]-convex[j+1]) <= 0)
			j++;
		if (j == M)
			break;
		double cur = A[i] * convex[j];
		if (cur > PairArea)
		{
			PairArea = cur;
			ai = A[i].id;
			aj = convex[j].id;
		}
	}
	printf("%d %d\n",ai,aj);
}
 
void solve()
{
	graham();
	getPair();
	getSumArea();
}
 
int main()
{
	init();
	solve();
	return 0;
}

/* 
 * Problem: NOI2009 path
 * Author: Guo Jiabao
 * Time: 2009.10.9 13:50
 * State: Solved
 * Memo: 竖线扫描
*/
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <ctime>
using namespace std;
const int MAXN = 2501;
const double INF = 1e100;
 
struct point
{
    double x,y;
    point (double tx,double ty) : x(tx),y(ty) {}
    point () : x(0) , y(0) {}
};
 
struct shape
{
    point c[2],v[4];
    double left,right;
};
 
struct itvs
{
    double a;
    bool s;
}isl[MAXN];
 
struct delist
{
    struct item
    {
        item *c[2];
        shape *e;
        item(item *last,shape *te)
        {
            c[0] = last;
            c[1] = NULL;
            e = te;
        }
    }*front,*rear;
    delist()
    {
        front = rear = 0;
    }
    void insert(shape *e)
    {
        if (rear)
            rear = rear -> c[1] = new item(rear,e);
        else
            front = rear = new item(NULL,e);
    }
    void remove(item *i)
    {
        if (i -> c[0])
            i -> c[0] -> c[1] = i -> c[1];
        else
            front = i -> c[1];
        if (i -> c[1])
            i -> c[1] -> c[0] = i -> c[0];
        else
            rear = i -> c[0];
        delete i;
    }
};
 
int M,N,ic;
double R,Total,Left,Right,miny,maxy;
point P[MAXN];
shape A[MAXN];
delist DL;
 
void operator *= (point &a,double k)
{
    a.x *=k;
    a.y *=k;
}
 
point operator + (point a,point b)
{
    return point(a.x + b.x,a.y + b.y);
}
 
point operator - (point a,point b)
{
    return point(a.x - b.x,a.y - b.y);
}
 
inline double MIN(double a,double b)
{
    return a<b?a:b;
}
 
inline double MAX(double a,double b)
{
    return a>b?a:b;
}
 
inline double ABS(double a)
{
	return a<0?-a:a;
}
 
inline double dist(point a,point b)
{
    return sqrt((a.x-b.x)*(a.x-b.x) + (a.y-b.y)*(a.y-b.y));
}
 
void init()
{
    int i,a,b;
    freopen("path.in","r",stdin);
    freopen("path.out","w",stdout);
    scanf("%d",&N);
    for (i=1;i<=N;i++)
        scanf("%lf%lf",&P[i].x,&P[i].y);
    scanf("%d",&M);
    for (i=1;i<=M;i++)
    {
        scanf("%d%d",&a,&b);
        A[i].c[0] = P[a];
        A[i].c[1] = P[b];
    }
    scanf("%lf",&R);
}
 
void count_point()
{
    int i;
    point v,v1,v2;
    Left = INF; Right = -INF;
    for (i=1;i<=M;i++)
    {
        v = A[i].c[1] - A[i].c[0];
        v1.x = v.y; v1.y = -v.x;
        v1 *= R / dist(A[i].c[0],A[i].c[1]);
        A[i].v[0] = A[i].c[0] + v1;
        A[i].v[1] = A[i].c[0] - v1;
        A[i].v[2] = A[i].c[1] + v1;
        A[i].v[3] = A[i].c[1] - v1;
 
        A[i].left = MIN(A[i].c[0].x-R,A[i].c[1].x-R);
        if (A[i].left < Left)
            Left = A[i].left;
 
        A[i].right = MAX(A[i].c[0].x+R,A[i].c[1].x+R);
        if (A[i].right > Right)
            Right = A[i].right;
    }
}
 
inline int cmp(const void *a,const void *b)
{
    return ((shape *)a) -> left < ((shape *)b) -> left ? -1 : 1;
}
 
inline int cmp1(const void *a,const void *b)
{
    if ( ((itvs *)a) -> a < ((itvs *)b) -> a )
        return -1;
    else if ( ((itvs *)a) -> a > ((itvs *)b) -> a )
        return 1;
    if (((itvs *)a) -> s)
        return -1;
    return 1;
}
 
void insert_ivl(double s,double t)
{
    if (s >= t)
        return;
    isl[++ic].a = s;
    isl[ic].s = true;
    isl[++ic].a = t;
    isl[ic].s = false;
}
 
double ivl_merge()
{
    int i,lv=0;
    double s,t=0;
    qsort(isl+1,ic,sizeof(isl[0]),cmp1);
    for (i=1;i<=ic;i++)
    {
        if (isl[i].s)
        {
            if (++lv == 1)
                s = isl[i].a;
        }
        else
        {
            if (--lv == 0)
                t += isl[i].a - s;
        }
    }
    return t;
}
 
inline bool isin(double x,double x1,double x2)
{
    if (x1 < x2)
        return x1 <= x && x <= x2;
    else
        return x2 <= x && x <= x1;
}
 
void cross_segment(double x,point a,point b)
{
    if (b.x == a.x || !isin(x,a.x,b.x))
        return;
    double y = (b.y - a.y) * (x - a.x) / (b.x - a.x);
    y += a.y;
    if (y < miny)
        miny = y;
    if (y > maxy)
        maxy = y;
}
 
void scan()
{
    const double dx = 1e-6;
    double x;
    double per,lper=0;
    int p=0;
    for (x=Left;x<=Right;x+=dx)
    {
        //////
        per = (x - Left)/(Right - Left) * 100;
        if (per - lper >=1)
        {
            lper = per;
            fprintf(stderr,"%.0lf percent\n",per);
        }
        //////
        while (p+1 <=M && A[p+1].left <= x)
            DL.insert(&A[++p]);
        ic = 0;
        for (delist :: item *it = DL.front;it;it = it ->c[1])
        {
            shape *S;
            for (;it;)
            {
                S = it -> e;
                if (x <= S->right)
                    break;
                delist :: item *itn = it -> c[1];
                DL.remove(it);
                it = itn;
            }
            if (!it)
                break;
 
            //Cross circle
            for (int i=0;i<2;i++)
            {
                if (S->c[i].x-R < x && x < S->c[i].x+R)
                {
                    double tx,ty;
                    tx = ABS(x - S->c[i].x);
                    ty = sqrt(R*R - tx*tx);
                    insert_ivl(S->c[i].y - ty , S->c[i].y + ty);
                }
            }
 
            miny = INF; maxy = -INF;
            cross_segment(x,S->v[0],S->v[1]);
            cross_segment(x,S->v[2],S->v[3]);
            cross_segment(x,S->v[0],S->v[2]);
            cross_segment(x,S->v[1],S->v[3]);
            insert_ivl(miny,maxy);
        }
        double t = ivl_merge();
        Total += t * dx;
    }
}
 
void solve()
{
    count_point();
    qsort(A+1,M,sizeof(A[0]),cmp);
    scan();
    printf("%.12lf\n",Total);
}
 
int main()
{
    int c_start,c_end;
    c_start = clock();
    init();
    solve();
    c_end = clock();
    cerr <<"Running Time : " << double(c_end - c_start) / CLOCKS_PER_SEC << endl;
    return 0;
}

/* 
 * Problem: NOI2003 detect
 * Author: Guo Jiabao
 * Time: 2009.5.26 13:30
 * State: Solved
 * Memo: 交互式 二分 凸多边形面积
*/
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include "detect_lib.h"
using namespace std;
const int MAXB=10000,MAXL=20001,MAXN=201;
const double zero=1e-6;
struct point
{
	double x,y;
}LB,RB,BB,TB,V[MAXN],V2[MAXN];
struct ask
{
	int acnt;
	double v1,v2;
}AX0[MAXL],AY0[MAXL],*Ax,*Ay;
int N,N2;
double (*opt)(double,double) ;
double min(double a,double b)
{
	if (a==MAXB+1) return b;
	if (b==MAXB+1) return a;
	return a<b?a:b;
}
double max(double a,double b)
{
	if (a==MAXB+1) return b;
	if (b==MAXB+1) return a;
	return a>b?a:b;
}
void init()
{
	Ax=AX0+MAXB; Ay=AY0+MAXB;
	prog_initialize();
	for (int i=-MAXB;i<=MAXB;i++)
		Ax[i].acnt=Ay[i].acnt=-1;
}
ask Ask(int k,bool x)
{
	if (x)
	{
		if (Ax[k].acnt==-1)
			Ax[k].acnt=ask_x(k, &Ax[k].v1, &Ax[k].v2);
		if (Ax[k].acnt==1)
			Ax[k].v2=MAXB+1;
		return Ax[k];
	}
	else
	{
		if (Ay[k].acnt==-1)
			Ay[k].acnt=ask_y(k, &Ay[k].v1, &Ay[k].v2);
		if (Ay[k].acnt==1)
			Ay[k].v2=MAXB+1;
		return Ay[k];
	}
}
int BS_inc(int a,int b,bool x)
{
	int m;ask A;
	while (a<=b)
	{
		m=(a+b)>>1;
		A=Ask(m,x);
		if (A.acnt==0)
			a=m+1;
		else if (A.acnt==2)
			b=m-1;
		else
			return m;
	}
}
int BS_dec(int a,int b,bool x)
{
	int m;ask A;
	while (a<=b)
	{
		m=(a+b)>>1;
		A=Ask(m,x);
		if (A.acnt==0)
			b=m-1;
		else if (A.acnt==2)
			a=m+1;
		else
			return m;
	}
}
void Boundary()
{
	LB.y=Ax[ (int)(LB.x=BS_inc(-MAXB,0,true)) ].v1;
	BB.x=Ay[ (int)(BB.y=BS_inc(-MAXB,0,false))].v1;
	RB.y=Ax[ (int)(RB.x=BS_dec(0,MAXB,true))  ].v1;
	TB.x=Ay[ (int)(TB.y=BS_dec(0,MAXB,false)) ].v1;
}
double FP(point p1,point p2)
{
	return (p1.x * p2.y)-(p2.x * p1.y);
}
inline bool online(point p1,point p2,point p3,point p4)
{
	point r1,r2;
	r1.x=p1.x-p2.x; r1.y=p1.y-p2.y;
	r2.x=p3.x-p4.x; r2.y=p3.y-p4.y;
	return fabs(FP(r1,r2))<zero;
}
bool check(int p,int m)
{
	point p1,p2,r1,r2;
	ask A;
	r1.x=p; r2.x=p+1;
	A=Ask(p,true);
	r1.y=opt(A.v1,A.v2);
	A=Ask(p+1,true);
	r2.y=opt(A.v1,A.v2);
	p1.x=m; p2.x=m+1;
	A=Ask(m,true);
	p1.y=opt(A.v1,A.v2);
	A=Ask(m+1,true);
	p2.y=opt(A.v1,A.v2);
	return !online(r1,r2,p1,p2);
}
int BS(int a,int b,int p)
{
	int m;
	if (a>b || !check(p,b))
		return MAXB+1;
	while (a+1<b)
	{
		m=(a+b)>>1;
		if (check(p,m))
			b=m;
		else
			a=m+1;
	}
	if (check(p,a))
		b=a;
	return b;
}
void Vertex()
{
	int x,x1;
	V[++N]=LB;
	opt=min;
	for (x=LB.x;x<BB.x;x=x1)
	{
		x1=BS(x+1,BB.x-1,x);
		if (x1==MAXB+1) break;
		V[++N].x=x1;
		V[N].y=opt(Ax[x1].v1,Ax[x1].v2);
	}
	if (BB.x!=LB.x || BB.y!=LB.y)
		V[++N]=BB;
	for (x=BB.x;x<RB.x;x=x1)
	{
		x1=BS(x+1,RB.x-1,x);
		if (x1==MAXB+1) break;
		V[++N].x=x1;
		V[N].y=opt(Ax[x1].v1,Ax[x1].v2);
	}
	opt=max;
	for (x=LB.x;x<TB.x;x=x1)
	{
		x1=BS(x+1,TB.x-1,x);
		if (x1==MAXB+1) break;
		V2[++N2].x=x1;
		V2[N2].y=opt(Ax[x1].v1,Ax[x1].v2);
	}
	if (TB.x!=LB.x || TB.y!=LB.y)
		V2[++N2]=TB;
	for (x=TB.x;x<RB.x;x=x1)
	{
		x1=BS(x+1,RB.x-1,x);
		if (x1==MAXB+1) break;
		V2[++N2].x=x1;
		V2[N2].y=opt(Ax[x1].v1,Ax[x1].v2);
	}
	if ((BB.x!=RB.x || BB.y!=RB.y)&&(TB.x!=RB.x || TB.y!=RB.y))
		V2[++N2]=RB;
	for (;N2>=1;N2--)
		V[++N]=V2[N2];
}
void Square()
{
	int i;
	double S=0,k;
	for (i=1;i<N;i++)
	{
		k=FP(V[i],V[i+1]);
		if (k<0) k=-k;
		S+=k;
	}
	k=FP(V[N],V[1]);
	if (k<0) k=-k;
	S+=k;
	S/=2;
	ret_area(S);
}
void solve()
{
	Boundary();
	Vertex();
	Square();
	ret_n(N);
	for (int i=1;i<=N;i++)
		ret_vertex(V[i].x,V[i].y);
}
int main()
{
	init();
	solve();
	return 0;
}

/* 
 * Problem: NOI1997 perfecttour
 * Author: Guo Jiabao
 * Time: 2009.2.14 14:01
 * State: Solved
*/
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
 
using namespace std;
const int MAXN=20001;
int M,N,i,j,t,T,Ans;
int A[MAXN];
 
int main()
{
	freopen("perfecttour.in","r",stdin);
	freopen("perfecttour.out","w",stdout);
	scanf("%d%d",&M,&N);
	N--;
	for (j=1;j<=N;j++)
		A[j]=-0x7FFFFFFF;
	for (i=1;i<=M;i++)
		for (j=1;j<=N;j++)
		{
			scanf("%d",&t);
			if (t>A[j])
				A[j]=t;
		}
	for (i=1,T=0;i<=N;i++)
	{
		T+=A[i];
		if (T<0)
			T=0;
		if (T>Ans)
			Ans=T;
	}
	printf("%dn",Ans);
	return 0;
}

/* 
 * Problem: NOI1997 competitionsort
 * Author: Guo Jiabao
 * Time: 2009.2.13 14:09
 * State: Solved
*/
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
 
using namespace std;
const int MAXN=1001;
int sum[MAXN],S[MAXN][9];
double avg[9],pos[MAXN],y[MAXN][9];
struct inf{int id,sum;double pos;} P[MAXN];
int N;
void init()
{
	freopen("competitionsort.in","r",stdin);
	freopen("competitionsort.out","w",stdout);
	scanf("%d",&N);
	for (int i=1;i<=N;i++)
		for (int j=1;j<=8;j++)
			scanf("%d",&S[i][j]);
}
 
inline double ABS(double A)
{
	return A<0?-A:A;
}
 
inline int cmp(const void *a,const void *b)
{
	if (((inf *)a)->pos > ((inf *)b)->pos) return -1;
	if (((inf *)a)->pos < ((inf *)b)->pos) return 1;
	if (((inf *)a)->sum > ((inf *)b)->sum) return -1;
	if (((inf *)a)->sum < ((inf *)b)->sum) return 1;
	if (((inf *)a)->id < ((inf *)b)->id) return -1;
	return 1;
}
 
void statistics()
{
	int i,j;
	double m[8];
	for (j=1;j<=8;j++)
	{
		for (i=1;i<=N;i++)
		{
			avg[j]+=S[i][j];
			sum[i]+=S[i][j];
		}
		avg[j]/=N;
	}
	for (j=1;j<=8;j++)
	{
		m[j]=0;
		for (i=1;i<=N;i++)
			m[j]+=ABS(S[i][j]-avg[j]);
		m[j]/=N;
	}
	for (i=1;i<=N;i++)
	{
		for (j=1;j<=8;j++)
		{
			if (m[j]==0)
				y[i][j]=0;
			else
				y[i][j]=(S[i][j]-avg[j])/m[j];
		}
		for (j=1;j<=3;j++)
			pos[i]+=y[i][j];
		for (j=4;j<=8;j++)
			pos[i]+=y[i][j]*0.8;
		P[i].pos=pos[i];
		P[i].sum=sum[i];
		P[i].id=i;
	}
	qsort(P+1,N,sizeof(P[0]),cmp);
	for (i=1;i<=N;i++)
		printf("%dn",P[i].id);
}
 
int main()
{
	init();
	statistics();
	return 0;
}

/* 
 * Problem: NOI1997 buildinggame
 * Author: Guo Jiabao
 * Time: 2009.2.12 13:53
 * State: Solved
*/
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
using namespace std;
const int MAX=101,INF=0x7FFFFFFF;
struct block{int a,b,c;}B[MAX];
int F[MAX][MAX][3];
int N,M,Ans;
void init()
{
	int i,j,k;
	freopen("buildinggame.in","r",stdin);
	freopen("buildinggame.out","w",stdout);
	scanf("%d%d",&N,&M);
	for (i=1;i<=N;i++)
		scanf("%d%d%d",&B[i].a,&B[i].b,&B[i].c);
	for (i=0;i<=N;i++)
		for (j=0;j<=M;j++)
			for (k=0;k<3;k++)
				F[i][j][k]=-INF;
	F[0][0][0]=0;
}
 
inline block roll(block A,int k)
{
	int t;
	if (k==1){t=A.b;A.b=A.c;A.c=t;}
	if (k==2){t=A.a;A.a=A.b;A.b=A.c;A.c=t;}
	return A;
}
 
inline bool available(block A,int k1,block B,int k2)
{
	A=roll(A,k1);B=roll(B,k2);
	return (B.a>=A.a && B.b>=A.b) || (B.a>=A.b && B.b>=A.a);
}
 
void dynamic()
{
	int i,j,k,a,b;
	block T;
	for (i=1;i<=N;i++)
		for (j=1;j<=M;j++)
			for (k=0;k<3;k++)
			{
				for (a=0;a<i;a++)
					for (b=0;b<3;b++)
					{
						if (available(B[i],k,B[a],b) && F[a][j][b] > F[i][j][k])
							F[i][j][k] = F[a][j][b];
						if ( F[a][j-1][b] > F[i][j][k] )
							F[i][j][k] = F[a][j-1][b];
					}
				if ((F[i][j][k] += (T=roll(B[i],k)).c) >Ans)
					Ans=F[i][j][k];
			}
}
 
int main()
{
	init();
	dynamic();
	printf("%dn",Ans);
	return 0;
}

/* 
 * Problem: NOI1997 bustravel
 * Author: Guo Jiabao
 * Time: 2009.2.14 19:10
 * State: Solved
*/
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
using namespace std;
const int MAXM=101,MAXN=501,INF=0x7FFFFFF;
struct edge{edge *next;int t,v;};
struct adjl{edge *f,*l;};
int M,N,Total,Target,EC=-1,Queue_cnt,Queue_head,Queue_tail;
int BusLine[MAXM][MAXN]; //第i行第j个点的原始编号
int BusHash[MAXM][MAXN]; //第i行原始编号为j的点正式编号
int sp[MAXM*MAXN],Queue[MAXM*MAXN];
bool inQueue[MAXM*MAXN];
edge ES[MAXM*MAXN];
adjl Adjl[MAXM*MAXN];
void init()
{
	int i,j,k,c;
	freopen("bustravel.in","r",stdin);
	freopen("bustravel.out","w",stdout);
	scanf("%d%d",&M,&N);
	for (i=1;i<=M;i++)
	{
		do c=getchar(); while(c==10 || c==13);
		for (j=0;(c!=10 && c!=13 && c!=EOF);)
		{
			ungetc(c,stdin);
			scanf("%d",&k);
			BusLine[i][++j]=k;
			BusHash[i][k]=++Total;
			c=getchar();
		}
		BusLine[i][0]=j;
	}
	Target=++Total;
}
 
void addedge(int a,int b,int v)
{
	edge *p=&ES[++EC];
	if (Adjl[a].l)
		Adjl[a].l=Adjl[a].l->next=p;
	else
		Adjl[a].f=Adjl[a].l=p;
	p->next=0;p->t=b;p->v=v;
}
 
void makegraph()
{
	int i,j,k,p,a,b;
	for (i=1;i<=M;i++)
	{
		for (j=1;j<=BusLine[i][0]-1;j++)
		{
			a=BusHash[i][ BusLine[i][j]   ];
			b=BusHash[i][ BusLine[i][j+1] ];
			addedge(a,b,0);
			if (BusLine[i][j]==1)
				addedge(0,a,0);
			else if (BusLine[i][j]==N)
				addedge(a,Target,0);
		}
		if (BusLine[i][j]==1)
			addedge(0,b,0);
		else if (BusLine[i][j]==N)
			addedge(b,Target,0);
	}
	for (i=1;i<=M-1;i++)
	{
		for (j=1;j<=BusLine[i][0];j++)
		{
			p=BusLine[i][j];
			a=BusHash[i][p];
			for (k=i+1;k<=M;k++)
			{
				b=BusHash[k][p];
				if (b)
				{
					addedge(a,b,1);
					addedge(b,a,1);
				}
			}
		}
	}
}
 
void Queue_ins(int p)
{
	if (++Queue_head==MAXM*MAXN) Queue_head=0;
	Queue[Queue_head]=p;
	inQueue[p]=true;
	Queue_cnt++;
}
 
int Queue_pop()
{
	int p=Queue[Queue_tail];
	if (++Queue_tail==MAXM*MAXN) Queue_tail=0;
	inQueue[p]=false;
	Queue_cnt--;
	return p;
}
 
void spfa()
{
	int i,u,v;
	for (i=1;i<=Total;i++)
		sp[i]=INF;
	Queue_head=-1;Queue_tail=0;
	Queue_ins(0);
	while (Queue_cnt)
	{
		u=Queue_pop();
		for (edge *k=Adjl[u].f;k;k=k->next)
		{
			v=k->t;
			if (sp[u] + k->v < sp[v])
			{
				sp[v]=sp[u] + k->v;
				if (!inQueue[v])
					Queue_ins(v);
			}
		}
	}
}
 
int main()
{
	init();
	makegraph();
	spfa();
	if (sp[Target]==INF)
		printf("NOn");
	else
		printf("%dn",sp[Target]);
	return 0;
}

/* 
 * Problem: NOI1997 satellitecover
 * Author: Guo Jiabao
 * Time: 2009.2.11 21:17
 * State: Solved
*/
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
using namespace std;
const int MAXN=201;
struct cube{int x1,y1,z1,x2,y2,z2;};
int N;
cube Cubes[MAXN];
 
void init()
{
	int i,a,b,c,r;
	freopen("satellitecover.in","r",stdin);
	freopen("satellitecover.out","w",stdout);
	scanf("%d",&N);
	for (i=1;i<=N;i++)
	{
		scanf("%d%d%d%d",&a,&b,&c,&r);
		Cubes[i].x1=a-r; Cubes[i].y1=b-r; Cubes[i].z1=c-r;
		Cubes[i].x2=a+r; Cubes[i].y2=b+r; Cubes[i].z2=c+r;
	}
}
 
inline bool cross(cube A,cube B)
{
	return A.x1 < B.x2 && A.y1 < B.y2 && A.z1 < B.z2 && B.x1 < A.x2 && B.y1 < A.y2 && B.z1 < A.z2;
}
 
cube mcube(int x1,int y1,int z1,int x2,int y2,int z2)
{
	cube A;
	A.x1=x1;A.y1=y1;A.z1=z1;A.x2=x2;A.y2=y2;A.z2=z2;
	return A;
}
 
int devide(cube A,int pos)
{
	cube B;
	int volume=0;
	while (pos<=N && !cross(A,B=Cubes[pos])) pos++;
	if (pos>N)
		volume=(A.x2-A.x1)*(A.y2-A.y1)*(A.z2-A.z1);
	else
	{
		if (A.x1 < B.x1)
		{
			volume+=devide(mcube(A.x1,A.y1,A.z1,B.x1,A.y2,A.z2),pos+1);
			A.x1=B.x1;
		}
		if (A.x2 > B.x2)
		{
			volume+=devide(mcube(B.x2,A.y1,A.z1,A.x2,A.y2,A.z2),pos+1);
			A.x2=B.x2;
		}
		if (A.y1 < B.y1)
		{
			volume+=devide(mcube(A.x1,A.y1,A.z1,A.x2,B.y1,A.z2),pos+1);
			A.y1=B.y1;
		}
		if (A.y2 > B.y2)
		{
			volume+=devide(mcube(A.x1,B.y2,A.z1,A.x2,A.y2,A.z2),pos+1);
			A.y2=B.y2;
		}
		if (A.z1 < B.z1)
			volume+=devide(mcube(A.x1,A.y1,A.z1,A.x2,A.y2,B.z1),pos+1);
		if (A.z2 > B.z2)
			volume+=devide(mcube(A.x1,A.y1,B.z2,A.x2,A.y2,A.z2),pos+1);
	}
	return volume;
}
 
int main()
{
	int i,totalvolume=0;
	init();
	for (i=N;i>-1;i--)
		totalvolume+=devide(Cubes[i],i+1);
	printf("%dn",totalvolume);
	return 0;
}

/* 
 * Problem: NOI1997 wildcard
 * Author: Guo Jiabao
 * Time: 2009.2.15 20:17
 * State: Solved
*/
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
using namespace std;
const int MAXN=251,MAXS=62;
const char CharSet[]="0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz";
struct File{int name[10],len,matchpre[10],precnt;bool permission;};
int N,N_p,pattern[10],Apt[10],Max_Length,Ans,Nowlen,Al,ccnt;
File F[MAXN];
bool used[200];
int chas[62];
void dfs(int len);
inline int CharToID(char c)
{
	if (c>='0' && c<='9')return c-'0';
	return (c>='A' && c<='Z')?c-'A'+10:c-'a'+36;
}
inline int cmp(const void *a,const void *b)
{return ((File *)a)->permission==false?-1:1;}
void init()
{
	int i,k;
	char c,Name[10];
	freopen("wildcard.in","r",stdin);
	freopen("wildcard.out","w",stdout);
	c=getchar();
	while (c!=EOF)
	{
		ungetc(c,stdin);
		scanf("%s",Name);
		N++;
		for (i=0;Name[i];i++)
		{
			F[N].name[i+1]=k=CharToID(Name[i]);
			used[k]=true;
		}
		F[N].len=i;
		if (i>Max_Length)
			Max_Length=i;
		c=getchar();c=getchar();
		if (c=='+')
		{
			N_p++;
			F[N].permission=true;
		}
		else
			F[N].permission=false;
		F[N].precnt=1;
		c=getchar();c=getchar();
	}
	qsort(F+1,N,sizeof(F[0]),cmp);
	for (i=0;i<MAXS;i++)
		if (used[i])
			chas[++ccnt]=i;
}
bool update(int k)
{
	int i,j,Newans=0,Pans=0;
	bool np=false,tb;
	for (i=1;i<=N;i++)
	{
		tb=false;
		for (j=1;j<=F[i].precnt;j++)
			tb|=F[i].matchpre[j]==F[i].len || ( F[i].matchpre[j]>=0 && pattern[k]==-1 );
		if (tb)
		{
			if (F[i].permission )
				Newans++;
			else
				np=true; //匹配了负串
		}
		if (F[i].permission && F[i].precnt==0)
			Pans++; //记录正串不匹配的个数
	}
	if (Pans==N_p || (N_p-Pans<Ans)) //若正串全部不匹配 或者 前缀匹配串的个数小于已有答案 剪枝
		return false;
	if (pattern[k]==-1 && Newans<Ans) //如果匹配串末字符是*，当前答案小于最优，继续添加一定是多余的  剪枝
		return false;
	if (!np)
	{
		if (Newans>Ans)
		{
			Ans=Newans;
			for(i=1;i<=k;i++)
				Apt[i]=pattern[i];
			Al=k;
		}
		else if (Newans==Ans && k<Al)
		{
			for(i=1;i<=k;i++)
				Apt[i]=pattern[i];
			Al=k;
		}
	}
	return true;
}
 
void match(File &F,int len)
{
	bool newpre[10]={false};
	int k,i;
	if (pattern[len-1]!=-1)
	{
		for (k=1;k<=F.precnt;k++)
			if (F.matchpre[k]+1<=F.len && (pattern[len]==-2 || F.name[F.matchpre[k]+1]==pattern[len]))
				newpre[F.matchpre[k]+1]=true;
	}
	else
	{
		for (k=1;k<=F.precnt;k++)
			for (i=F.matchpre[k]+1;i<=F.len;i++)
				if (F.name[i]==pattern[len] || pattern[len]==-2)
					newpre[i]=true;
	}
	F.precnt=0;
	for (k=1;k<9;k++)
		if (newpre[k])
			F.matchpre[ ++F.precnt ]=k;
}
 
void goon(int len,int p)
{
	if (p==N+1)
	{
		if (update(len))
			dfs(len+1);
		return;
	}
	int i,tprecnt,tmatch[10];
	if (F[p].precnt==0)
		goon(len,p+1);
	else
	{
		/*backup*/
		for (i=1;i<=F[p].precnt;i++)
			tmatch[i]=F[p].matchpre[i];
		tprecnt=F[p].precnt;
		/*backup*/
		if (pattern[len-1]==-1)
		{
			match(F[p],len);
			goon(len,p+1);
		}
		else
		{
			if (pattern[len]!=-1)
				match(F[p],len);
			goon(len,p+1);
		}
		/*restore*/
		F[p].precnt=tprecnt;
		for (i=1;i<=F[p].precnt;i++)
			F[p].matchpre[i]=tmatch[i];
		/*restore*/
	}
}
 
void dfs(int len) //-1:* -2:?
{
	if (len>Max_Length)
		return;
	int i;
	if (pattern[len-1]!=-1)//**不连用 但允许?*
	{
		pattern[len]=-1;
		goon(len,1);
	}
	if (pattern[len-1]!=-1)//不允许*?
	{
		pattern[len]=-2;
		goon(len,1);
	}
	for (i=1;i<=ccnt;i++)
	{
		pattern[len]=chas[i];
		goon(len,1);
	}
}
 
void print()
{
	printf("%dn",Ans);
	for (int i=1;i<=Al;i++)
		if (Apt[i]>=0)
			putchar(CharSet[Apt[i]]);
		else if (Apt[i]==-1)
			putchar('*');
		else
			putchar('?');
	putchar('n');
}
 
int main()
{
	init();
	dfs(1);
	print();
	return 0;
}

function getz($Ab)
{
	$str='/^';
	$Ab=str_replace('*','[a-zA-Z0-9]{0,8}',$Ab);
	$Ab=str_replace('?','[a-zA-Z0-9]{1}',$Ab);
	$str.=$Ab.'$/';
	return $str;
}

function plugin_compare($fin,$fout,$fans)
{
	$score=0;
	fscanf($fout,"%s",$As);
	fscanf($fout,"%s",$Ab);
	fscanf($fans,"%s",$Bs);
	fscanf($fans,"%s",$Bb);
	if ($As==$Bs)
	{
		$score=0.5;
		if (strlen($Ab)==strlen($Bb))
		{
			$zab=getz($Ab);
			$score=0.6;
			$pcnt=0;$wrong=false;
			while (!feof($fin))
			{
				fscanf($fin,"%s %sn",$subject,$method);
				$r=preg_match($zab,$subject);
				if ($r && $method=='+')
					$pcnt++;
				if ($r && $method=='-')
					$wrong=true;
			}
			if ($As==$pcnt && !$wrong)
				$score=1;
		}
	}
	return $score;
}