#include <iostream>
#include <sstream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <queue>
#include <set>
#include <map>
#include <cstdlib>
#include <cstdio>
#include <cmath>
#include <bitset>
#include <complex>
using namespace std;

const double EPS = 1e-9;
const double PI = 3.14159265359;

typedef complex<double> P;

double Cross(P a, P b){
	return a.real()*b.imag() - b.real()*a.imag();
}

int main(){
	double x, y;
	while(~scanf("%lf,%lf", &x, &y)){
		vector<P> v;
		v.push_back(P(x, y));
		for(int i = 1; i < 3; i++){
			scanf(",%lf,%lf", &x, &y);
			v.push_back(P(x, y));
		}
		double d = 2*Cross(v[1]-v[0], v[2]-v[0])/abs(v[1]-v[0]);
//		cout << "d:" << d <<endl;
		P r = P(0, -1)*(v[1]-v[0]);
		r /= abs(r);
		P p = v[2]+d*r;
		printf("%lf %lf\n", p.real(), p.imag());
	}

	return 0;
}