#include<iostream>

#include<cstdio>

#include<cstring>

#include<cmath>

using namespace std;

int n,m,c[],p[],l[];

int gcd(int a,int b){return (a%b==)?b:gcd(b,a%b);}

void exgcd(int a,int b,int &x,int &y)

{

    if(b==)

    {

        x=; y=; return;

    }

    exgcd(b,a%b,x,y);

    int t=x;

    x=y;

    y=t-(a/b)*y;

}

bool ck(int m)

{

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

        for(int j=i+;j<=n;j++)

        {

            int a=p[i]-p[j],b=m,cc=c[j]-c[i];

            int g=gcd(a,b);

//            if(cc%g)return 0;

            if(cc%g)continue;//无解也满足

            a/=g; b/=g; cc/=g;

            int x,y;

//            b=abs(b);

            if(b<)b=-b;

            exgcd(a,b,x,y);

            x=((x*cc)%b+b)%b;//先%b!

//            x=(x*cc+b)%b;

            if(x<=min(l[i],l[j]))return ;

        }

    return ;

}

int main()

{

    scanf("%d",&n);

    for(int i=;i<=n;i++)scanf("%d%d%d",&c[i],&p[i],&l[i]),m=max(m,c[i]);

    for(int i=m;i<=1e6;i++)

        if(ck(i))

        {

            printf("%d",i); return ;

        }

}