#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#include<complex>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = (1e+18) + 7;
typedef pair<int, int>P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-6;
const ld pi = acos(-1.0);
//typedef vector<vector<ll>> mat;
typedef vector<int> vec;

ll mod_pow(ll a, ll n) {
	ll res = 1;
	while (n) {
		if (n & 1)res = res * a%mod;
		a = a * a%mod; n >>= 1;
	}
	return res;
}

struct modint {
	ll n;
	modint() :n(0) { ; }
	modint(ll m) :n(m) {
		if (n >= mod)n %= mod;
		else if (n < 0)n = (n%mod + mod) % mod;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint &a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint &a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint &a, modint b) { a.n = ((ll)a.n*b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, int n) {
	if (n == 0)return modint(1);
	modint res = (a*a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

//ll inv(ll a, ll p) {
//	return (a == 1 ? 1 : (1 - p * inv(p%a, a)) / a + p);
//}
//modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }

int dx[4] = { 1,0,-1,0 };
int dy[4] = { 0,1,0,-1 };

typedef complex<ld> Point;
ld dot(Point a, Point b) { return real(conj(a)*b); }
ld cross(Point a, Point b) { return imag(conj(a)*b); }

struct Line {
	Point a, b;
};

Point proj(Line l, Point p) {
	ld t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);
	return l.a + t * (l.a - l.b);
}
Point is_ll(Line s, Line t) {
	Point sv = s.b - s.a; Point tv = t.b - t.a;
	return s.a + sv * cross(tv, t.a - s.a) / cross(tv, sv);
}
Point is_rev(Line l, Point p) {
	Point q = proj(l, p);
	Point res = (ld)2 * q - p;
	return res;
}

struct status {
	int id; Point p; Line l;
};
status merge(status &a, status &b) {
	if (!a.id && !b.id) {
		return { 1,0,{a.p,b.p} };
	}
	else if (!a.id && b.id) {
		return { 0,is_rev(b.l,a.p),{0,0} };
	}
	else if (a.id && !b.id) {
		return { 0,is_rev(a.l,b.p),{0,0} };
	}
	else return { 0,is_ll(a.l,b.l),{0,0} };
}

bool isnum(char &t) {
	return '0' <= t && t <= '9';
}

status expr(string &s, int &i);
status point(string &s, int &i);


status expr(string &s, int &i) {
	if (isnum(s[i])||s[i]=='-') {
		return point(s, i);
	}
	status res;
	bool upd = false;
	while (i<s.size()) {
		assert(s[i] == '(');
		//skip '('
		i++;

		status nex = expr(s, i);
		if (!upd)res = nex,upd=true;
		else res = merge(res, nex);

		//skip ')'
		i++;
		if (i < s.size() && s[i] == '@') {
			//skip '@'
			i++;
		}
		else break;
	}
	return res;
}
status point(string &s, int &i) {
	string le, ri;
	bool m = false;

	//skip -
	if (s[i] == '-')m = true,++i;

	while (i < s.size() && isnum(s[i])) {
		le.push_back(s[i]); i++;
	}
	ld l = stoi(le); if (m)l = -l;

	//skip ,
	i++;

	m = false;

	//skip -
	if (s[i] == '-')m = true,++i;

	while (i < s.size() && isnum(s[i])) {
		ri.push_back(s[i]); i++;
	}
	ld r = stoi(ri); if (m)r = -r;

	
	return status{ 0,Point{l,r},{0,0} };
}

void solve() {
	string in;
	while (cin >> in) {
		if (in == "#")break;
		int i = 0;
		status ans = expr(in, i);
		assert(i == in.size());
		ld l = real(ans.p);
		ld r = imag(ans.p);
		cout << l << " " << r << endl;
	}
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout << fixed << setprecision(7);
	//init();
	//int t; cin >> t; rep(i, t)solve();
	solve();
	stop
		return 0;
}



Measured memory_bytes: 3316