#include <bits/stdc++.h>
using namespace std;
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
int getint(string s) {
  int x = stoi(s);
  return x;
}
string getstring(int x) {
  string lol = to_string(x);
  return lol;
}
bool ok(int x, int gg) { return (x <= gg - 1 and x >= 0); }
int X[4] = {1, 0, -1, 0};
int Y[4] = {0, 1, 0, -1};
int gcd(int a, int b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
long long int lcm(long long int a, long long int b) {
  return (a * b) / gcd(a, b);
}
long long int exponentMod(long long int A, long long int B, long long int C) {
  if (A == 0) return 0;
  if (B == 0) return 1;
  long long int y;
  if (B % 2 == 0) {
    y = exponentMod(A, B / 2, C);
    y = (y * y) % C;
  } else {
    y = A % C;
    y = (y * exponentMod(A, B - 1, C) % C) % C;
  }
  return (long long int)((y + C) % C);
}
bool ispal(string x) {
  for (int i = 0, j = x.size() - 1; i < x.size(); i++, j--) {
    if (i > j) break;
    if (x[j] != x[i]) return false;
  }
  return true;
}
int main() {
  string s;
  while (cin >> s) {
    string ans;
    int n = s.size();
    ans += s[0];
    int sw = 0;
    for (int i = 1; i < n; i++) {
      if (s[i] == 'a' && s[i + 1] == 't') {
        if (i + 1 == n - 1) {
          ans += s[i];
          ans += s[i + 1];
          i++;
        } else {
          if (!sw) {
            i++;
            ans += '@';
            sw = 1;
          } else {
            ans += s[i];
            ans += s[i + 1];
            i++;
          }
        }
        continue;
      }
      if (s[i] == 'd' && s[i + 1] == 'o' && s[i + 2] == 't') {
        if (i + 2 == n - 1) {
          ans += s[i];
          ans += s[i + 1];
          ans += s[i + 2];
          i += 2;
        } else {
          i += 2;
          ans += '.';
        }
        continue;
      } else
        ans += s[i];
    }
    cout << ans << endl;
  }
}
