//By SiriusRen

#include <cmath>

#include <cstdio>

#include <algorithm>

using namespace std;

#define eps 1e-9

int n,cases,top,tot,k,rem,ansrem,ans;

double length,tempdis,wei,answei,remwei;

struct Tree{double x,y,v,l;}tr[],point[],tubao[];

bool operator<(Tree a,Tree b){if(abs(a.x-b.x)<eps)return a.y<b.y;return a.x<b.x;}

double operator*(Tree a,Tree b){return a.x*b.y-a.y*b.x;}

Tree operator-(Tree a,Tree b){Tree c;c.x=a.x-b.x;c.y=a.y-b.y;return c;}

double dis(Tree a){return sqrt(a.x*a.x+a.y*a.y);}

double cross(Tree a,Tree b,Tree c){return (a-c)*(b-c);}

int main(){

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

        answei=;

        for(int i=;i<n;i++)scanf("%lf%lf%lf%lf",&tr[i].x,&tr[i].y,&tr[i].v,&tr[i].l);

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

            length=tot=top=rem=tempdis=wei=;

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

                if(i&(<<j))point[++tot]=tr[j],rem++;

                else length+=tr[j].l,wei+=tr[j].v;

            }

            sort(point+,point++tot);

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

                while(top>&&cross(tubao[top],point[j],tubao[top-])<-eps)top--;

                tubao[++top]=point[j];

            }k=top;

            for(int j=tot-;j>=;j--){

                while(top>k&&cross(tubao[top],point[j],tubao[top-])<-eps)top--;

                tubao[++top]=point[j];

            }

            for(int j=;j<top;j++)tempdis+=dis(tubao[j]-tubao[j+]);

            if(tempdis<length){

                if(wei<answei)answei=wei,ansrem=rem,ans=i,remwei=length-tempdis;

                else if(wei==answei&&rem<ansrem)ansrem=rem,ans=i,remwei=length-tempdis;

            }

        }

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

        for(int j=;j<n;j++)if(!(ans&(<<j)))printf(" %d",j+);

        printf("\nExtra wood: %.2lf\n\n",remwei);

    }

}