#include <iostream>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <algorithm>	// require sort next_permutation count __gcd reverse etc.
#include <cstdlib>	// require abs exit atof atoi 
#include <cstdio>		// require scanf printf
#include <functional>
#include <numeric>	// require accumulate
#include <cmath>		// require fabs
#include <climits>
#include <limits>
#include <cfloat>
#include <iomanip>	// require setw
#include <sstream>	// require stringstream 
#include <cstring>	// require memset
#include <cctype>		// require tolower, toupper
#include <fstream>	// require freopen
#include <ctime>		// require srand
#include <complex>

#define rep(i,n) for(int i=0;i<(n);i++)
#define ALL(A) A.begin(), A.end()

using namespace std;

typedef long long ll;
typedef complex<double> P;

typedef pair<double,double> DD;
typedef pair<double, DD> TD;

// 点 p1, p2  の通る直線の方程式
TD calc_line (P p1, P p2 )
{
	double a = p1.imag() - p2.imag();
	double b = p2.real() - p1.real();
	double c = p1.real()*p2.imag() - p2.real()*p1.imag();

	return TD (a, DD (b, c ) );
}

int main()
{
//	cut here before submit 
//	freopen ("testcase.a_symmetric_point", "r", stdin );

	double x1, y1, x2, y2, xq, yq;
	while (scanf("%lf,%lf,%lf,%lf,%lf,%lf", &x1, &y1, &x2, &y2, &xq, &yq) != EOF) {
//		cerr << " x1: " << x1 << " y1: " << y1 << " x2: " << x2 << " y2: " << y2 << " xq: " << xq << " yq: " << yq << endl;
		P p1 = P (x1, y1 );
		P p2 = P (x2, y2 );
		P q  = P (xq, yq );
		TD l = calc_line (p1, p2 );
		double a = l.first;
		double b = l.second.first;
		double c = l.second.second;
//		cerr << "a: " << a << " b: " << b << " c: " << c << endl;
		double C = (a*xq + b*yq + c)/(a*a+b*b);
		P ph = q - P(C*a, C*b );
		double x = 2.*ph.real() - xq;
		double y = 2.*ph.imag() - yq;

		printf ("%lf %lf\n", x, y );
	} // end loop
		
	return 0;
}