#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<cstring>
#include<cctype>
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<stack>
#include<queue>
#include<map>

using namespace std;
const int dx[] = {1,0,-1,0},dy[] = {0,1,0,-1};
#define INF 999999
#define rep(i,j) for(int i=0;i<(j);i++)
#define reps(i,j,k) for(int i=j;i<k;i++)
typedef long long ll;
typedef unsigned long long ull;

int main(){
        double x1,y1,x2,y2,xq,yq;
        while(~scanf("%lf,%lf,%lf,%lf,%lf,%lf",&x1,&y1,&x2,&y2,&xq,&yq)){
            double p_a = (y2-y1) / (x2-x1);
            double q_a = -1 / p_a;
            double p_b = y1 - x1*p_a;
            double q_b = yq - xq*q_a;

            double xm = (q_b - p_b) / (p_a - q_a);
            double ym = (p_a*xm)+ p_b;

            double rx = xm-(xq-xm);
            double ry = ym-(yq-ym);
            if(x1 == x2){
                printf("%lf %lf\n",x1-(xq-x1),yq);
            }
            else if(y1 ==y2){
                printf("%lf %lf\n",xq,y1-(yq-y1));
            }
            else{
                printf("%lf %lf\n",rx,ry);
            }
        }
	return 0;
}