#include <iostream>
#include <iomanip>
#include <vector>
#include <set>
#include <map>
#include <list>
#include <iterator>
#include <queue>
#include <stack>
#include <deque>
#include <sstream>
#include <algorithm>
#include <numeric>
#include <string>
#include <cmath>
#include <complex>
#include <functional>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cassert>
#include <cstdlib>
#include <cctype>

#define REP(i,m,n) for(int i=m;i<(int)n;i++)
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define rrep(i,n) for(int i = 1; i <= n; i++)
#define drep(i,n) for(int i = n; i >= 0; i--)
#define rp(i,c) rep(i,(int)c.size())
#define fr(i,c) for(__typeof((c).begin()) i=(c).begin();i!=(c).end();i++)
#define mp make_pair
#define pb push_back
#define all(c) (c).begin(),(c).end()
#define rall(u) (u).rbegin(),(u).rend()
#define dbg(x) cerr<<#x<<" = "<<(x)<<endl
#define v_delete(a,b) (a).erase(remove((a).begin(), (a).end(), b), (a).end())
#define v_unique(a) (a).erase(unique((a).begin(), (a).end()), (a).end())
#define VV(T) vector<vector< T > >
using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pii;
const int inf=1<<28;
const double INF=1e10,EPS=1e-9;


template<class T>int SIZE(T a){return a.size();}
template<class T>string IntToString(T num){string res;stringstream ss;ss<<num;return ss.str();}
template<class T>T StringToInt(string str){T res=0;for(int i=0;i<SIZE(str);i++)res=(res*10+str[i]-'0');return res;}
template<class T>T gcd(T a,T b){if(b==0)return a;return gcd(b,a%b);}
template<class T>T lcm(T a,T b){return a/gcd(a,b)*b;}

template <class T> void input(T& a, int n) { for (int i = 0; i < n; ++i) cin >> a[i]; }
template <class T> void input(T* a, int n) { for (int i = 0; i < n; ++i) cin >> a[i]; }

int chmax(int& a,int b){
	if(b > a){
		a=b;
	}
	return a;
}
int chmin(int& a,int b){
	if(b < a){
		a=b;
	}
	return a;
}
struct uf{
private:
	vector<int> par;
	vector<int> rank;

public:
	uf(int n){
		for (int i=0;i<n;i++){
			par.pb(i);
		}
		rank.resize(n,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);
	}
};

struct edge{
	int u,v,cost;
	edge(int ui,int vi,int costi):u(ui),v(vi),cost(costi){}
};
bool comp(const edge& l,const edge& r){
	return l.cost < r.cost;
}
int N,M;
vector<edge> es;
int main () {
	while(cin >> N,N){
		cin >> M;
		es.clear();
		rep(i,M){
			int a,b,c;
			char t;
			cin >> a >> t >> b >>t >> c;
			es.pb(edge(a,b,c/100-1));
			es.pb(edge(b,a,c/100-1));
		}
		sort(all(es),comp);
		uf U(101);
		int ans=0;
		rep(i,es.size()){
			edge &e = es [i];
			if(!U.same(e.u,e.v)){
				U.unite(e.u,e.v);
				ans += e.cost;
			}
		}
		cout << ans << endl;

	}
	return 0;
}