#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <queue>
using namespace std;
const int N = 100010;
int n, m;
int h[N], e[N], ne[N], idx;
int d[N],q[N];
//插入边
void add(int a, int b)
{
e[idx] = b, ne[idx] = h[a], h[a] = idx ++ ;
}
int bfs()
{
int hh=0,tt=0; //队头,队尾
q[0]=1; //初始化第一个元素
memset(d, -1, sizeof d); //初始化距离
d[1] = 0;//初始化第一个点的距离
while (hh<=tt) //队列不空
{
int t = q[hh++]; //取队头
for (int i = h[t]; i != -1; i = ne[i]) //扩展当前的点
{
int j = e[i];
if (d[j] == -1)
{
d[j] = d[t] + 1;
q[++tt]=j;
}
}
}
return d[n];
}
int main()
{
scanf("%d%d", &n, &m);
memset(h, -1, sizeof h);
for (int i = 0; i < m; i ++ )
{
int a, b;
scanf("%d%d", &a, &b);
add(a, b);
}
cout << bfs() << endl;
return 0;
}