using System.Collections.Generic;
using System.Linq;
using System;

public class PriorityQueue<T> where T : IComparable
{
    private IComparer<T> _comparer = null;
    private int _type = 0;
    private T[] _heap;
    private int _sz = 0;
    private int _count = 0;
    /// <summary>
    /// Priority Queue with custom comparer
    /// </summary>
    public PriorityQueue(int maxSize, IComparer<T> comparer)
    {
        _heap = new T[maxSize];
        _comparer = comparer;
    }

    /// <summary>
    /// Priority queue
    /// </summary>
    /// <param name="maxSize">max size</param>
    /// <param name="type">0: asc, 1:desc</param>
    public PriorityQueue(int maxSize, int type = 0)
    {
        _heap = new T[maxSize];
        _type = type;
    }

    private int Compare(T x, T y)
    {
        if (_comparer != null) return _comparer.Compare(x, y);
        return _type == 0 ? x.CompareTo(y) : y.CompareTo(x);
    }
    public void Push(T x)
    {
        _count++;
        //node number
        var i = _sz++;
        while (i > 0)
        {
            //parent node number
            var p = (i - 1) / 2;

            if (Compare(_heap[p], x) <= 0) break;

            _heap[i] = _heap[p];
            i = p;
        }
        _heap[i] = x;
    }
    public T Pop()
    {
        _count--;
        T ret = _heap[0];
        T x = _heap[--_sz];

        int i = 0;
        while (i * 2 + 1 < _sz)
        {
            //children
            int a = i * 2 + 1;
            int b = i * 2 + 2;

            if (b < _sz && Compare(_heap[b], _heap[a]) < 0) a = b;

            if (Compare(_heap[a], x) >= 0) break;

            _heap[i] = _heap[a];
            i = a;
        }
        _heap[i] = x;
        return ret;
    }
    public int Count()
    {
        return _count;
    }
    public T Peek()
    {
        return _heap[0];
    }
    public bool Contains(T x)
    {
        for (int i = 0; i < _sz; i++) if (x.Equals(_heap[i])) return true;
        return false;
    }
    public void Clear()
    {
        while (this.Count() > 0) this.Pop();
    }
    public IEnumerator<T> GetEnumerator()
    {
        var ret = new List<T>();
        while (this.Count() > 0)
        {
            ret.Add(this.Pop());
        }
        foreach (var r in ret)
        {
            this.Push(r);
            yield return r;
        }
    }
    public T[] ToArray()
    {
        T[] array = new T[_sz];
        int i = 0;
        foreach (var r in this)
        {
            array[i++] = r;
        }
        return array;
    }
}

public class Edge : IComparable
{
    public int to { get; set; }
    public int d { get; set; }
    public int CompareTo(object obj)
    {
        var x = (Edge)obj;
        return this.d - x.d;
    }
}

public class C
{
    public const int INF = 999999999;
}

public class Hello
{
    public static void Main()
    {
        while (true)
        {
            var n = int.Parse(Console.ReadLine().Trim());
            if (n == 0) break;
            var m = int.Parse(Console.ReadLine().Trim());
            var r = new List<Edge>[n];
            var minc = new int[n];
            for (int i = 0; i < n; i++)
            {
                r[i] = new List<Edge>();
                minc[i] = C.INF;
            }
            for (int i = 0; i < m; i++)
            {
                string[] line2 = Console.ReadLine().Trim().Split(',');
                var a = int.Parse(line2[0]);
                var b = int.Parse(line2[1]);
                var d = int.Parse(line2[2]) / 100;
                r[a].Add(new Edge { to = b, d = d });
                r[b].Add(new Edge { to = a, d = d });
            }
            goPrim(r, minc, 0, m);
            Console.WriteLine(minc.Sum() - n + 1);
        }
    }
    public static void goPrim(List<Edge>[] r, int[] minc, int targ, int m)
    {
        var pq = new PriorityQueue<Edge>(m * 2 + 1000);
        var n = minc.Length;
        var xL = new List<int>();
        xL.Add(targ); minc[targ] = 0;
        foreach (var x in r[targ]) pq.Push(x);
        while (xL.Count() < n)
        {
            var e = pq.Pop();
            if (!xL.Contains(e.to))
            {
                xL.Add(e.to);
                minc[e.to] = e.d;
                foreach (var x in r[e.to])
                    if (!xL.Contains(x.to)) pq.Push(x);
            }
        }
    }
}

Measured memory_bytes: 10772