#define _CRT_SECURE_NO_WARNINGS 1
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cstdlib>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <iomanip>
#include <queue>
#include <sstream>
#include <climits>
#include <cmath>
#include <list>
#include <functional>
#include <map>
#include <stack>
using namespace std;
#define M_PI 3.141592
#define FOR(i,n) for(int i=0;i<(int)n;i++)
#define FORI(i,k,n) for(int i=k;i<(int)n;i++)
#define toRad 2.0*M_PI/360.0
#define inin(x) int x;cin>>x;
#define all(x) x.begin(),x.end()
#define debug(x) cout<<#x<<" :"<<x<<endl;
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define EPS 1e-12
#define pri_max 60000
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef vector<int> vi;
int dx[4] = { 0,1,0,-1 };
int dy[4] = { 1,0,-1,0 };

/*
bool memo[pri_max] = {};
vector<int> pri;
void calc()
{
	for (int i = 2; i < pri_max; i++)
	{
		if (memo[i] == false)
		{
			pri.push_back(i);
			for (int l = i; l < pri_max; l += i)
			{
				memo[l] = true;
			}
		}
	}
}*/
double len(pdd a, pdd b)
{
	return sqrt((b.first - a.first)*(b.first - a.first) + (b.second - a.second)*(b.second - a.second));
}

int main()
{
	int n;
	while (cin >> n&&n)
	{
		vector<pdd> v;
		int ans = 1;
		for (int i = 0; i < n; i++)
		{
			pdd p;
			scanf("%lf,%lf", &p.first, &p.second);
			v.push_back(p);
		}
		for (int i = 0; i < n; i++)
		{
			for (int l = 0; l < n; l++)
			{
				if (i == l)continue;
				if (!(len(v[i], v[l])>2.0))
				{
					pdd p;
					p.first = v[i].first + cos(atan2(v[l].second - v[i].second, v[l].first - v[i].first));
					p.second = v[i].second + sin(atan2(v[l].second - v[i].second, v[l].first - v[i].first));
					int temp = 0;
					for (int k = 0; k < n; k++)
					{
						if (!(len(v[k], p)>1.0))temp++;
					}
					ans = max(temp, ans);
				}
			}
		}
		cout << ans << endl;
	}
}