#include<cstdio>

#include<cstring>

#include<algorithm>

#include<cmath>

using namespace std;

const int maxn=;

const int inf=0x3f3f3f3f;

struct Point{

    int x,y;

    Point():x(),y(){}

    Point(int x,int y):x(x),y(y){}

};

int n,cas,val,num,res[maxn],v[maxn],l[maxn],vis[maxn];

double ext;

int top,stack[maxn];

Point pt[maxn],list[maxn];

int cross(Point p0,Point p1,Point p2){

    return (p1.x-p0.x)*(p2.y-p0.y)-(p2.x-p0.x)*(p1.y-p0.y);

}

double dis(Point p1,Point p2){

    return sqrt((double)(p2.x-p1.x)*(p2.x-p1.x)+(p2.y-p1.y)*(p2.y-p1.y));

}

bool cmp(Point p1,Point p2){

    int tmp=cross(list[],p1,p2);

    if(tmp>) return true;

    else if(tmp==&&dis(list[],p1)<dis(list[],p2)) return true;

    else return false;

}

void init(int m){

    Point p0=list[];

    int k=;

    for(int i=;i<m;++i){

        if((p0.y>list[i].y)||((p0.y==list[i].y)&&(p0.x>list[i].x))){

            p0=list[i];

            k=i;

        }

    }

    list[k]=list[];

    list[]=p0;

    sort(list+,list+m,cmp);

}

double graham(int m){

    if(m==){

        top=;

        stack[]=;

    }

    else{

        top=;

        stack[]=;

        stack[]=;

        for(int i=;i<m;++i){

            while(top>&&cross(list[stack[top-]],list[stack[top]],list[i])<=) --top;

            stack[++top]=i;

        }

    }

    double ret=;

    for(int i=;i<top;++i)

        ret+=dis(list[stack[i]],list[stack[i+]]);

    ret+=dis(list[stack[top]],list[stack[]]);

    return ret;

}

int main(){

    while(scanf("%d",&n),n){

        val=num=inf;

        for(int i=;i<n;++i)

            scanf("%d%d%d%d",&pt[i].x,&pt[i].y,&v[i],&l[i]);

        for(int i=;i<(<<n)-;++i){

            int t1=,t2=,cnt=;

            for(int j=;j<n;++j){

                if((i>>j)&){

                    t1+=v[j],t2+=l[j];

                }

                else{

                    list[cnt++]=pt[j];

                }

            }

            init(cnt);

            int cnt2=n-cnt;

            if((t1<val)||((t1==val)&&(cnt2<num))){

                double tmp=graham(cnt);

                if(tmp>t2) continue;

                val=t1,num=cnt2,ext=t2-tmp;

                int t=;

                for(int j=;j<n;++j){

                    if((i>>j)&)

                        res[t++]=j;

                }

            }

        }

        printf("Forest %d\nCut these trees:",++cas);

        for(int i=;i<num;++i)

            printf(" %d",res[i]+);

        printf("\nExtra wood: %.2f\n\n",ext);

    }

    return ;

}