Problem: Sometimes one has to spell email addresses over the phone. Then one usually pronounces a dot as dot, an at sign as at. As a result, we get something like vasyaatgmaildotcom. Your task is to transform it into a proper email address (vasya@gmail.com). 

It is known that a proper email address contains only such symbols as . @ and lower-case Latin letters, doesn't start with and doesn't end with a dot. Also, a proper email address doesn't start with and doesn't end with an at sign. Moreover, an email address contains exactly one such symbol as @, yet may contain any number (possible, zero) of dots. 

You have to carry out a series of replacements so that the length of the result was as short as possible and it was a proper email address. If the lengths are equal, you should print the lexicographically minimal result. 

Overall, two variants of replacement are possible: dot can be replaced by a dot, at can be replaced by an at. 

Input

The first line contains the email address description. It is guaranteed that that is a proper email address with all the dots replaced by dot an the at signs replaced by at. The line is not empty and its length does not exceed 100 symbols.

Output

Print the shortest email address, from which the given line could be made by the described above replacements. If there are several solutions to that problem, print the lexicographically minimal one (the lexicographical comparison of the lines are implemented with an operator < in modern programming languages).

In the ASCII table the symbols go in this order: . @ ab...z

Examples

Input

vasyaatgmaildotcom


Output

vasya@gmail.com


Input

dotdotdotatdotdotat


Output

dot..@..at


Input

aatt


Output

a@t

Solution (in JAVA):

Solution:
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;

public class Solution {

//		public static final double eps = 1e-9;
//		public static final int mod = 1000000007;
//		public static final double pi = 3.1415926535897932384626433832795028841971693993751058209749445923078164062862089986280348253421170679;
//		public static final int sievesize = (int) (1e7 + 10);
//		public static boolean[] prime;
//		public static final int dx[] = {1, -1, 0, 0};
//		public static final int dy[] = {0, 0, 1, -1};

	public static void main(String[] args) throws IOException {
		InputStream inputStream = System.in;
		OutputStream outputStream = System.out;
		InputReader in = new InputReader(inputStream);
		OutputWriter out = new OutputWriter(outputStream);
		Task solver = new Task();
		solver.solve(1, in, out);
		out.close();
	}

	static class Task {

		public void solve(int testNumber, InputReader in, OutputWriter out) throws IOException {
			String str = in.next();
			StringBuilder res = new StringBuilder();
			int i = 0, j = 0;
			if (str.substring(0, 3).equals("dot")) {
				res.append("dot");
				i = 3;
			}
			else if (str.substring(0, 2).equals("at")) {
				res.append("at");
				i = 2;
			}
			if (str.substring(str.length() - 3).equals("dot")) {
				j = str.length() - 3;
			}
			else if (str.substring(str.length() - 2).equals("at")) {
				j = str.length() - 2;
			}
			else {
				j = str.length();
			}
			boolean flag = false;
			while (i < j) {
				if (i + 3 < str.length() && str.substring(i, i + 3).equals("dot")) {
					res.append(".");
					i += 3;
				}
				else if (i + 2 < str.length() && str.substring(i, i + 2).equals("at")) {
					if (!flag) {
						res.append("@");
						flag = true;
					}
					else {
						res.append(str.substring(i, i + 2));
					}
					i += 2;
				}
				else {
					res.append(str.charAt(i));
					i++;
				}
			}
			res.append(str.substring(j));
			out.println(res);
		}

//		static class Node {
//			String name;
//			LinkedList<Node> list;
//			
//			public Node(String name) {
//				this.name = name;
//				list = new LinkedList<>();
//			}
//		}
//        
//		static class Pair {   	
//	      	int first, second;
//		        	
//		    public Pair(int first, int second) {
//	    		this.first = first;
//				this.second = second;
//			}
//	    }
	}

	//	public static int[] shuffle(int arr[], Random gen) {
	//		for(int i = 0, n = arr.length; i < n; i++)
	//		{
	//			int index = gen.nextInt(n - i) + i;
	//			int temp = arr[i];
	//			arr[i] = arr[index];
	//			arr[index] = temp;
	//		}
	//		return arr;
	//	}
	//
	//	public static boolean triangle(long a, long b, long c){
	//	    return ((a+b) > c && (b+c) >a && (a+c) > b);
	//	}
	//		
	//	public static boolean isPerfectSquare(long n){
	//		if (n < 0) 
	//	    	return false;
	//	    long test = (long) (Math.sqrt(n) + 0.5);
	//	    return test*test == n;
	//	}
	//		
	//	public static int isnum(char s){
	//		if(s=='1' || s=='2' || s=='3' || s=='4' || s=='5' || s=='6' || s=='7' || s=='8' || s=='9' || s=='0') 
	//	    	return 1; 
	//		return 0;
	//	}
	//		
	//	public static long nextPowerOf2(long n){
	//	    n--;
	//	    n |= n >> 1;
	//	    n |= n >> 2;
	//	    n |= n >> 4;
	//	    n |= n >> 8;
	//	    n |= n >> 16;
	//	    n++;
	//	    return n;
	//	}
	//		
//		public static int gcd(int a, int b){
//		    int t; 
//		    while (b > 0){ 
//		    	a = a % b; 
//		    	t = a; 
//		    	a = b; 
//		    	b = t; 
//	    	}
//		    return a;
//		}
	//		
	//	public static void sieve(int n){
	//		prime=new boolean[sievesize+1];
	//		Arrays.fill(prime, true);
	//	    long x, y; 
	//	    for(x = 2; x * x <= sievesize; x++)
	//	    { 
	//	    	if(prime[(int) x])
	//	    		for(y = x * 2; y <= sievesize; y += x) 
	//	    			prime[(int) y]=false; 
	//	    }
	//	}

