Problem: 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.

Examples

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".

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const long long sz = 1e5 + 5, gsz = 1e2 + 5, mod = 1e9 + 7;
long long noq, q, n, m, cnt = 0, sum = 0, msum = 0, temp;
string s = "", t;
void solve() {
  bool pf = false, sf = false, df = false, cf = false;
  long long i;
  cin >> s;
  n = s.length();
  for (i = 0; i < n; i++) {
    if (!pf) {
      if (s[i] == 'f' and i + 1 < n and s[i + 1] == 't' and i + 2 < n and
          s[i + 2] == 'p') {
        t.push_back('f'), t.push_back('t'), t.push_back('p'), t.push_back(':'),
            t.push_back('/'), t.push_back('/');
        i += 2;
        pf = true;
      } else if (s[i] == 'h' and i + 1 < n and s[i + 1] == 't' and i + 2 < n and
                 s[i + 2] == 't' and i + 3 < n and s[i + 3] == 'p') {
        t.push_back('h'), t.push_back('t'), t.push_back('t'), t.push_back('p'),
            t.push_back(':'), t.push_back('/'), t.push_back('/');
        i += 3;
        pf = true;
      }
    } else if (!sf) {
      t.push_back(s[i]);
      sf = true;
    } else if (!df) {
      if (s[i] == 'r' and i + 1 < n and s[i + 1] == 'u') {
        t.push_back('.'), t.push_back('r'), t.push_back('u');
        if (i + 2 != n) t.push_back('/');
        i++;
        df = true;
      } else
        t.push_back(s[i]);
    } else
      t.push_back(s[i]);
  }
  cout << t << "\n";
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  noq = 1;
  while (noq-- > 0) solve();
  return 0;
}