#define _CRT_SECURE_NO_WARNINGS 1
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cstdlib>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <queue>
#include <sstream>
#include <climits>
#include <cmath>
#include <functional>
#include <map>
#include <stack>
using namespace std;
#define M_PI 3.141592
#define FOR(i,n) for(int i=0;i<(int)n;i++)
#define FORI(i,k,n) for(int i=k;i<(int)n;i++)
#define toRad 2.0*M_PI/360.0
#define inin(x) int x;cin>>x;
#define all(x) x.begin(),x.end()
#define debug(x) cout<<#x<<" "<<x<<endl;
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define EPS 1e-12
#define pri_max 60000
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
int dx[4] = { 0,1,0,-1 };
int dy[4] = { 1,0,-1,0 };

/*
bool memo[pri_max] = {};
vector<int> pri;
void calc()
{
	for (int i = 2; i < pri_max; i++)
	{
		if (memo[i] == false)
		{
			pri.push_back(i);
			for (int l = i; l < pri_max; l += i)
			{
				memo[l] = true;
			}
		}
	}
}*/
double len(pdd a, pdd b)
{
	return sqrt((b.first - a.first)*(b.first - a.first) + (b.second - a.second)*(b.second -a.second));
}

int main()
{
	pdd p1, p2, q;
	while (scanf("%lf,%lf,%lf,%lf,%lf,%lf", &p1.first, &p1.second, &p2.first, &p2.second, &q.first, &q.second) != EOF)
	{
		pdd p = p1;
		double R = atan2((p2.second - p1.second),(p2.first - p1.first));
		double r = atan2((q.second - p1.second), (q.first - p1.first));
		double L = sin(r-R)*len(q, p1);
		double l = cos(r-R)*len(q, p1);
		p.first += cos(R)*l;
		p.second += sin(R)*l;
		R = atan2((p.second - q.second), (p.first - q.first));
		L = fabs(L);
		p.first += cos(R)*L;
		p.second += sin(R)*L;

		printf("%.5f %.5f\n", p.first, p.second);
	}
}