#include <bits/stdc++.h>
#pragma GCC target("sse4,avx")
void run(std::istream &in, std::ostream &out) {
  std::string s;
  in >> s;
  std::string w;
  for (int i = 0; i < s.length(); i++) {
    if (i > 0 && s[i] == s[i - 1] && s[i] == '/') continue;
    w.push_back(s[i]);
  }
  if (w.length() > 1 && w.back() == '/') {
    w.resize(w.size() - 1);
  }
  out << w << std::endl;
}
int main() {
  std::cin.sync_with_stdio(false);
  std::cin.tie(nullptr);
  run(std::cin, std::cout);
  return 0;
}

### Prompt

Develop a solution in CPP to the problem described below:

The new operating system BerOS has a nice feature. It is possible to use any number of characters '/' as a delimiter in path instead of one traditional '/'. For example, strings //usr///local//nginx/sbin// and /usr/local/nginx///sbin are equivalent. The character '/' (or some sequence of such characters) at the end of the path is required only in case of the path to the root directory, which can be represented as single character '/'.

A path called normalized if it contains the smallest possible number of characters '/'.

Your task is to transform a given path to the normalized form.

Input

The first line of the input contains only lowercase Latin letters and character '/' — the path to some directory. All paths start with at least one character '/'. The length of the given line is no more than 100 characters, it is not empty.

Output

The path in normalized form.

Examples

Input

//usr///local//nginx/sbin


Output

/usr/local/nginx/sbin

### Response

```cpp
#include <bits/stdc++.h>
#pragma GCC target("sse4,avx")
void run(std::istream &in, std::ostream &out) {
  std::string s;
  in >> s;
  std::string w;
  for (int i = 0; i < s.length(); i++) {
    if (i > 0 && s[i] == s[i - 1] && s[i] == '/') continue;
    w.push_back(s[i]);
  }
  if (w.length() > 1 && w.back() == '/') {
    w.resize(w.size() - 1);
  }
  out << w << std::endl;
}
int main() {
  std::cin.sync_with_stdio(false);
  std::cin.tie(nullptr);
  run(std::cin, std::cout);
  return 0;
}

```