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;

typedef long long lli;
typedef vector<lli> vll;
typedef vector<bool> vbl;
typedef vector<vector<lli>> mat;
typedef unordered_map<lli,unordered_map<lli,lli>> graph;
typedef unordered_map<lli,unordered_map<lli,vll>> edge;

lli n,m;
edge g;
edge e;
priority_queue<vll,vector<vll>,greater<vll>> q;
set<vll> used;

int main(){
  cin >> n >> m;
  for(lli i = 0;i < m;i++){
    lli p,q,c;
    cin >> p >> q >> c;
    g[c][p].push_back(q);
    g[c][q].push_back(p);
    e[p][q].push_back(c);
    e[q][p].push_back(c);
  }
  q.push(vll({0,1,0}));//cost,station,company;
  while(!q.empty()){
    lli cost = q.top()[0];
    lli station = q.top()[1];
    lli company = q.top()[2];
    q.pop();
    if(station == n){
      cout << cost << endl;
      return 0;
    }
    if(used.count(vll({station,company})) != 0) continue;
    used.insert(vll({station,company}));
    if(company == 0){
      for(auto& itr : e[station]){
        for(lli& jtr : itr.second){
          q.push(vll({cost+1,itr.first,jtr}));
        }
      }
    }else{
      if(used.count(vll({station,0})) == 0) q.push(vll({cost,station,0}));
      for(lli& itr : g[company][station]){
        if(used.count(vll({itr,company})) == 0) q.push(vll({cost,itr,company}));
      }
    }
  }
  cout << -1 << endl;
  return 0;

}
