//By SiriusRen

#include <cstdio>

#include <algorithm>

using namespace std;

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

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

    if(!b){x=,y=;return a;}

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

    x=y;y=tt-a/b*y;return tmp;

}

bool solve(int m){

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

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

            int k,b,t2=c[i]-c[j],tt=exgcd(((p[j]-p[i])%m+m)%m,m,k,b);

            if(t2%tt)continue;

            int tmp=t2/tt;

            k=((k*tmp)%(m/tt)+(m/tt))%(m/tt);

            if(k<=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]),mx=max(mx,c[i]);

    for(int i=mx;;i++)if(solve(i)){printf("%d\n",i);return ;}

}