#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL_
void debug_out() {cerr << endl;}
template<typename Head,typename... Tail> void debug_out(Head H,Tail... T){cerr << ' ' << H; debug_out(T...);}
#define debug(...) cerr << 'L' << __LINE__ << " [" << #__VA_ARGS__ << "]:",debug_out(__VA_ARGS__)
#define dump(x) cerr << 'L' << __LINE__ << " " << #x << " = " << (x) << endl;
#else
#define debug(...) (void(0))
#define dump(x) (void(0))
#endif
#define rep(i,n) for (int i = 0; i < (int)(n); i ++)
#define irep(i,n) for (int i = (int)(n) - 1;i >= 0;--i)
using ll = long long;
using PL = pair<ll,ll>;
using P = pair<int,int>;
constexpr int INF = 1000000000;
constexpr long long HINF = 1000000000000000;
constexpr long long MOD = 1000000007;// = 998244353;
constexpr double EPS = 1e-4;
constexpr double PI = 3.14159265358979;

const int dy[4] = {-1,0,1,0};
const int dx[4] = {0,-1,0,1};

vector<ll> dijkstra(int n, vector<vector<PL>> &G,int s) {
    vector<ll> dist(n,HINF);
    dist[s] = 0;

    priority_queue<PL,vector<PL>,greater<P>> q;
    q.push({0,s});

    while (!q.empty()) {
        PL p = q.top(); q.pop();
        ll d = p.first;
        int v = p.second;
        if (dist[v] < d) continue;
        for (PL p: G[v]) {
            int e = p.first;
            ll cost = p.second;
            if (dist[e] > dist[v] + cost) {
                dist[e] = dist[v] + cost;
                q.push({dist[e],e});
            }
        }  
    }
    return dist;
}

int main() {
    int N,M; cin >> N >> M;
    vector<vector<PL>> G(2*N*N);
    vector<vector<ll>> penalty(N,vector<ll>(N,0));
    rep(i,M) {
        int h,w;
        ll c; 
        cin >> h >> w >> c;
        --h; --w;
        penalty[h][w] = c;
    }
    debug(N);
    rep(i,N) {
        rep(j,N) {
            rep(k,4) {
                if (i + dy[k] < 0 || i + dy[k] >= N || j + dx[k] < 0 || j + dx[k] >= N) continue;
                int y = i + dy[k];
                int x = j + dx[k];
                G[i*N + j].emplace_back(y*N+x,penalty[y][x]+1);
                G[i*N + j].emplace_back(N*N + y*N + x,1);
                G[N*N + i*N + j].emplace_back(N*N + y*N + x,penalty[y][x]+1);
            }
        }
    }
    debug(M);
    auto dist = dijkstra(2*N*N,G,0);
    cout << dist[2*N*N - 1] << '\n';
    return 0;
}