#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define fi first
#define se second
#define LL long long
using namespace std;
const int B = 317;
const int N = 3e4 + 7;
const int maxn = 1e5 + 7;
const LL mod = 1e9 + 7;
const LL mod1 = 1e9 + 9;
const int inf = 1e9 + 100;
int n,m;
pair < int , int > a[N];
int d[N];
vector < pair < int , int > > v[N];
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
//freopen( "input.txt" , "r" , stdin );
//freopen( "output.txt" , "w" , stdout );
cin >> n >> m;
set < int > g;
for( int i = 0; i < m; i++ ){
cin >> a[i].fi >> a[i].se;
g.insert(a[i].fi);
}
sort( a , a + m );
for( int i = 0; i <= n; i++ )d[i] = 1e9;
for( int i = 0; i < m; i++ ){
int f = a[i].fi;
int cnt = 1;
while( f + a[i].se < n ){
f += a[i].se;
v[a[i].fi].push_back({ f , cnt });
cnt++;
if( g.find(f) != g.end() )break;
}
f = a[i].fi;
cnt = 1;
while( f - a[i].se >= 0 ){
f -= a[i].se;
v[a[i].fi].push_back({ f , cnt });
cnt++;
if( g.find(f) != g.end() )break;
}
}
d[a[0].fi] = 0;
set < pair < int , int > > s;
s.insert({a[0].fi , 0});
while( !s.empty() ){
int x = s.begin()->fi;
s.erase(s.begin());
for( auto y : v[x] ){
if( d[x] + y.se < d[y.fi] ){
s.erase({y.fi , d[y.fi]});
d[y.fi] = d[x] + y.se;
s.insert({y.fi , d[y.fi]});
}
}
}
if( d[a[1].fi] == 1e9 )d[a[1].fi] = -1;
cout << d[a[1].fi];
//cerr << "\nTime elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
}
