#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <cassert>
#include <iostream>
#include <cctype>
#include <sstream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <set>
#include <stack>
#include <map>
#include <utility>
#include <numeric>
#include <algorithm>
#include <iterator>
#include <bitset>
#include <complex>
#include <fstream>
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
typedef vector<int> vint;
typedef pair<int, int> pint;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for(int i = x; i < n; i++)
template<class T> T RoundOff(T a){ return int(a+.5-(a<0)); }
template<class T, class C> void chmax(T& a, C b){ if(a < b) a = b; }
template<class T, class C> void chmin(T& a, C b){ if(b < a) a = b; }
template<class T, class C> pair<T, C> mp(T a, C b){ return make_pair(a, b); }

const int INF = 1 << 30;

struct E
{
	int u, v, cost;
};
bool comp(const E& l, const E& r)
{	return l.cost < r.cost;	}



vint par;
vint rank;

void init(int n)
{
	rep(i, n)
	{
		::par.push_back(i);
		::rank.push_back(0);
	}
}

int find(int x)
{
	if(par[x] == x) return x;
	else			return par[x] = find(par[x]);
}

void unite(int x, int y)
{
	x = find(x);
	y = find(y);

	if(x == y) return;


	if(::rank[x] < ::rank[y])	par[x] = y;
	else
	{
		par[y] = x;
		if(::rank[x] == ::rank[y]) ::rank[x]++;
	}
}

bool same(int x, int y)
{
	return find(x) == find(y);
}


int main()
{
	int n, m;
	while(cin >> n && n)
	{
		cin >> m;

		vector<E> es(m);

		char k;
		rep(i, m)
			cin >> es[i].u >> k >> es[i].v >> k >> es[i].cost;

		sort(ALL(es), comp);
		init(n);

		int res = 0;
		rep(i, m)
		{
			E e = es[i];
			if(!same(e.u, e.v))
			{
				unite(e.u, e.v);
				res += e.cost - 100;
			}
		}

		cout << res / 100 << endl;
	}
}