#include<iostream>
#include<cstdio>
#include<climits>
#include<cstring>
#include<algorithm>
using namespace std;
#define LL long long
const int maxn=15;
int n;
LL exgcd(__int128 a,__int128 b,__int128 &x,__int128 &y){
if(!b){x=1,y=0;return a;}
LL re=exgcd(b,a%b,x,y),tmp=x;
x=y,y=tmp-(a/b)*y;
return re;
}
__int128 m[maxn],a[maxn];
__int128 work(){
__int128 M=m[1],A=a[1],t,d,x,y;int i;
for(i=2;i<=n;i++){
d=exgcd(M,m[i],x,y);//解方程
if((a[i]-A)%d)return -1;//无解
x*=(a[i]-A)/d,t=m[i]/d,x=(x%t+t)%t;//求x
A=M*x+A,M=M/d*m[i],A%=M;//日常膜一膜(划掉)模一模,防止爆
}
A=(A%M+M)%M;
return A;
}
void _print(__int128 x)
{
if(x > 9) _print(x/10);
putchar(x%10 + '0');
}
void print(__int128 x)//输出
{
if(x < 0)
{
x = -x;
putchar('-');
}
_print(x);
}
int main()
{
// freopen("a.in","r",stdin);
int i,j;
while(scanf("%d",&n)!=EOF){
for(i=1;i<=n;i++)
{
LL o,p;
scanf("%lld%lld",&o,&p);
m[i]=o;a[i]=p;
}
print(work());
printf("\n");
}
return 0;
}