#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef pair<ll, ll> p_ll;

template<class T>
void debug(T itr1, T itr2) { auto now = itr1; while(now<itr2) { cout << *now << " "; now++; } cout << endl; }
#define repr(i,from,to) for (ll i=(ll)from; i<(ll)to; i++)
#define all(vec) vec.begin(), vec.end()
#define rep(i,N) repr(i,0,N)
#define per(i,N) for (int i=(int)N-1; i>=0; i--)

const ll MOD = pow(10,9)+7;
const ll LLINF = pow(2,61)-1;
const int INF = pow(2,30)-1;

vector<ll> fac;
void c_fac(int x=pow(10,6)+10) { fac.resize(x,true); rep(i,x) fac[i] = i ? (fac[i-1]*i)%MOD : 1; }
ll modpow(ll x, ll p) { ll result = 1, now = 1, pm = x; while (now<=p) { if (p&now) { result = result * pm % MOD; } now*=2; pm = pm*pm % MOD; } return result; }
ll inv(ll a, ll m=MOD) { ll b = m, x = 1, y = 0; while (b!=0) { int d = a/b; a -= b*d; swap(a,b); x -= y*d; swap(x,y); } return (x+m)%m; }
ll nck(ll n, ll k) { return fac[n]*inv(fac[k]*fac[n-k]%MOD)%MOD; }
ll gcd(ll a, ll b) { if (a<b) swap(a,b); return b==0 ? a : gcd(b, a%b); }
ll lcm(ll a, ll b) { return a/gcd(a,b)*b; }

// ----------------------------------------------------------------------
// ----------------------------------------------------------------------

struct dijkstra {

  ll N;
  struct edge { ll to, d; };
  vector<vector<edge>> adj;
  vector<ll> minlen;

  dijkstra(ll n) { N = n; adj.resize(N); minlen.assign(N,LLINF); }
  ll operator[](const ll &x) const { return minlen[x]; }

  void add_edge(ll from, ll to, ll d){
    adj[from].push_back({to,d});
  }
  vector<ll> calc(ll n=0) {
    auto c = [](const p_ll &x, const p_ll &y){return x.second>y.second;};
    priority_queue<p_ll, vector<p_ll>, decltype(c)> q(c);
    minlen[n] = 0; q.push(make_pair(n,0));
    while(q.size()) {
      p_ll now = q.top(); q.pop();
      ll np = now.first, nd = now.second;
      if (nd>minlen[np]) continue;
      for (auto x: adj[np]) {
        if (minlen[x.to]<=minlen[np]+x.d) continue;
        q.push(make_pair(x.to, minlen[np]+x.d));
        minlen[x.to] = minlen[np]+x.d;
      }
    }
    return minlen;
  }

};

// ----------------------------------------------------------------------
// ----------------------------------------------------------------------

int main() {
  ll N, M; cin >> N >> M;
  ll fee[N][N] = {};
  rep(i,M) {
    ll h, w, c; cin >> h >> w >> c; h--; w--;
    fee[h][w] = c;
  }

  dijkstra d(N*N*2);
  rep(i,N) rep(j,N) {
    if (i!=0) {
      d.add_edge(i*N+j    , (i-1)*N+j    ,fee[i-1][j]+1);
      d.add_edge(i*N+j+N*N, (i-1)*N+j+N*N,fee[i-1][j]+1);
      d.add_edge(i*N+j    , (i-1)*N+j+N*N,            1);
    }
    if (i!=N-1) {
      d.add_edge(i*N+j    , (i+1)*N+j    ,fee[i+1][j]+1);
      d.add_edge(i*N+j+N*N, (i+1)*N+j+N*N,fee[i+1][j]+1);
      d.add_edge(i*N+j    , (i+1)*N+j+N*N,            1);
    }
    if (j!=0) {
      d.add_edge(i*N+j    , i*N+(j-1)    ,fee[i][j-1]+1);
      d.add_edge(i*N+j+N*N, i*N+(j-1)+N*N,fee[i][j-1]+1);
      d.add_edge(i*N+j    , i*N+(j-1)+N*N,            1);
    }
    if (j!=N-1) {
      d.add_edge(i*N+j    , i*N+(j+1)    ,fee[i][j+1]+1);
      d.add_edge(i*N+j+N*N, i*N+(j+1)+N*N,fee[i][j+1]+1);
      d.add_edge(i*N+j    , i*N+(j+1)+N*N,            1);
    }
  }

  vector<ll> dres = d.calc();
  ll result = dres[2*N*N-1];
  cout << result << endl;
  return 0;
}