#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <climits>
#include <ctime>
#include <cassert>
using namespace std;

#define rep(i,a,n) for(int (i)=(a); (i)<(n); (i)++)
#define repq(i,a,n) for(int (i)=(a); (i)<=(n); (i)++)
#define repr(i,a,n) for(int (i)=(a); (i)>=(n); (i)--)
#define all(v) begin(v), end(v)
#define pb(a) push_back(a)
#define fr first
#define sc second
#define INF 2000000000
#define int long long int

#define X real()
#define Y imag()
#define EPS (1e-12)
#define EQ(a,b) (abs((a) - (b)) < EPS)
#define EQV(a,b) ( EQ((a).X, (b).X) && EQ((a).Y, (b).Y) )
#define LE(n, m) ((n) < (m) + EPS)
#define LEQ(n, m) ((n) <= (m) + EPS)
#define GE(n, m) ((n) + EPS > (m))
#define GEQ(n, m) ((n) + EPS >= (m))

typedef vector<int> VI;
typedef vector<VI> MAT;
typedef pair<int, int> pii;
typedef long long ll;

typedef complex<double> P;
typedef pair<P, P> L;
typedef pair<P, double> C;

int dy[]={0, 0, 1, -1};
int dx[]={1, -1, 0, 0};
int const MOD = 1000000007;

namespace std {
    bool operator<(const P& a, const P& b) {
        return a.X != b.X ? a.X < b.X : a.Y < b.Y;
    }
}

double calc(P x, P y) {
    double dx = (x.X - y.X) * (x.X - y.X);
    double dy = (x.Y - y.Y) * (x.Y - y.Y);
    return dx + dy;
}

signed main() {
    int n;
    while(cin >> n, n) {
        vector<P> v(n);
        double x, y;
        int ma = 0;
        rep(i,0,n) {
            scanf("%lf,%lf", &x, &y);
            v[i] = P(x, y);
        }
        for(double i = 0.0; i <= 10.01; i += 0.01) {
            for(double j = 0.0; j <= 10.01; j += 0.01) {
                int cnt = 0;
                rep(k,0,n) if(calc(P(i, j), v[k]) <= 1.0 + EPS) cnt++;
                ma = max(ma, cnt);
            }
        }
        cout << ma << endl;
    }
    return 0;
}