#include <iostream>
#include <cstdio>
#include <vector>
#include <list>
#include <algorithm>
#include <cmath>
#include <stack>
#include <map>
#include <numeric>
#include <sstream>
#include <queue>
#include <iomanip>
using namespace std;

#define REP(i,n) for(int (i)=0; (i)<(n); (i)++)
#define FOR(i,a,b) for(int (i)=(a); (i)<(b); (i)++)
#define PUSH(n,v) for(int i=0; i<(n); i++) {int j; cin >> j; v.push_back(j);}
#define ALL(v) v.begin(), v.end()
#define print(s) cout << (s) << endl

void solve(double x1, double y1, double x2, double y2, double xq, double yq) {
    double x,y;
    if (y1==y2) {
        x = xq;
        y = 2*y1-yq;
        printf("%.4f %.4f\n", x, y);
        return;
    }
    if (x1==x2) {
        y = yq;
        x = 2*x1-xq;
        printf("%.4f %.4f\n", x, y);
        return;
    }
    x = (2*yq-2*y1-2*(y2-y1)/(x2-x1)*((xq/2)-x1)+xq*(x2-x1)/(y2-y1))/
    ((y2-y1)/(x2-x1)+(x2-x1)/(y2-y1));
    y = yq-(x2-x1)/(y2-y1)*(x-xq);
    printf("%.4f %.4f\n", x, y);
}

int main() {
    double x1,y1,x2,y2,xq,yq;
    char c;
    while(cin>>x1>>c>>y1>>c>>x2>>c>>y2>>c>>xq>>c>>yq) {
        solve(x1,y1,x2,y2,xq,yq);
    }
   return 0;
}