#include<bits/stdc++.h>
using namespace std;
#define mst(x,y) memset(x,y,sizeof(x))
#define rep(x,y,z) for(int x=(y);(x)<(z);x++)
#define fi first
#define se second
#define mk(x,y) make_pair(x,y)
#define pii pair<int,string>
#define piii pair<int,pii>
#define piiii pair<pair<double,int>,pair<double,int>>
const int maxn=1e4+10;
int n,p,p1,p2,k,c;
int v1,v2;
vector<int> g[maxn];
vector<piiii> ans;
int fa[maxn],num[maxn],assert[maxn],area[maxn],minm[maxn];
int vis[maxn];
int Find(int x){
return x==fa[x]?x:fa[x]=Find(fa[x]);
}
void Union(int x,int y){
int fx=Find(fa[x]),fy=Find(fa[y]);
if(fx==fy) return ;
fa[fx]=fy,num[fy]+=num[fx];
assert[fy]+=assert[fx],area[fy]+=area[fx];
minm[fy]=min(minm[fy],minm[fx]);
return ;
}
int main(){
rep(i,0,maxn) fa[i]=i,num[i]=1,minm[i]=i;
cin>>n;
rep(i,0,n){
cin>>p>>p1>>p2;
vis[p]=1;
if(~p1) vis[p1]=1,g[p].push_back(p1);
if(~p2) vis[p2]=1,g[p].push_back(p2);
cin>>k;
rep(j,0,k){
int x;cin>>x;vis[x]=1;
g[p].push_back(x);
}
cin>>assert[p]>>area[p];
}
rep(i,0,maxn) if(g[i].size())
rep(j,0,g[i].size())
Union(i,g[i][j]);
rep(i,0,maxn) if(fa[i]==i&&vis[i]){
double avgarea=1.0*area[i]/num[i];
double avgset=1.0*assert[i]/num[i];
num[i],minm[i];
ans.push_back(mk(mk(-avgarea,minm[i]),mk(avgset,num[i])));
}
sort(ans.begin(),ans.end());
cout<<ans.size()<<endl;
rep(i,0,ans.size()){
piiii v=ans[i];
printf("%04d %d %.3f %.3f\n",v.fi.se,v.se.se,v.se.fi,-v.fi.fi);
}
return 0;
}