#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <queue>
#include <stack>
#include <vector>
#include <algorithm>
#include <string>
#include <cstring>
#include <cmath>
#include <complex>
#include <map>
#include <climits>
#include <sstream>
using namespace std;
 
#define reep(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) reep((i),0,(n))
#define ALL(v) (v).begin(),(v).end()
#define PB push_back
#define EPS 1e-8
#define F first
#define S second
#define mkp make_pair
 
static const double PI=6*asin(0.5);
typedef long long ll;
typedef complex<double> CP;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> vint;
static const int INF=1<<24;
 
template <class T>
void initvv(vector<vector<T> > &v,int a,int b, const T  &t = T()){
    v.assign(a,vector<T>(b,t));
}
 
//v.erase(unique(v.begin(),v.end()),v.end());

int main(){
	int n;
	while(cin>>n,n){
		vector<pair<double,double> > v(n);
		char t;
		rep(i,n){
			cin>>v[i].F>>t>>v[i].S;
		}
		int ans=0;
		rep(i,n){
			rep(j,10000){
				double x = v[i].F+sin(2*PI*j/10000),y = v[i].S+cos(2*PI*j/10000);
				int c=0;
				rep(k,n){
					if((v[k].F-x)*(v[k].F-x)+(v[k].S-y)*(v[k].S-y)<=1.0){
						c++;
					} 
				}
				ans=max(ans,c);
			}
		}
		cout<<ans<<endl;
	}
}