#include<bits/stdc++.h>
#define oo 100000000
#define maxn 30004
using namespace std;
typedef long long ll;
int n, m;
int b[maxn], p[maxn];
vector < pair < int, int > > g[maxn];
set < int > s[maxn];
int d[maxn];
int main(){
#define TASK "ABC"
// freopen(TASK".inp", "r", stdin); freopen(TASK".out", "w", stdout);
ios_base::sync_with_stdio(0);
cin >> n >> m;
for (int i = 0; i < m; ++i) {
cin >> b[i] >> p[i];
s[b[i]].insert(p[i]);
}
for (int i = 0; i < m; ++i)
for (int j = b[i] + p[i]; j < n; j += p[i]) {
g[b[i]].push_back({j, (j - b[i]) / p[i]});
if (s[j].count(p[i]))
break;
}
for (int i = 0; i < m; ++i)
for (int j = b[i] - p[i]; j >= 0; j -= p[i]) {
g[b[i]].push_back({j, (b[i] - j) / p[i]});
if (s[j].count(p[i]))
break;
}
priority_queue < pair < int, int > > p;
fill(d, d + n + 1, oo);
d[b[0]] = 0;
p.push({0, b[0]});
while (!p.empty()) {
int dist = p.top().first, u = p.top().second; p.pop();
if (d[u] != -dist) continue;
for (auto i : g[u]) {
int v = i.first, w = i.second;
if (d[v] > d[u] + w) {
d[v] = d[u] + w;
p.push({-d[v], v});
}
}
}
cout << (d[b[1]] == oo ? -1 : d[b[1]]);
return 0;
}
