#include <iostream>
#include <algorithm>
#include <vector>
#include <math.h>
#include <cmath>
#include <utility>
#include <queue>
#include <stdio.h>
#include <string>
#include <map>
#include <stack>
#include <complex>
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1000000000007
const double eps = 1e-11;
using namespace std;
typedef long long int ll;
typedef complex<double> xy;

int main(){
    double x1,y1,x2,y2,px,py;
    while(~scanf("%lf,%lf,%lf,%lf,%lf,%lf",&x1,&y2,&x2,&y2,&px,&py)){
        xy p = xy(px,py);
        xy ba=xy(x2-x1,y2-y1),bb=xy(px-x1,py-y1);
        double dp = (conj(ba)*bb).real();
        xy bc = ba*dp/norm(ba);
        xy pp = xy(bc.real()+x1,bc.imag()+y1);
        xy ans = p+(pp-p)+(pp-p);
        printf("%.5lf %.5lf\n",ans.real(),ans.imag());
    }
}