#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <iomanip>
#include <utility>
#include <tuple>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#include <cassert>
#include <functional>
#include <numeric>
#include <type_traits>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define coutf(f) cout << fixed << setprecision(f)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
const int inf = 1e9;
const ll INF = 1e18;
const int mod = 998244353;
const int MOD = 1000000007;
using Graph = vector<vector<int>>;

int main() {
	string s;
	cin >> s;
	string ans;
	bool b = true;
	int x, y;
	rep(i, s.size()) {
		if (s[i] == '(') x = i;
		if (s[i] == ')') y = i;
	}
	s.erase(x, y - x + 1);
	rep(i, x) cout << s[i];
	cout << "@";
	for (int i = x; i < s.size(); i++) cout << s[i];
	cout << endl;
	return 0;
}