#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>
#include <iomanip>
using namespace std;
typedef long long ll;
const double EPS = 1e-5;
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); }


typedef complex<double> P;
const double r = 1.0;


vector<P> GetCrossPoint(P a, P b)
{
	vector<P> res;
	
	// ツ堕スツ閉ェツつャツづィツつャツづィツ静堋触ツつオツづつ「ツづゥ
	if(abs(abs(b - a) - r * 2) < EPS)
	{
		P c = a + b;
		res.push_back( P(c.real() / 2,c.imag() / 2) );
	}
	// ツ閉津環づ可古ーツづュツづづつ「ツづゥ
	else if(abs(b - a) < r * 2)
	{
		P ab = b - a;
		P center = a + P(ab.real() / 2, ab.imag() / 2);
		
		P u1 = (ab * P(0, +1)) / abs(ab);
		P u2 = (ab * P(0, -1)) / abs(ab);
		
		double dist = sqrt(1 - pow(abs(ab) / 2, 2));
		P c1 = center + u1 * dist;
		P c2 = center + u2 * dist;
		
		res.push_back(c1);
		res.push_back(c2);
	}
	
	return res;
}


int main()
{
	int n;
	while(cin >> n && n)
	{
		vector<P> c(n);
		
		char del;
		double x, y;
		
		rep(i, n)
		{
			cin >> x >> del >> y;
			
			c[i] = P(x, y);
		}
		
		
		int res = 1;
		
		rep(i, n) REP(j, i + 1, n)
		{
			vector<P> crs(GetCrossPoint(c[i], c[j]));
			
			rep(k, crs.size())
			{
				int cover = 2;
				
				rep(l, n) if(l != i && l != j && abs(crs[k] - c[l]) - 1.0 < EPS)
				{
					cover++;
				}
				
				chmax(res, cover);
			}
		}
		
		cout << res << endl;
	}
}