#include <iostream>
#include <vector>
#include <algorithm>
#include <complex>

using namespace std;

typedef complex<double> P;
#define EPS (1e-10)
#define EQ(a,b) (abs((a) - (b)) < EPS)
#define EQV(a,b) (EQ((a).real(),(b).real()) && EQ((a).imag(),(b).imag()))
double dot(P a, P b) {
  return (a.real() * b.real() + a.imag() * b.imag());
}

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

double distance_l_p(P a, P b, P c) {
  return abs(cross(b-a, c-a)) / abs(b-a);
}

int main(){


	char cm;
	double x1,y1,x2,y2,xq,yq;

	while(cin>>x1>>cm>>y1>>cm>>x2>>cm>>y2>>cm>>xq>>cm>>yq){
		P p[2];
		p[0]=P(x1,y1);
		p[1]=P(x2,y2);
		P q=P(xq,yq);
		P v=p[0]-p[1];
		P nve = P(-v.imag(),v.real());
		nve/=abs(nve);
		double d = distance_l_p(p[0],p[1],q);
		
		P r[2];
		r[0] = q + 2*d*nve;
		r[1] = q - 2*d*nve;
		if(distance_l_p(p[0],p[1],r[0])>distance_l_p(p[0],p[1],r[1])){
			printf("%.5f %.5f\n",r[1].real(),r[1].imag());
		}
		else{
			printf("%.5f %.5f\n",r[0].real(),r[0].imag());
		}
	}

	return 0;
}