#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstdlib>
#include<cstdio>

using namespace std;

#define EPS (1e-10)
#define equals(a,b) (fabs((a)-(b)) < EPS)

class Point{
public:
  double x,y;
  
  Point(double x = 0, double y = 0): x(x),y(y){};
  
  Point operator + (Point p) {return Point(x+p.x,y+p.y);}
  Point operator - (Point p) {return Point(x-p.x,y-p.y);}
  Point operator * (double a) {return Point(a*x,a*y);}

  double own_dot(){return x*x+y*y;};
  double abs(){return sqrt(own_dot());}

  bool operator < (const Point &p) const {
    return x != p.x ? x < p.x : y < p.y;
  }
  bool operator == (const Point &p) const{
    return fabs(x-p.x) < EPS && fabs(y-p.y) < EPS;
  }
};

struct Segment{Point p1,p2;};

double dot(Point a, Point b){
  return a.x*b.x+a.y*b.y;
}

//線分sに対する点pの射影
Point project(Segment s, Point p){
  Point base = s.p2 - s.p1;
  double t = dot(p-s.p1,base)/base.own_dot();
  return s.p1 + base*t;
}

//線分sを対象軸とした点pの線対称の点xを求める
Point reflect(Segment s, Point p){
  return p+(project(s,p)-p)*2.0;
}

Point in[3];
int main(){
  while(1){
    char c;

    for(int i = 0; i < 3; i++)
      if(i == 2) cin >> in[i].x >> c >> in[i].y;
      else if(!(cin >> in[i].x >> c >> in[i].y >> c)) return 0;

    Segment s;
    s.p1 = in[0];
    s.p2 = in[1];
    Point ans = reflect(s,in[2]);
    
    printf("%.6f %.6f\n",ans.x, ans.y);
  }
  return 0;
}