//Sylwia Sapkowska
#include <bits/stdc++.h>
#pragma GCC optimize("O3", "unroll-loops")
using namespace std;
void __print(int x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << "'" << x << "'";}
void __print(const char *x) {cerr << '"' << x << '"';}
void __print(const string &x) {cerr << '"' << x << '"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ", "; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? ", " : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifdef LOCAL
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif
// #define int long long
typedef pair<int, int> T;
const int oo = 1e9+7, K = 30;
const int mod = 998244353;
const int S = 300;
void solve(){
int n, m; cin >> n >> m;
vector<vector<T>>g(n*S+2);
auto ch = [&](int v, int j = 0){
return v*S+j;
};
int ile = 0;
auto add_edge = [&](int a, int b, int c, bool two = 0){
if (two) {
g[a].emplace_back(b, c);
// cerr << a << " " << b << "\n";
}
g[b].emplace_back(a, c);
// cerr << b << " " << a << "\n";
ile++;
};
set<T>was;
int start, kon;
for (int i = 0; i<m; i++){
int v, j; cin >> v >> j;
if (i == 0) start = ch(v);
if (i == 1) kon = ch(v);
if (j < S){
if (was.find({v%j, j}) == was.end()){
debug(v, j);
was.insert({v%j, j});
int u = v;
add_edge(ch(u), ch(u, j), 0);
while (u >= j){
add_edge(ch(u-j), ch(u-j, j), 0);
add_edge(ch(u, j), ch(u-j, j), 1, 1);
u-=j;
}
u = v;
while (u + j < n){
add_edge(ch(u+j), ch(u+j, j), 0);
add_edge(ch(u, j), ch(u+j, j), 1, 1);
u += j;
}
}
add_edge(ch(v, j), ch(v), 0);
} else {
for (int u = v-j, k = 1; u >= 0; u-=j, k++){
add_edge(ch(u), ch(v), k);
}
for (int u = v+j, k = 1; u<n; u+=j, k++){
add_edge(ch(u), ch(v), k);
}
}
}
vector<int>dist(n*S+2, oo);
set<T>s;
s.insert({0, start});
dist[start] = 0;
while ((int)s.size()){
auto [d, v] = *s.begin();
s.erase(s.begin());
if (dist[v] < d) continue;
for (auto [x, c]: g[v]){
if (dist[x] > dist[v]+c){
dist[x] = dist[v] + c;
s.insert({dist[x], x});
}
}
}
int ans = dist[kon];
if (ans == oo) ans = -1;
cout << ans << "\n";
}
int32_t main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t = 1;
//cin >> t;
while (t--) solve();
return 0;
}
