Snuke's town has a subway system, consisting of N stations and M railway lines. The stations are numbered 1 through N. Each line is operated by a company. Each company has an identification number.

The i-th ( 1 \leq i \leq M ) line connects station p_i and q_i bidirectionally. There is no intermediate station. This line is operated by company c_i.

You can change trains at a station where multiple lines are available.

The fare system used in this subway system is a bit strange. When a passenger only uses lines that are operated by the same company, the fare is 1 yen (the currency of Japan). Whenever a passenger changes to a line that is operated by a different company from the current line, the passenger is charged an additional fare of 1 yen. In a case where a passenger who changed from some company A's line to another company's line changes to company A's line again, the additional fare is incurred again.

Snuke is now at station 1 and wants to travel to station N by subway. Find the minimum required fare.

Constraints

* 2 \leq N \leq 10^5
* 0 \leq M \leq 2×10^5
* 1 \leq p_i \leq N (1 \leq i \leq M)
* 1 \leq q_i \leq N (1 \leq i \leq M)
* 1 \leq c_i \leq 10^6 (1 \leq i \leq M)
* p_i \neq q_i (1 \leq i \leq M)

Input

The input is given from Standard Input in the following format:


N M
p_1 q_1 c_1
:
p_M q_M c_M


Output

Print the minimum required fare. If it is impossible to get to station N by subway, print `-1` instead.

Examples

Input

3 3
1 2 1
2 3 1
3 1 2


Output

1


Input

8 11
1 3 1
1 4 2
2 3 1
2 5 1
3 4 3
3 6 3
3 7 3
4 8 4
5 6 1
6 7 5
7 8 5


Output

2


Input

2 0


Output

-1
#include <bits/stdc++.h>
 
using namespace std;
 
const int N = 1e5 + 5, M = 2e6 + 5;
const long long inf = 1e16;
map< pair<int, int>, int> id;
int lastid;
vector< pair<int, int> > adj[N + M];
long long dist[N + M];

void addEdge(int u, int v, int c1, int c2) {
  adj[u].push_back({v, c1});
  adj[v].push_back({u, c2});
}

int getId(int u, int c) {
  if (id.count({u, c})) return id[{u, c}];
  addEdge(u, lastid, 1, 0);
  id[{u, c}] = lastid;
  return lastid++;
}

int main() {
  int n, m;
  scanf("%d %d", &n, &m);
  lastid = n+1;
  for (int i = 1; i <= m; i++) {
    int a, b, c;
    scanf("%d %d %d", &a, &b, &c);
    a = getId(a, c);
    b = getId(b, c);
    addEdge(a, b, 0, 0);
  }
  for (int i = 0; i < lastid; i++)
    dist[i] = inf;
  set < pair< long long, int > > st;
  st.insert({0, 1});
  dist[1] = 0;
  while (!st.empty()) {
    auto it = st.begin();
    int v = it->second;
    long long now = it->first;
    st.erase(it);
    if (v == n) {
      printf("%lld\n", now);
      return 0;
    }
    for (auto it : adj[v]) {
      long long cur = now + it.second;
      if (dist[it.first] > cur) {
        st.erase(make_pair(dist[it.first], it.first));
        dist[it.first] = cur;
        st.insert(make_pair(cur, it.first));
      }
    }
  }
  puts("-1");
  return 0;
}