B. Internet Address

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Vasya is an active Internet user. One day he came across an Internet resource he liked, so he wrote its address in the notebook. We know that the address of the written resource has format:

<protocol>://<domain>.ru[/<context>]

where:

• <protocol> can equal either "http"
  (without the quotes) or "ftp" (without the quotes),
• <domain> is a non-empty string, consisting of lowercase English letters,
• the /<context> part may not be present. If it is present, then <context> is
  a non-empty string, consisting of lowercase English letters.

If string <context> isn't present in the address, then the additional character "/"
isn't written. Thus, the address has either two characters "/" (the ones that go before the domain), or three (an extra one in front of the context).

When the boy came home, he found out that the address he wrote in his notebook had no punctuation marks. Vasya must have been in a lot of hurry and didn't write characters ":",
"/", ".".

Help Vasya to restore the possible address of the recorded Internet resource.

Input

The first line contains a non-empty string that Vasya wrote out in his notebook. This line consists of lowercase English letters only.

It is guaranteed that the given string contains at most 50 letters. It is guaranteed that the given string can be obtained from some correct Internet resource address, described above.

Output

Print a single line — the address of the Internet resource that Vasya liked. If there are several addresses that meet the problem limitations, you are allowed to print any of them.

Sample test(s)input

httpsunrux

output

http://sun.ru/x

input

ftphttprururu

output

ftp://http.ru/ruru

Note

In the second sample there are two more possible answers: "ftp://httpruru.ru" and "ftp://httpru.ru/ru".

解題說明：此題就是把一個去掉分隔字元的網路地址還原，這裡只有http和ftp兩種協議，可以先判斷首字母，然後再定位ru的位置。注意如果協議名後直接跟著ru這時不應該把ru看成是網域名稱尾碼，因為http://.ru/xxxx是一個非法的url，所以要跳過一位尋找。

#include<iostream>#include<map>#include<string>#include<algorithm>#include<cstdio>#include<cmath>using namespace std;int main(){char a[52];int j,i;scanf("%s",&a);if(a[0]=='h'){printf("http://");printf("%c",a[4]);for(i=5;a[i]!='\0';i++){if(a[i]=='r'&&a[i+1]=='u'){break;}printf("%c",a[i]);}printf(".ru");if(a[i+2]!='\0'){printf("/");for(j=i+2;a[j]!='\0';j++){printf("%c",a[j]);}}printf("\n");}else{printf("ftp://");printf("%c",a[3]);for(i=4;a[i]!='\0';i++){if(a[i]=='r'&&a[i+1]=='u'){break;}printf("%c",a[i]);}printf(".ru");if(a[i+2]!='\0'){printf("/");for(j=i+2;a[j]!='\0';j++){printf("%c",a[j]);}}printf("\n");}return 0;}