line = input()
len = len(line)
ans = line[1:len - 1]
ans = ans.replace("dot",".")
ans = ans.replace("at","@",1)
print(f'{line[0:1]}{ans}{line[len - 1:]}')#include <bits/stdc++.h>
using namespace std;
int main()
{
string s;
cin >> s;
for (int i=1; i<s.size()-3;i++)
{
if (s[i]=='d'&& s[i+1]=='o' && s[i+2]=='t') {s[i]='.'; s.erase(i+1, 2);}
}
for (int i=1; i<s.size()-2;i++)
{
if (s[i]=='a' && s[i+1]=='t') {s[i]='@'; s.erase(i+1, 1); break;}
}
cout <<s;
return 0;
}
215. Kth Largest Element in an Array | 198. House Robber |
153. Find Minimum in Rotated Sorted Array | 150. Evaluate Reverse Polish Notation |
144. Binary Tree Preorder Traversal | 137. Single Number II |
130. Surrounded Regions | 129. Sum Root to Leaf Numbers |
120. Triangle | 102. Binary Tree Level Order Traversal |
96. Unique Binary Search Trees | 75. Sort Colors |
74. Search a 2D Matrix | 71. Simplify Path |
62. Unique Paths | 50. Pow(x, n) |
43. Multiply Strings | 34. Find First and Last Position of Element in Sorted Array |
33. Search in Rotated Sorted Array | 17. Letter Combinations of a Phone Number |
5. Longest Palindromic Substring | 3. Longest Substring Without Repeating Characters |
1312. Minimum Insertion Steps to Make a String Palindrome | 1092. Shortest Common Supersequence |
1044. Longest Duplicate Substring | 1032. Stream of Characters |
987. Vertical Order Traversal of a Binary Tree | 952. Largest Component Size by Common Factor |
212. Word Search II | 174. Dungeon Game |