
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <memory>
#include <string>

#include <algorithm>
#include <complex>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#include <bitset>

using namespace std;

#ifdef _MSC_VER
#define __typeof__ decltype
#define strtok_r strtok_s
#endif

#define ITER(c)             __typeof__((c).begin())
#define FOREACH(it, c)      for (ITER(c) it=(c).begin(); it != (c).end(); ++it)
#define RITER(c)            __typeof__((c).rbegin())
#define RFOREACH(it, c)     for (RITER(c) it=(c).rbegin(); it != (c).rend(); ++it)
#define REP(i, n)           REPEAT(i, 0, n)
#define RREP(i, n)          RREPEAT(i, 0, n);
#define REPEAT(i, k, n)     for(int i = (k); i < (k+n); ++i)
#define RREPEAT(i, k, n)    for(int i = (k)+(n)-1; i >= (k); ++i)
#define ALL(c)              (c).begin(), (c).end()
#define LLPOW(p1,p2)        ((ll)pow((double)(p1), (int)p2))
#define ESIZEOF(A)          (sizeof(A)/sizeof((A)[0]))
#define CIN_NO_SYNC         do { cin.tie(0); ios_base::sync_with_stdio(false); } while(0)
#define GETSTR(p)           fgets((p), sizeof(p), stdin)
#define CHOMP(p)            do{ char *_q = (p) + strlen(p)-1; if(*_q == '\n' || *_q == '\r') *_q = 0; } while(0)
#define mp                  make_pair
#define pb                  push_back
template<class _T> _T MAX(_T p1,_T p2){return (p1>p2)?p1:p2;} 
template<class _T> _T MIN(_T p1,_T p2){return (p1<p2)?p1:p2;} 

typedef long long ll;
typedef unsigned long long ull;

#define X real()
#define Y imag()
typedef double D;
typedef complex<D> P;
#define EPS (1e-9)

#ifdef _DEBUG
#define pf printf
#define pr(n) do { cout << #n " = " << (n) << endl; } while(0)
#define prfe(n) do { cout << #n " ="; FOREACH(_it,n) cout << " " << *_it; cout << endl; } while(0)
#else
#define pf(...) /* */
#define pr(...) /* */
#define prfe(...) /* */
#endif

bool circle_cross(P p1, P p2, D r, P &cp1, P &cp2){
    D rd, rd2;
    P pd = p2-p1;
    rd = abs(pd);
    if(rd == 0 || rd > r*2) return false;
    rd2 = rd/2;
    P pl(rd2, sqrt(r*r-rd2*rd2));
    cp1 = p1 + pl * polar(1.0, arg(pd));
    cp2 = p1 + conj(pl) * polar(1.0, arg(pd));
    return true;
}

void solve(vector<P> &v){
    int n = v.size();
    vector<P> vc;

    REP(i,n) vc.pb(v[i]);

    REP(i,n-1){
        for(int j = i+1; j < n; j++){
            pf("P%d(%f,%f), P%d(%f,%f)\n", i+1, v[i].X, v[i].Y, j+1, v[j].X, v[j].Y);
            P cp1, cp2;
            if(circle_cross(v[i], v[j], 1, cp1, cp2)){
                vc.pb(cp1);
                vc.pb(cp2);
            }
        }
    }
    int max = 1;
    FOREACH(it, vc){
        int count = 0;
        P &pc = *it;
        pr(pc);
        REP(i,n){
            if(norm(v[i]-pc) <= 1.0*1.0 + EPS) count++;
        }
        max = MAX(max, count);
    }

    cout << max << endl;
    return;
}

int main(){
    int n;
    double x,y;
    char c;
    while(cin >> n, n){
        vector<P> v;
        REP(i, n){
            cin >> x >> c >> y;
            v.pb(P(x,y));
        }
        solve(v);
    }
    return 0;
}