Problem: Anchored Balloon

A balloon placed on the ground is connected to one or more anchors on the ground with ropes. Each rope is long enough to connect the balloon and the anchor. No two ropes cross each other. Figure E-1 shows such a situation.

<image>
Figure E-1: A balloon and ropes on the ground

Now the balloon takes off, and your task is to find how high the balloon can go up with keeping the rope connections. The positions of the anchors are fixed. The lengths of the ropes and the positions of the anchors are given. You may assume that these ropes have no weight and thus can be straightened up when pulled to whichever directions. Figure E-2 shows the highest position of the balloon for the situation shown in Figure E-1.

<image>
Figure E-2: The highest position of the balloon

Input

The input consists of multiple datasets, each in the following format.

> n
>  x1 y1 l1
>  ...
>  xn yn ln
>

The first line of a dataset contains an integer n (1 ≤ n ≤ 10) representing the number of the ropes. Each of the following n lines contains three integers, xi, yi, and li, separated by a single space. Pi = (xi, yi) represents the position of the anchor connecting the i-th rope, and li represents the length of the rope. You can assume that −100 ≤ xi ≤ 100, −100 ≤ yi ≤ 100, and 1 ≤ li ≤ 300. The balloon is initially placed at (0, 0) on the ground. You can ignore the size of the balloon and the anchors.

You can assume that Pi and Pj represent different positions if i ≠ j. You can also assume that the distance between Pi and (0, 0) is less than or equal to li−1. This means that the balloon can go up at least 1 unit high.

Figures E-1 and E-2 correspond to the first dataset of Sample Input below.

The end of the input is indicated by a line containing a zero.

Output

For each dataset, output a single line containing the maximum height that the balloon can go up. The error of the value should be no greater than 0.00001. No extra characters should appear in the output.

Sample Input


3
10 10 20
10 -10 20
-10 10 120
1
10 10 16
2
10 10 20
10 -10 20
2
100 0 101
-90 0 91
2
0 0 53
30 40 102
3
10 10 20
10 -10 20
-10 -10 20
3
1 5 13
5 -3 13
-3 -3 13
3
98 97 168
-82 -80 193
-99 -96 211
4
90 -100 160
-80 -80 150
90 80 150
80 80 245
4
85 -90 290
-80 -80 220
-85 90 145
85 90 170
5
0 0 4
3 0 5
-3 0 5
0 3 5
0 -3 5
10
95 -93 260
-86 96 211
91 90 177
-81 -80 124
-91 91 144
97 94 165
-90 -86 194
89 85 167
-93 -80 222
92 -84 218
0


Output for the Sample Input


17.3205081
16.0000000
17.3205081
13.8011200
53.0000000
14.1421356
12.0000000
128.3928757
94.1879092
131.1240816
4.0000000
72.2251798






Example

Input

3
10 10 20
10 -10 20
-10 10 120
1
10 10 16
2
10 10 20
10 -10 20
2
100 0 101
-90 0 91
2
0 0 53
30 40 102
3
10 10 20
10 -10 20
-10 -10 20
3
1 5 13
5 -3 13
-3 -3 13
3
98 97 168
-82 -80 193
-99 -96 211
4
90 -100 160
-80 -80 150
90 80 150
80 80 245
4
85 -90 290
-80 -80 220
-85 90 145
85 90 170
5
0 0 4
3 0 5
-3 0 5
0 3 5
0 -3 5
10
95 -93 260
-86 96 211
91 90 177
-81 -80 124
-91 91 144
97 94 165
-90 -86 194
89 85 167
-93 -80 222
92 -84 218
0


Output

17.3205081
16.0000000
17.3205081
13.8011200
53.0000000
14.1421356
12.0000000
128.3928757
94.1879092
131.1240816
4.0000000
72.2251798

Solution (in CPP):

Solution:
#include<bits/stdc++.h>
using namespace std;
typedef complex<double> P;
double eps=1e-8;
struct S{
  P s,t;
  S(P s=P(),P t=P()): s(s),t(t) {}
};
struct C{
  P p;
  double r;
  C(P p=P(),double r=0):p(p),r(r){}
};
 
 
bool eq(double a,double b){
  return (-eps<a-b&&a-b<eps);
}
 
double Sqrt(double a){
  if(a<0)return 0;
  return sqrt(a);
}

bool isIntersect(C a,C b){
  double k=abs(a.p-b.p);
  return (a.r+b.r>=k-eps&& abs(a.r-b.r)<=k+eps);
}

P crossPoint(C a,C b){
  P base=b.p-a.p;
  double k=(-b.r*b.r+a.r*a.r+norm(base));
  double w=k/(2.0*abs(base)),h=Sqrt(a.r*a.r-w*w);
  base/=abs(base);
  return a.p+base*P(w,h);
}


bool isIntersect(vector<C> &vec){
  vector<P> t;
  for(int i=0;i<(int)vec.size();i++){
    t.push_back(vec[i].p);
    for(int j=0;j<i;j++){
      if(isIntersect(vec[i],vec[j])){
        t.push_back(crossPoint(vec[i],vec[j]));
        t.push_back(crossPoint(vec[j],vec[i]));
      }
    }
  }
  for(int i=0;i<(int)t.size();i++){
    bool flg=true;
    for(int j=0;j<(int)vec.size();j++)
      if(vec[j].r*vec[j].r+eps<norm(vec[j].p-t[i]))flg=false;
    if(flg)return true;
  }
  return false;
}

int n;
vector<P> t;
vector<double> u;

double check(double M){
  vector<C> nt(n);
  for(int i=0;i<n;i++){
    nt[i].p=t[i];
    nt[i].r=Sqrt(u[i]*u[i]-M*M);
  }
  return isIntersect(nt);
}

double solve(){
  double L=0,R=1e8,M;
  for(int i=0;i<n;i++)R=min(R,u[i]);
  
  for(int i=0;i<1000;i++){
    M=(L+R)/2;
    if(check(M))L=M;
    else R=M;
  }
  
  return L;
}

int main(){
  while(1){
    cin>>n;
    if(n==0)break;
    t.clear();t.resize(n);
    u.clear();u.resize(n);
    for(int i=0;i<n;i++){
      double x,y;
      cin>>x>>y>>u[i];
      t[i]=P(x,y);
    }
    printf("%.10f\n",solve());
  }
}