// Slower C++ solution:
#include<iostream>

#include<cmath>

#include<cstdio>

#include<vector>

#include<algorithm>

  

using namespace std;

  

double EPS = 1e-10;

  

double add(double a,double b){

  if(abs(a+b)<EPS*(abs(a)+abs(b)))return 0;

  return a+b;

}

  

struct point{

  double x,y;

  point() {}

  point(double x,double y):x(x),y(y){

  }

  point operator + (point p){

    return point(add(x,p.x),add(y,p.y));

  }

  point operator - (point p){

    return point(add(x,-p.x),add(y,-p.y));

  }

  point operator * (double d){

    return point(x*d,y*d);

  }

  point operator / (double d){

    return point(x/d,y/d);

  }

};

  

double dist(point a,point b){

    return sqrt(pow(a.x-b.x,2)+pow(a.y-b.y,2));

}



int main(void){

    int n,x,y,v;

    vector<point>P;

    vector<double>V;

     

    while(cin >> n,n){

        P.clear();

        V.clear();

         

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

            cin >> x >> y >> v;

            P.push_back(point(x,y));

            V.push_back(v);

        }

        

        double r=0.99;

        point now(0,0);

         

        for(double d=10;d>EPS;d*=r){

            int mx=0;

            double mxd=0;

             

            for(int j=0;j<P.size();j++)

                if(dist(now,P[j])/V[j]>mxd)

		  mx=j,mxd=dist(now,P[j])/V[j];

             

            now=now+((P[mx]-now)/dist(P[mx],now)*d);

        }

         

        double ans=0;

        for(int i=0;i<P.size();i++){

	  ans=max(ans,dist(now,P[i])/V[i]);

        }

        printf("%.8f\n",ans);

    }

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 1.174114924273911x):
#include<iostream>

#include<cmath>

#include<cstdio>

#include<vector>

#include<algorithm>

  

using namespace std;

  

double EPS = 1e-8;

  

double add(double a,double b){

  if(abs(a+b)<EPS*(abs(a)+abs(b)))return 0;

  return a+b;

}

  

struct point{

  double x,y;

  point() {}

  point(double x,double y):x(x),y(y){

  }

  point operator + (point p){

    return point(add(x,p.x),add(y,p.y));

  }

  point operator - (point p){

    return point(add(x,-p.x),add(y,-p.y));

  }

  point operator * (double d){

    return point(x*d,y*d);

  }

  point operator / (double d){

    return point(x/d,y/d);

  }

};

  

double dist(point a,point b){

    return sqrt(pow(a.x-b.x,2)+pow(a.y-b.y,2));

}



int main(void){

    int n,x,y,v;

    vector<point>P;

    vector<double>V;

     

    while(cin >> n,n){

        P.clear();

        V.clear();

         

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

            cin >> x >> y >> v;

            P.push_back(point(x,y));

            V.push_back(v);

        }

        

        double r=0.98;

        point now(0,0);

         

        for(double d=10;d>EPS;d*=r){

            int mx=0;

            double mxd=0;

             

            for(int j=0;j<P.size();j++)

                if(dist(now,P[j])/V[j]>mxd)

		  mx=j,mxd=dist(now,P[j])/V[j];

             

            now=now+((P[mx]-now)/dist(P[mx],now)*d);

        }

         

        double ans=0;

        for(int i=0;i<P.size();i++){

	  ans=max(ans,dist(now,P[i])/V[i]);

        }

        printf("%.8f\n",ans);

    }

    return 0;

}