#include <iostream>
#include <queue>
#include <stack>
#include <vector>
#include <stdio.h>
#include <algorithm>
#include <string.h>
#include <string>
#include <cmath>
#include <complex>
#include <map>
using namespace std;

#define rep(i,n) for(int i=0;i<int(n);++i)
#define ALL(v) (v).begin(),(v).end()
#define PB push_back
#define EPS 1e-8
#define F first
#define S second

static const double PI=6*asin(0.5);
typedef pair<double,double> P;
typedef complex<double> CP;
typedef long long ll;

double x[4],y[4];
double x2[4];
double y2[4];
double ang;
char t;

int main(){
	while(cin>>x[0]>>t>>y[0]>>t>>x[1]>>t>>y[1]>>t>>x[2]>>t>>y[2]){
		ang=atan((y[1]-y[0])/(x[1]-x[0]));
		rep(i,3){
			x2[i]=x[i]*cos(ang)+y[i]*sin(ang);
			y2[i]=-1*x[i]*sin(ang)+y[i]*cos(ang);
		}
		//rep(i,3)cout<<x[i]<<" "<<y[i]<<"  "<<x2[i]<<" "<<y2[i]<<endl;
		x2[3]=x2[2];
		y2[3]=-1*y2[2]+2.0*y2[1];
		ang*=-1;
		x[3]=x2[3]*cos(ang)+y2[3]*sin(ang);
		y[3]=-1*x2[3]*sin(ang)+y2[3]*cos(ang);
		printf("%.6f %.6f\n",x[3],y[3]);
	}
	return 0;
}