	static class InputReader {
		public BufferedReader reader;
		public StringTokenizer tokenizer;

		public InputReader(InputStream stream) {
			reader = new BufferedReader(new InputStreamReader(stream), 32768);
			tokenizer = null;
		}

		public String next() {
			while (tokenizer == null || !tokenizer.hasMoreTokens()) {
				try {
					tokenizer = new StringTokenizer(reader.readLine());
				} catch (IOException e) {
					throw new RuntimeException(e);
				}
			}
			return tokenizer.nextToken();
		}

		public int nextInt() {
			return Integer.parseInt(next());
		}

		public long nextLong() {
			return Long.parseLong(next());
		}
		
		public char nextChar() {
			return next().charAt(0);
		}
		
		public float nextFloat() {
			return Float.parseFloat(next());
		}
		
		public double nextDouble() {
			return Double.parseDouble(next());
		}

		public int[] nextIntArray(int size) {
			while (tokenizer == null || !tokenizer.hasMoreTokens()) {
				try {
					tokenizer = new StringTokenizer(reader.readLine());
				} catch (IOException e) {
					throw new RuntimeException(e);
				}
			}
			int[] arr=new int[size];
			for(int i = 0; i < size; i++) 
				arr[i] = Integer.parseInt(tokenizer.nextToken());
			return arr;
		}

		public long[] nextLongArray(int size) {
			while (tokenizer == null || !tokenizer.hasMoreTokens()) {
				try {
					tokenizer = new StringTokenizer(reader.readLine());
				} catch (IOException e) {
					throw new RuntimeException(e);
				}
			}
			long[] arr=new long[size];
			for(int i = 0; i < size; i++) 
				arr[i] = Long.parseLong(tokenizer.nextToken());
			return arr;
		}

		public double[] nextDoubleArray(int size) {
			while (tokenizer == null || !tokenizer.hasMoreTokens()) {
				try {
					tokenizer = new StringTokenizer(reader.readLine());
				} catch (IOException e) {
					throw new RuntimeException(e);
				}
			}
			double[] arr=new double[size];
			for(int i = 0; i < size; i++) 
				arr[i] = Double.parseDouble(tokenizer.nextToken());
			return arr;
		}

		public String[] nextStringArray(int size) throws IOException {
			String[] arr=new String[size];
			for(int i = 0; i < size; i++) 
				arr[i] = reader.readLine();
			return arr;
		}

		public char[] nextCharArray(int size) throws IOException {
			char[] arr=reader.readLine().toCharArray();
			return arr;
		}
	}

	static class OutputWriter {
		public PrintWriter pw;

		public OutputWriter(OutputStream stream) {
			pw = new PrintWriter(stream);
		}
		
		public void println() {
			pw.println();
		}

		public void println(Object str) {
			pw.println(str);
		}

		public void print(Object str) {
			pw.print(str + " ");
		}

		public void close() {
			pw.close();
		}

		public void flush() {
			pw.flush();
		}

		public void printStringArray(String[] arr) {
			for(int i = 0; i < arr.length; i++)
				pw.println(arr[i]);
		}

		public void printIntArray(int[] arr) {
			for(int i = 0; i < arr.length; i++)
				pw.print(arr[i] + " ");
		}

		public void printLongArray(long[] arr) {
			for(int i = 0; i < arr.length; i++)
				pw.print(arr[i] + " ");
		}

		public void printCharArray(char[] arr) {
			for(int i = 0; i < arr.length; i++)
				pw.print(arr[i] + " ");
		}

		public void printFloatArray(float[] arr) {
			for(int i = 0; i < arr.length; i++)
				pw.print(arr[i] + " ");
		}

		public void printDoubleArray(double[] arr) {
			for(int i = 0; i < arr.length; i++)
				pw.print(arr[i] + " ");
		}
	}
}