#include<bits/stdc++.h>
#define double128 __double128
#define re register
#define in inline
#define Pi pair<double,double>
#define vi vector<double>
#define max(a,b)  ((a)>(b)?a:b)
#define min(a,b)  ((a)<(b)?a:b)
#define ls x<<1
#define rs x<<1|1
#define dx x+xx[i]
#define dy y+yy[i]
#define debug cout<<"wuyu"<<endl;
using namespace std;
const double INF = 0x3f3f3f3f;
const double N = 1e5 + 19;
const double M = 1e6 + 10;
const double mod = 998244353;
const double eps = 1e-5;

double s, t, u, v, w, x, y, z;
char ch;
double m(double a, double b, double c, double d, double e, double f)//海伦公式算三角形面积
{
	double x, y, z, p;
	x = sqrt((a - c) * (a - c) + (b - d) * (b - d));
	y = sqrt((a - e) * (a - e) + (b - f) * (b - f));
	z = sqrt((c - e) * (c - e) + (d - f) * (d - f));
	p = (x + y + z) / 2;
	return sqrt(p * (p - x) * (p - y) * (p - z));
}

signed main() {
	cin >> ch >> s >> ch >> t >> ch;
	cin >> ch >> u >> ch >> v >> ch;
	cin >> ch >> w >> ch >> x >> ch;
	cin >> ch >> y >> ch >> z >> ch;
	double abc, abd, acd, bcd;
	abc = (double)m(s, t, u, v, w, x) ;
	abd = (double)m(s, t, u, v, y, z) ;
	acd = (double)m(s, t, w, x, y, z) ;
	bcd = (double)m(u, v, w, x, y, z) ;

	if ((s == y && t == z) || (u == y && v == z) || (w == y && x == z)) {
		cout << 4 << endl;
		return 0;
	}
	else if (abd + acd + bcd > abc) {
		cout << 2 << endl;
		return 0;
	}
	else {
		if (!abc || !abd || !acd || !bcd) {
			cout << 3 << endl;
			return 0;
		}
		cout << 1 << endl;
	}
	return 0;
}