#include <bits/stdc++.h>
using namespace std;
bool debug = true;
unsigned long long a[63];
long long Rand(long long l, long long h) {
  return l +
         ((long long)rand() * (RAND_MAX + 1) * (RAND_MAX + 1) * (RAND_MAX + 1) +
          (long long)rand() * (RAND_MAX + 1) * (RAND_MAX + 1) +
          (long long)rand() * (RAND_MAX + 1) + rand()) %
             (h - l + 1);
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  string second;
  cin >> second;
  int cnt = 0;
  string res = "";
  for (int i = 0; i < second.size(); i++) {
    if (second[i] == '/') {
      if (cnt == 0) {
        res += second[i];
      }
      cnt = 1;
    } else {
      res += second[i];
      cnt = 0;
    }
  }
  if (res.size() >= 2 && res[res.size() - 1] == '/') {
    res.erase(res.size() - 1);
  }
  cout << res;
  return 0;
}

### Prompt

Please create a solution in Cpp 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;
bool debug = true;
unsigned long long a[63];
long long Rand(long long l, long long h) {
  return l +
         ((long long)rand() * (RAND_MAX + 1) * (RAND_MAX + 1) * (RAND_MAX + 1) +
          (long long)rand() * (RAND_MAX + 1) * (RAND_MAX + 1) +
          (long long)rand() * (RAND_MAX + 1) + rand()) %
             (h - l + 1);
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  string second;
  cin >> second;
  int cnt = 0;
  string res = "";
  for (int i = 0; i < second.size(); i++) {
    if (second[i] == '/') {
      if (cnt == 0) {
        res += second[i];
      }
      cnt = 1;
    } else {
      res += second[i];
      cnt = 0;
    }
  }
  if (res.size() >= 2 && res[res.size() - 1] == '/') {
    res.erase(res.size() - 1);
  }
  cout << res;
  return 0;
}

```