#include <bits/stdc++.h>
using namespace std;
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  queue<char> q;
  string s;
  cin >> s;
  for (long long i = 0; i < s.length(); i++) {
    if (s[i] == '/') {
      if (q.empty() || q.back() != '/') q.push(s[i]);
    } else
      q.push(s[i]);
  }
  string res = "";
  while (!q.empty()) {
    res += q.front();
    q.pop();
  }
  for (long long i = res.length() - 1; i >= 0 && res.length() > 1; i--) {
    if (res[i] == '/') {
      res.erase(i, 1);
      i++;
    } else
      break;
  }
  cout << res;
  return 0;
}

### Prompt

Your challenge is to write a Cpp solution to the following problem:

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>
using namespace std;
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  queue<char> q;
  string s;
  cin >> s;
  for (long long i = 0; i < s.length(); i++) {
    if (s[i] == '/') {
      if (q.empty() || q.back() != '/') q.push(s[i]);
    } else
      q.push(s[i]);
  }
  string res = "";
  while (!q.empty()) {
    res += q.front();
    q.pop();
  }
  for (long long i = res.length() - 1; i >= 0 && res.length() > 1; i--) {
    if (res[i] == '/') {
      res.erase(i, 1);
      i++;
    } else
      break;
  }
  cout << res;
  return 0;
}

```