#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <cassert>
#include <iostream>
#include <cctype>
#include <sstream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <set>
#include <stack>
#include <map>
#include <utility>
#include <numeric>
#include <algorithm>
#include <iterator>
#include <bitset>
#include <complex>
#include <fstream>
#include <iomanip>
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
typedef vector<int> vint;
typedef pair<int, int> pint;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for(int i = x; i < n; i++)
template<class T> T RoundOff(T a){ return int(a+.5-(a<0)); }
template<class T, class C> void chmax(T& a, C b){ if(a < b) a = b; }
template<class T, class C> void chmin(T& a, C b){ if(b < a) a = b; }
template<class T, class C> pair<T, C> mp(T a, C b){ return make_pair(a, b); }

struct P{ double x, y; };

int main()
{
	vector<P> p(3);

	char k;
	while(true)
	{
		cin >> p[0].x >> k >> p[0].y >> k >> p[1].x >> k >> p[1].y >> k >> p[2].x >> k >> p[2].y;
		if(cin.eof()) break;


		P res = p[2];
		if(!(p[0].x - p[1].x))
			res.x += 2 * (p[0].x - res.x);
		else if(!(p[0].y - p[1].y))
			res.y += 2 * (p[0].y - res.y);
		else
		{
			double oa = (p[0].y - p[1].y) / (p[0].x - p[1].x), ob = p[0].y - oa * p[0].x;
			double a = -1.0 / oa, b = p[2].y - a * p[2].x;

			double x = -(b - ob) / (a - oa), y = a * x + b;

			res.x = 2.0 * x - p[2].x;
			res.y = 2.0 * y - p[2].y;
		}

		printf("%.6f %.6f\n", res.x, res.y);
	}
}