#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;
}
