#include<iostream>

 #include<cstdio>

 #include<cstring>

 #include<algorithm>

 #include<cmath>

 using namespace std;

 const int maxn=;

 long long n,p[]={},l[]={},c[]={};

 int exgcd(int a,int b,long long &x,long long &y){

     if(!b){

         x=;y=;

         return a;

     }

     int d=exgcd(b,a%b,x,y);

     long long w=x;x=y;

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

     return d;

 }

 int main(){

     scanf("%d",&n);long long a,b,m,d,x,y,now=n;

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

         scanf("%I64d%I64d%I64d",&c[i],&p[i],&l[i]);

         now=max(now,c[i]);

     }

     for(int k=now;;k++){

         int f=;

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

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

                 a=p[i]-p[j];b=k;m=c[j]-c[i];

                 d=exgcd(a,b,x,y);

                 if(m%d)continue;

                 b/=d;m/=d;x=x*m;x%=b;

                 if(x<)x+=abs(b);

                 if(x<=min(l[i],l[j])){f=;break;}

             }

             if(f)break;

         }

         if(!f){

             printf("%d\n",k);

             break;

         }

     }

     return ;

 }