BerDonalds, a well-known fast food restaurant, is going to open a cafe in Bertown. The important thing is to choose the new restaurant's location so that it would be easy to get there. The Bertown road system is represented by n junctions, connected by m bidirectional roads. For each road we know its length. We also know that we can get from any junction to any other one, moving along the roads.

Your task is to find such location of the restaurant, that the shortest distance along the roads from the cafe to the farthest junction would be minimum. Note that the restaurant can be located not only on the junction, but at any point of any road.

Input

The first line contains two integers n and m (<image>) — the number of junctions and the number of roads, correspondingly. Then m lines follow, describing all Bertown roads. Each road is described by three integers ai, bi, wi (1 ≤ ai, bi ≤ n, ai ≠ bi; 1 ≤ wi ≤ 105), where ai and bi are the numbers of the junctions, connected by the i-th road, and wi is the length of the i-th road. 

It is guaranteed that each road connects two distinct junctions, there is at most one road between any two junctions, and you can get from any junction to any other one.

Output

Print a single real number — the shortest distance from the optimal restaurant location to the farthest junction. The answer will be considered correct, if its absolute or relative error doesn't exceed 10 - 9.

Examples

Input

2 1
1 2 1


Output

0.50


Input

3 3
1 2 1
2 3 1
1 3 1


Output

1.00


Input

3 2
1 2 100
2 3 1


Output

50.50
//package codeforces;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.*;

public class D {
    BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
    PrintWriter writer = new PrintWriter(System.out);
    StringTokenizer stringTokenizer;

    String next() throws IOException {
        while (stringTokenizer == null || !stringTokenizer.hasMoreTokens()) {
            stringTokenizer = new StringTokenizer(reader.readLine());
        }
        return stringTokenizer.nextToken();
    }

    int nextInt() throws IOException {
        return Integer.parseInt(next());
    }

    long nextLong() throws IOException {
        return Long.parseLong(next());
    }

    @SuppressWarnings("unchecked")
    void solve() throws IOException {
        int n = nextInt();
        int m = nextInt();
        final int INF = 1000 * 1000 * 1000;
        int[][] w = new int[n + 1][n + 1];
        for (int[] x : w) {
            Arrays.fill(x, INF);
        }
        for(int i = 1; i <= n; i++) {
            w[i][i] = 0;
        }
        for(int i = 0; i < m; i++) {
            int u = nextInt();
            int v = nextInt();
            int l = nextInt();
            w[u][v] = w[v][u] = 2 * l;
        }
        class Utils {
            void dijkstra(int[][] g, int from, int[] d, int[] notUsed) {
                int n = g.length - 1;
                Arrays.fill(d, INF);
                d[from] = 0;
                for(int i = 0; i < n; i++) {
                    notUsed[i] = i + 1;
                }
                for(int k = 0; k < n; k++) {
                    int i = n;
                    for(int j = 0; j < n - k; j++) {
                        if(d[notUsed[i]] > d[notUsed[j]]) {
                            i = j;
                        }
                    }
                    if(i == n) {
                        break;
                    }
                    int u = notUsed[i];
                    notUsed[i] = notUsed[n - k - 1];
                    for(int j = 0; j < n - k - 1; j++) {
                        int v = notUsed[j];
                        d[v] = Math.min(d[v], d[u] + g[u][v]);
                    }
                }
            }
        }
        int[] used = new int[n + 1];
        Utils utils = new Utils();
        int ans = INF;
        class Spike {
            int yi, yj;

            Spike(int yi, int yj) {
                this.yi = yi;
                this.yj = yj;
            }
        }
        int[][] d = new int[n + 1][n + 1];
        for(int i = 1; i <= n; i++) {
            utils.dijkstra(w, i, d[i], used);
        }
        Spike[] spikes = new Spike[n];
        for(int i = 1; i <= n; i++) {
            for(int j = i + 1; j <= n; j++) {
                if(w[i][j] == INF) {
                    continue;
                }
                for(int k = 1; k <= n; k++) {
                    spikes[k - 1] = new Spike(d[i][k], d[j][k]);
                }
                Arrays.sort(spikes, new Comparator<Spike>() {
                    @Override
                    public int compare(Spike o1, Spike o2) {
                        return Integer.compare(o2.yi, o1.yi);
                    }
                });
                int x = 0;
                int k = 0;
                while(k < n) {
                    int yi = spikes[k].yi;
                    int yj = spikes[k].yj;
                    int y = Math.min(x + yi, w[i][j] + yj - x);
                    ans = Math.min(ans, y);
                    int next = k + 1;
                    while(next < n && spikes[next].yi <= yi && spikes[next].yj <= yj) {
                        next++;
                    }
                    if(next == n) {
                        ans = Math.min(ans, yj);
                        break;
                    }
                    x = (w[i][j] + yj - spikes[next].yi) / 2;
                    k = next;
                }
            }
        }
        writer.println(String.format("%.1f", 0.5 * ans));
        writer.close();
    }

    public static void main(String[] args) throws IOException {
        new D().solve();
    }
}
