#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;

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

		vint mincost(n, INF);
		vector<bool> used(n, false);
		vector<vint> cost(n, vint(n, INF));
		rep(i, m)
		{
			int from, to, c;
			char k;
			cin >> from >> k >> to >> k >> c;

			cost[from][to] = cost[to][from] = c;
		}

		mincost[0] = 0;
		int res = 0;

		while(true)
		{
			int v = -1;
			rep(u, n)
				if(!used[u] && (v == -1 || mincost[u] < mincost[v]))
					v = u;

			if(v == -1) break;
			used[v] = true;
			res += mincost[v] - 100;

			rep(u, n)
				chmin(mincost[u], cost[v][u]);
		}

		cout << (res + 100) / 100 << endl;
	}
}