C++ :

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <climits>
#include <cstring>
#include <string>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <vector>
#include <list>
#include <bitset>
#define rep(i,m,n) for(i=m;i<=n;i++)
#define rsp(it,s) for(set<int>::iterator it=s.begin();it!=s.end();it++)
#define vi vector<int>
#define pii pair<int,int>
#define mod 1000000007
#define inf 0x3f3f3f3f
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define ll long long
#define pi acos(-1.0)
const int maxn=1e6+10;
const int dis[4][2]={{0,1},{-1,0},{0,-1},{1,0}};
using namespace std;
ll gcd(ll p,ll q){return q==0?p:gcd(q,p%q);}
ll qpow(ll p,ll q){ll f=1;while(q){if(q&1)f=f*p;p=p*p;q>>=1;}return f;}
int n,m;
struct node
{
    double l,r,len;
}p[maxn];
bool check(double now)
{
    double t=0;
    for(int i=0;i<n;i++)
    {
        if(t+p[i].len/now>p[i].r)return false;
        else
        {
            t=max(t+p[i].len/now,p[i].l);
        }
    }
    return true;
}
int main()
{
    int i,j,k,t;
    scanf("%d",&n);
    rep(i,0,n-1)scanf("%lf%lf%lf",&p[i].l,&p[i].r,&p[i].len);
    double l=0,r=1e10,ans;
    while(r-l>1e-5)
    {
        double mid=(l+r)/2;
        if(check(mid))ans=mid,r=mid;
        else l=mid;
    }
    printf("%.2f\n",ans);
    //system ("pause");
    return 0;
}