import heapq N, M = (int(x) for x in input().split()) d = [[] for i in range(N)] for i in range(M): u, v = (int(x) for x in input().split()) d[u-1].append(v) INF = 10**18 dist1, dist2, dist3 = [INF]*N, [INF]*N, [INF]*N L = [] heapq.heapify(L) heapq.heappush(L, [0, 1]) dist1[1-1] = 0 while L: c, u = heapq.heappop(L) if dist1[u-1] < c: continue for v in d[u-1]: if dist1[v-1] > c+1: dist1[v-1] = c+1 heapq.heappush(L, [c+1, v]) L = [] heapq.heapify(L) heapq.heappush(L, [0, N-1]) dist2[N-1-1] = 0 while L: c, u = heapq.heappop(L) if dist2[u-1] < c: continue for v in d[u-1]: if dist2[v-1] > c+1: dist2[v-1] = c+1 heapq.heappush(L, [c+1, v]) L = [] heapq.heapify(L) heapq.heappush(L, [0, N]) dist3[N-1] = 0 while L: c, u = heapq.heappop(L) if dist3[u-1] < c: continue for v in d[u-1]: if dist3[v-1] > c+1: dist3[v-1] = c+1 heapq.heappush(L, [c+1, v]) ans = min(dist1[N-2] + dist2[N-1] + dist3[0], dist1[N-1] + dist3[N-2] + dist2[0]) print(ans if ans < INF else -1)