#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <complex>
#include <string>
#include <sstream>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <functional>
#include <iostream>
#include <map>
#include <set>
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-9
#define INF 2000000000
#define sz(x) ((int)(x).size())
#define fi first
#define sec second
#define SORT(x) sort((x).begin(),(x).end())
#define all(x) (x).begin(),(x).end()
#define EQ(a,b) (abs((a)-(b))<EPS)
int main()
{
	double x1,y1,x2,y2,xq,yq,nx,ny;
	while(scanf("%lf,%lf,%lf,%lf,%lf,%lf",&x1,&y1,&x2,&y2,&xq,&yq)!=EOF)
	{
		if(x1==x2)
		{
			printf("%.6f %.6f\n",x1*2-xq,yq);
			continue;
		}
		if(y1==y2)
		{
			printf("%.6f %.6f\n",xq,y1*2-yq);
			continue;
		}
		nx=((x2-x1)*(x2-x1)*xq+(y2-y1)*(y2-y1)*x1+yq*(y2-y1)*(x2-x1)-y1*(x2-x1)*(y2-y1))/((x2-x1)*(x2-x1)+(y2-y1)*(y2-y1));
		ny=(y2-y1)*(nx-x1)/(x2-x1)+y1;
		printf("%.6f %.6f\n",nx*2-xq,ny*2-yq);
	}
	return 0;
}