Problem: There are N cities in a two-dimensional plane. The coordinates of the i-th city is (x_i, y_i). Initially, the amount of water stored in the i-th city is a_i liters.

Snuke can carry any amount of water from a city to another city. However, water leaks out a bit while he carries it. If he carries l liters of water from the s-th city to the t-th city, only max(l-d_{s,t}, 0) liters of water remains when he arrives at the destination. Here d_{s,t} denotes the (Euclidean) distance between the s-th city and the t-th city. He can perform arbitrary number of operations of this type.

Snuke wants to maximize the minimum amount of water among the N cities. Find the maximum X such that he can distribute at least X liters of water to each city.

Constraints

* 1 ≤ N ≤ 15
* 0 ≤ x_i, y_i, a_i ≤ 10^9
* All values in the input are integers.
* No two cities are at the same position.

Input

The input is given from Standard Input in the following format:


N
x_1 y_1 a_1
:
x_N y_N a_N


Output

Print the maximum of the minimum amount of water among the N cities. The absolute error or the relative error must be at most 10^{-9}.

Examples

Input

3
0 0 10
2 0 5
0 5 8


Output

6.500000000000


Input

15
335279264 849598327 822889311
446755913 526239859 548830120
181424399 715477619 342858071
625711486 448565595 480845266
647639160 467825612 449656269
160714711 336869678 545923679
61020590 573085537 816372580
626006012 389312924 135599877
547865075 511429216 605997004
561330066 539239436 921749002
650693494 63219754 786119025
849028504 632532642 655702582
285323416 611583586 211428413
990607689 590857173 393671555
560686330 679513171 501983447


Output

434666178.237122833729

Solution (in CPP):

Solution:
#include<deque>
#include<queue>
#include<vector>
#include<algorithm>
#include<iostream>
#include<set>
#include<cmath>
#include<tuple>
#include<string>
//#include<chrono>
#include<functional>
#include<iterator>
#include<random>
#include<list>
#include<unordered_set>
#include<array>
#include<map>
#include<iomanip>
#include<assert.h>
#include<bitset>
#include<stack>
using namespace std;
typedef long long int llint;
typedef long double lldo;
#define mp make_pair
#define mt make_tuple
#define pub push_back
#define puf push_front
#define pob pop_back
#define pof pop_front
#define fir first
#define sec second
#define res resize
#define ins insert
#define era erase
/*
cout<<setprecision(20);
cin.tie(0);
ios::sync_with_stdio(false);
*/
const llint mod=1e9+7;
const llint big=2.19e15+1;
const long double pai=3.141592653589793238462643383279502884197;
const long double eps=1e-15;
template <class T,class U>void mineq(T& a,U b){if(a>b){a=b;}}
template <class T,class U>void maxeq(T& a,U b){if(a<b){a=b;}}
llint gcd(llint a,llint b){if(a%b==0){return b;}else return gcd(b,a%b);}
//llint lcm(llint a,llint b){return a/gcd(a,b)*b;}
template<class T> void SO(T& ve){sort(ve.begin(),ve.end());}
template<class T> void REV(T& ve){reverse(ve.begin(),ve.end());}
template<class T>llint LBI(vector<T>&ar,T in){return lower_bound(ar.begin(),ar.end(),in)-ar.begin();}
template<class T>llint UBI(vector<T>&ar,T in){return upper_bound(ar.begin(),ar.end(),in)-ar.begin();}
int main(void){
	//最小全域木を作る、最小全域木でつながった中で任意の配分ができる
	//二分探索ではなく有理数でも解くことができる
	//3^n DP しかなくない?
	cout<<setprecision(20);
	double dp[32768];
	llint i,j,n;cin>>n;
	double x[15],y[15];
	double a[15];
	for(i=0;i<(1<<n);i++){dp[i]=big;}
	for(i=0;i<n;i++){cin>>x[i]>>y[i]>>a[i];dp[1<<i]=0;}
	//全域木のコストを求める,葉に何かを入れるタイプの探索をする
	for(int bi=1;bi<(1<<n);bi++){
		for(i=0;i<n;i++){
			if(!(bi&(1<<i))){continue;}
			for(j=0;j<n;j++){
				if(!(bi&(1<<j))){continue;}
				if(i==j){continue;}
				mineq(dp[bi],dp[bi-(1<<j)]+sqrt((x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j])));
			}
		}
	}
	for(int bi=1;bi<(1<<n);bi++){
		double wata=0,mati=0;
		for(i=0;i<n;i++){if(bi&(1<<i)){wata+=a[i];mati+=1;}}
		dp[bi]=(wata-dp[bi])/mati;
	}
	for(int bi=1;bi<(1<<n);bi++){
		for(int Anum=0;Anum<bi;Anum++){
			while(-1){
				int x=Anum&(~bi);
				if(x==0){break;}
				else{Anum+=x;}
			}
			int Bnum=bi-Anum;
			maxeq(dp[bi],min(dp[Anum],dp[Bnum]));
		}
	}
	cout<<dp[(1<<n)-1]<<endl;
	return 0;
}