#include <bits/stdc++.h>
#pragma warning(disable : 4996)
using namespace std;
using ld = long double;
template <class T>
using Table = vector<vector<T>>;
const ld eps = 1e-9;
const ld pi = acos(-1.0);
const ld dtop = pi / 180.;
const ld ptod = 1. / dtop;
namespace std {
bool operator<(const complex<ld>& lhs, const complex<ld>& rhs) {
  if (lhs.real() < rhs.real() - eps) return true;
  if (lhs.real() > rhs.real() + eps) return false;
  return lhs.imag() < rhs.imag();
}
}  // namespace std
complex<ld> input_Point() {
  ld x, y;
  cin >> x >> y;
  return complex<ld>(x, y);
}
bool eq(const ld a, const ld b) { return (abs(a - b) < eps); }
ld dot(const complex<ld>& a, const complex<ld>& b) { return real(conj(a) * b); }
ld cross(const complex<ld>& a, const complex<ld>& b) {
  return imag(conj(a) * b);
}
class Line {
 public:
  complex<ld> a, b;
  Line() : a(complex<ld>(0, 0)), b(complex<ld>(0, 0)) {}
  Line(complex<ld> a, complex<ld> b) : a(a), b(b) {}
  complex<ld> operator[](const int _num) const {
    if (_num == 0)
      return a;
    else if (_num == 1)
      return b;
    else {
      assert(false);
      return complex<ld>();
    }
  }
};
class Circle {
 public:
  complex<ld> p;
  ld r;
  Circle() : p(complex<ld>(0, 0)), r(0) {}
  Circle(complex<ld> p, ld r) : p(p), r(r) {}
};
int ccw(const complex<ld>& a, const complex<ld>& b, const complex<ld>& c) {
  const complex<ld> nb(b - a);
  const complex<ld> nc(c - a);
  if (cross(nb, nc) > eps) return 1;
  if (cross(nb, nc) < -eps) return -1;
  if (dot(nb, nc) < 0) return 2;
  if (norm(nb) < norm(nc)) return -2;
  return 0;
}
bool isis_ll(const Line& l, const Line& m) {
  return !eq(cross(l.b - l.a, m.b - m.a), 0);
}
bool isis_ls(const Line& l, const Line& s) {
  return isis_ll(l, s) &&
         (cross(l.b - l.a, s.a - l.a) * cross(l.b - l.a, s.b - l.a) < eps);
}
bool isis_ss(const Line& s, const Line& t) {
  return ccw(s.a, s.b, t.a) * ccw(s.a, s.b, t.b) <= 0 &&
         ccw(t.a, t.b, s.a) * ccw(t.a, t.b, s.b) <= 0;
}
bool isis_lp(const Line& l, const complex<ld>& p) {
  return (abs(cross(l.b - p, l.a - p)) < eps);
}
bool isis_sp(const Line& s, const complex<ld>& p) {
  return (abs(s.a - p) + abs(s.b - p) - abs(s.b - s.a) < eps);
}
complex<ld> proj(const Line& l, const complex<ld>& p) {
  ld t = dot(p - l.a, l.b - l.a) / norm(l.a - l.b);
  return l.a + t * (l.b - l.a);
}
complex<ld> reflect(const Line& l, const complex<ld>& p) {
  complex<ld> pr = proj(l, p);
  return pr * 2.l - p;
}
complex<ld> is_ll(const Line& s, const Line& t) {
  complex<ld> sv = s.b - s.a, tv = t.b - t.a;
  assert(cross(sv, tv) != 0);
  return s.a + sv * cross(tv, t.a - s.a) / cross(tv, sv);
}
vector<complex<ld>> is_ll2(const Line& s, const Line& t) {
  complex<ld> sv = s.b - s.a, tv = t.b - t.a;
  if (cross(sv, tv) != 0)
    return vector<complex<ld>>(1, is_ll(s, t));
  else {
    vector<complex<ld>> ans;
    for (int k = 0; k < 2; ++k) {
      if (isis_sp(s, t[k]) && find(ans.begin(), ans.end(), t[k]) == ans.end())
        ans.push_back(t[k]);
      if (isis_sp(t, s[k]) && find(ans.begin(), ans.end(), s[k]) == ans.end())
        ans.push_back(s[k]);
    }
    return ans;
  }
}
complex<ld> is_ss(const Line& s, const Line& t) {
  if (isis_ss(s, t)) {
    for (int k = 0; k < 2; ++k) {
      for (int l = 0; l < 2; ++l) {
        if (s[k] == t[l]) return s[k];
      }
    }
    return is_ll(s, t);
  } else {
    assert(false);
    return complex<ld>(0, 0);
  }
}
vector<complex<ld>> is_ss2(const Line& s, const Line& t) {
  vector<complex<ld>> kouho(is_ll2(s, t));
  vector<complex<ld>> ans;
  for (auto p : kouho) {
    if (isis_sp(s, p) && isis_sp(t, p)) ans.emplace_back(p);
  }
  return ans;
}
ld dist_lp(const Line& l, const complex<ld>& p) { return abs(p - proj(l, p)); }
ld dist_ll(const Line& l, const Line& m) {
  return isis_ll(l, m) ? 0 : dist_lp(l, m.a);
}
ld dist_ls(const Line& l, const Line& s) {
  return isis_ls(l, s) ? 0 : min(dist_lp(l, s.a), dist_lp(l, s.b));
}
ld dist_sp(const Line& s, const complex<ld>& p) {
  complex<ld> r = proj(s, p);
  return isis_sp(s, r) ? abs(r - p) : min(abs(s.a - p), abs(s.b - p));
}
ld dist_ss(const Line& s, const Line& t) {
  if (isis_ss(s, t)) return 0;
  return min(
      {dist_sp(s, t.a), dist_sp(s, t.b), dist_sp(t, s.a), dist_sp(t, s.b)});
}
Line bisection(const Line& s, const Line& t) {
  const complex<ld> laglanju(is_ll(s, t));
  const complex<ld> avec =
      !(abs(laglanju - s[0]) < eps) ? s[0] - laglanju : s[1] - laglanju;
  const complex<ld> bvec =
      !(abs(laglanju - t[0]) < eps) ? t[0] - laglanju : t[1] - laglanju;
  return Line(laglanju, laglanju + (abs(bvec) * avec + abs(avec) * bvec) /
                                       (abs(avec) + abs(bvec)));
}
complex<ld> inner_center(const vector<Line>& ls) {
  vector<complex<ld>> vertics;
  for (int i = 0; i < static_cast<int>(ls.size()); ++i) {
    vertics.push_back(is_ll(ls[i], ls[(i + 1) % 3]));
  }
  if (vertics[0] == vertics[1] || vertics[1] == vertics[2] ||
      vertics[2] == vertics[0])
    return vertics[0];
  Line bi1(
      bisection(Line(vertics[0], vertics[1]), Line(vertics[0], vertics[2])));
  Line bi2(
      bisection(Line(vertics[1], vertics[2]), Line(vertics[1], vertics[0])));
  if (bi1[0] == bi2[0])
    return bi1[0];
  else {
    return is_ll(bi1, bi2);
  }
}
vector<complex<ld>> ex_center(const vector<Line>& ls) {
  vector<complex<ld>> vertics;
  for (int i = 0; i < static_cast<int>(ls.size()); ++i) {
    vertics.push_back(is_ll(ls[i], ls[(i + 1) % 3]));
  }
  if (abs(vertics[0] - vertics[1]) < eps ||
      abs(vertics[1] - vertics[2]) < eps ||
      (abs(vertics[2] - vertics[0]) < eps))
    return vector<complex<ld>>();
  vector<complex<ld>> ecs;
  for (int i = 0; i < 3; ++i) {
    Line bi1(
        bisection(Line(vertics[i], vertics[i] * 2.0l - vertics[(i + 2) % 3]),
                  Line(vertics[i], vertics[(i + 1) % 3])));
    Line bi2(bisection(Line(vertics[(i + 1) % 3],
                            vertics[(i + 1) % 3] * 2.0l - vertics[(i + 2) % 3]),
                       Line(vertics[(i + 1) % 3], vertics[i])));
    ecs.push_back(is_ll(bi1, bi2));
  }
  return ecs;
}
vector<complex<ld>> same_dis(const vector<Line>& ls) {
  vector<complex<ld>> vertics;
  vertics.push_back(is_ll(ls[0], ls[2]));
  vertics.push_back(is_ll(ls[1], ls[2]));
  if (abs(vertics[0] - vertics[1]) < eps)
    return vector<complex<ld>>{vertics[0]};
  Line bis(bisection(ls[0], ls[1]));
  vector<complex<ld>> ecs;
  Line abi(bisection(Line(vertics[0], vertics[1]), ls[0]));
  ecs.push_back(is_ll(bis, abi));
  Line bbi(bisection(Line(vertics[0], 2.l * vertics[0] - vertics[1]), ls[0]));
  ecs.push_back(is_ll(bis, bbi));
  return ecs;
}
vector<complex<ld>> is_cc(const Circle& c1, const Circle& c2) {
  vector<complex<ld>> res;
  ld d = abs(c1.p - c2.p);
  ld rc = (d * d + c1.r * c1.r - c2.r * c2.r) / (2 * d);
  ld dfr = c1.r * c1.r - rc * rc;
  if (abs(dfr) < eps)
    dfr = 0.0;
  else if (dfr < 0.0)
    return res;
  ld rs = sqrt(dfr);
  complex<ld> diff = (c2.p - c1.p) / d;
  res.push_back(c1.p + diff * complex<ld>(rc, rs));
  if (dfr != 0.0) res.push_back(c1.p + diff * complex<ld>(rc, -rs));
  return res;
}
int is_in_Circle(const Circle& cir, const complex<ld>& p) {
  ld dis = abs(cir.p - p);
  if (dis > cir.r + eps)
    return 0;
  else if (dis < cir.r - eps)
    return 2;
  else
    return 1;
}
int Circle_in_Circle(const Circle& lc, const Circle& rc) {
  ld dis = abs(lc.p - rc.p);
  if (dis < rc.r - lc.r - eps)
    return 2;
  else if (dis > rc.r - lc.r + eps)
    return 0;
  else
    return 1;
}
vector<complex<ld>> is_lc(const Circle& c, const Line& l) {
  vector<complex<ld>> res;
  ld d = dist_lp(l, c.p);
  if (d < c.r + eps) {
    ld len = (d > c.r) ? 0.0 : sqrt(c.r * c.r - d * d);
    complex<ld> nor = (l.a - l.b) / abs(l.a - l.b);
    res.push_back(proj(l, c.p) + len * nor);
    res.push_back(proj(l, c.p) - len * nor);
  }
  return res;
}
vector<complex<ld>> is_sc(const Circle& c, const Line& l) {
  vector<complex<ld>> v = is_lc(c, l), res;
  for (complex<ld> p : v)
    if (isis_sp(l, p)) res.push_back(p);
  return res;
}
vector<Line> tangent_cp(const Circle& c, const complex<ld>& p) {
  vector<Line> ret;
  complex<ld> v = c.p - p;
  ld d = abs(v);
  ld l = sqrt(norm(v) - c.r * c.r);
  if (isnan(l)) {
    return ret;
  }
  complex<ld> v1 = v * complex<ld>(l / d, c.r / d);
  complex<ld> v2 = v * complex<ld>(l / d, -c.r / d);
  ret.push_back(Line(p, p + v1));
  if (l < eps) return ret;
  ret.push_back(Line(p, p + v2));
  return ret;
}
vector<Line> tangent_cc(const Circle& c1, const Circle& c2) {
  vector<Line> ret;
  if (abs(c1.p - c2.p) - (c1.r + c2.r) > -eps) {
    complex<ld> center = (c1.p * c2.r + c2.p * c1.r) / (c1.r + c2.r);
    ret = tangent_cp(c1, center);
  }
  if (abs(c1.r - c2.r) > eps) {
    complex<ld> out = (-c1.p * c2.r + c2.p * c1.r) / (c1.r - c2.r);
    vector<Line> nret = tangent_cp(c1, out);
    ret.insert(ret.end(), (nret).begin(), (nret).end());
  } else {
    complex<ld> v = c2.p - c1.p;
    v /= abs(v);
    complex<ld> q1 = c1.p + v * complex<ld>(0, 1) * c1.r;
    complex<ld> q2 = c1.p + v * complex<ld>(0, -1) * c1.r;
    ret.push_back(Line(q1, q1 + v));
    ret.push_back(Line(q2, q2 + v));
  }
  return ret;
}
ld two_Circle_area(const Circle& l, const Circle& r) {
  ld dis = abs(l.p - r.p);
  if (dis > l.r + r.r)
    return 0;
  else if (dis + r.r < l.r) {
    return r.r * r.r * pi;
  } else if (dis + l.r < r.r) {
    return l.r * l.r * pi;
  } else {
    ld ans = (l.r) * (l.r) *
                 acos((dis * dis + l.r * l.r - r.r * r.r) / (2 * dis * l.r)) +
             (r.r) * (r.r) *
                 acos((dis * dis + r.r * r.r - l.r * l.r) / (2 * dis * r.r)) -
             sqrt(4 * dis * dis * l.r * l.r -
                  (dis * dis + l.r * l.r - r.r * r.r) *
                      (dis * dis + l.r * l.r - r.r * r.r)) /
                 2;
    return ans;
  }
}
ld area(const vector<complex<ld>>& p) {
  ld res = 0;
  int n = p.size();
  for (int j = 0; j < (int)(n); j++) res += cross(p[j], p[(j + 1) % n]);
  return res / 2;
}
bool is_counter_clockwise(const vector<complex<ld>>& poly) {
  ld angle = 0;
  int n = poly.size();
  for (int i = 0; i < (int)(n); i++) {
    complex<ld> a = poly[i], b = poly[(i + 1) % n], c = poly[(i + 2) % n];
    angle += arg((c - b) / (b - a));
  }
  return angle > eps;
}
int is_in_Polygon(const vector<complex<ld>>& poly, const complex<ld>& p) {
  ld angle = 0;
  int n = poly.size();
  for (int i = 0; i < (int)(n); i++) {
    complex<ld> a = poly[i], b = poly[(i + 1) % n];
    if (isis_sp(Line(a, b), p)) return 1;
    angle += arg((b - p) / (a - p));
  }
  return eq(angle, 0) ? 0 : 2;
}
enum { out, on, in };
int convex_contains(const vector<complex<ld>>& P, const complex<ld>& p) {
  const int n = P.size();
  complex<ld> g = (P[0] + P[n / 3] + P[2 * n / 3]) / 3.0l;
  int a = 0, b = n;
  while (a + 1 < b) {
    int c = (a + b) / 2;
    if (cross(P[a] - g, P[c] - g) > 0) {
      if (cross(P[a] - g, p - g) > 0 && cross(P[c] - g, p - g) < 0)
        b = c;
      else
        a = c;
    } else {
      if (cross(P[a] - g, p - g) < 0 && cross(P[c] - g, p - g) > 0)
        a = c;
      else
        b = c;
    }
  }
  b %= n;
  if (cross(P[a] - p, P[b] - p) < 0) return 0;
  if (cross(P[a] - p, P[b] - p) > 0) return 2;
  return 1;
}
vector<complex<ld>> convex_hull(vector<complex<ld>> ps) {
  int n = ps.size();
  int k = 0;
  sort(ps.begin(), ps.end());
  vector<complex<ld>> ch(2 * n);
  for (int i = 0; i < n; ch[k++] = ps[i++])
    while (k >= 2 && ccw(ch[k - 2], ch[k - 1], ps[i]) <= 0) --k;
  for (int i = n - 2, t = k + 1; i >= 0; ch[k++] = ps[i--])
    while (k >= t && ccw(ch[k - 2], ch[k - 1], ps[i]) <= 0) --k;
  ch.resize(k - 1);
  return ch;
}
vector<vector<complex<ld>>> convex_cut(const vector<complex<ld>>& ps,
                                       const Line& l) {
  int n = ps.size();
  vector<complex<ld>> q;
  vector<complex<ld>> r;
  for (int i = 0; i < (int)(n); i++) {
    complex<ld> a = ps[i], b = ps[(i + 1) % n];
    Line m = Line(a, b);
    if (ccw(l.a, l.b, a) != -1) q.push_back(a);
    if (ccw(l.a, l.b, a) != 1) r.push_back(a);
    if (ccw(l.a, l.b, a) * ccw(l.a, l.b, b) < 0 && isis_ll(l, m)) {
      q.push_back(is_ll(l, m));
      r.push_back(is_ll(l, m));
    }
  }
  const vector<vector<complex<ld>>> polys{q, r};
  return polys;
}
void add_Point(vector<complex<ld>>& ps, const complex<ld> p) {
  for (complex<ld> q : ps)
    if (abs(q - p) < eps) return;
  ps.push_back(p);
}
struct edge {
  int src, dst;
  int weight;
  edge(int src, int dst, int weight) : src(src), dst(dst), weight(weight) {}
};
void add_edge(vector<vector<edge>>& g, const int from, const int to,
              const int& weight) {
  g[from].push_back(edge{from, to, weight});
}
vector<vector<edge>> segment_arrangement(const vector<Line>& s,
                                         const vector<complex<ld>>& p) {
  int n = p.size(), m = s.size();
  vector<vector<edge>> g(n);
  for (int i = 0; i < (int)(m); i++) {
    vector<pair<ld, int>> vec;
    for (int j = 0; j < (int)(n); j++)
      if (isis_sp(s[i], p[j])) vec.emplace_back(abs(s[i].a - p[j]), j);
    sort((vec).begin(), (vec).end());
    for (int j = 0; j < (int)(vec.size() - 1); j++) {
      int from = vec[j].second, to = vec[j + 1].second;
      add_edge(g, from, to, static_cast<int>(abs(p[from] - p[to])));
    }
  }
  return g;
}
vector<vector<edge>> sennbunn_arrangement(const vector<Line>& s) {
  vector<complex<ld>> crss;
  for (int i = 0; i < static_cast<int>(s.size()); ++i) {
    for (int j = i + 1; j < static_cast<int>(s.size()); ++j) {
      if (isis_ss(s[i], s[j])) {
        crss.push_back(is_ll2(s[i], s[j])[0]);
      }
    }
  }
  for (int i = 0; i < static_cast<int>(s.size()); ++i) {
    crss.push_back(s[i][0]);
    crss.push_back(s[i][1]);
  }
  return segment_arrangement(s, crss);
}
vector<vector<edge>> Circle_arrangement(const vector<Circle>& c,
                                        const vector<complex<ld>>& p) {
  int n = p.size(), m = c.size();
  vector<vector<edge>> g(n);
  for (int i = 0; i < (int)(m); i++) {
    vector<pair<ld, int>> vec;
    for (int j = 0; j < (int)(n); j++)
      if (abs(abs(c[i].p - p[j]) - c[i].r) < eps)
        vec.emplace_back(arg(c[i].p - p[j]), j);
    sort((vec).begin(), (vec).end());
    for (int j = 0; j < (int)(vec.size() - 1); j++) {
      int from = vec[j].second, to = vec[j + 1].second;
      ld angle = vec[j + 1].first - vec[j].first;
      add_edge(g, from, to, static_cast<int>(angle * c[i].r));
    }
    if (vec.size() >= 2) {
      int from = vec.back().second, to = vec.front().first;
      ld angle = vec.front().first - vec.back().first;
      add_edge(g, from, to, static_cast<int>(angle * c[i].r));
    }
  }
  return g;
}
vector<string> split(const string& str, char delim) {
  vector<string> res;
  size_t current = 0, found;
  while ((found = str.find_first_of(delim, current)) != string::npos) {
    res.push_back(string(str, current, found - current));
    current = found + 1;
  }
  res.push_back(string(str, current, str.size() - current));
  return res;
}
int main() {
  while (1) {
    int N;
    cin >> N;
    if (!N) break;
    vector<Circle> cs;
    for (int i = 0; i < N; ++i) {
      string st;
      cin >> st;
      vector<string> nums(split(st, ','));
      ld x = stold(nums[0]);
      ld y = stold(nums[1]);
      cs.push_back(Circle(complex<ld>(x, y), 1));
    }
    vector<complex<ld>> ps;
    for (int i = 0; i < N; ++i) {
      for (int j = i + 1; j < N; ++j) {
        vector<complex<ld>> aps = is_cc(cs[i], cs[j]);
        ps.insert(ps.end(), aps.begin(), aps.end());
      }
    }
    int ans = 0;
    for (auto p : ps) {
      int nans = 0;
      for (int i = 0; i < N; ++i) {
        if (is_in_Circle(cs[i], p)) nans++;
      }
      ans = max(ans, nans);
    }
    cout << ans << endl;
  }
  return 0;
}
