#include <algorithm>
#include <vector>
#include <complex>
using namespace std;
//---------------------------------------------------------------
using Point = complex<double>;
using Vector = Point;
using Polygon = vector<Point>;
double dot(const Vector &a, const Vector &b) { return real(conj(a) * b); }
double cross(const Vector &a, const Vector &b) { return imag(conj(a) * b); }
struct Segment : public vector<Point> {
    Segment(const Point &a = Point(), const Point &b = Point()) : vector<Point>(2) {
        begin()[0] = a; begin()[1] = b;
    }
};
using Line = Segment;
Point project(Line s, Point p) {
    Vector base = s[1] - s[0];
    double r = dot(p - s[0], base) / norm(base);
    return s[0] + base * r;
}
//---------------------------------------------------------------

#include <cstdio>
int main() {
    double x1, y1, x2, y2, xq, yq;
    while (~scanf("%lf,%lf,%lf,%lf,%lf,%lf", &x1, &y1, &x2, &y2, &xq, &yq)) {
        Line line(Point(x1, y1), Point(x2, y2));
        Point Q(xq, yq);
        Point R = project(line, Q) * 2.0 - Q;
        printf("%.6f %.6f\n", R.real(), R.imag());
    }
    return 0;
}
