#include <bits/stdc++.h>
using namespace std;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  string a, b, s;
  int len = 0, tag = 0;
  vector<string> s2;
  cin >> s;
  len = s.length();
  for (int i = 0; i < len; i++) {
    if (s[i] != '/') {
      a = s[i];
      s2.emplace_back(a);
      tag = 0;
    } else {
      if (tag == 0) {
        a = s[i];
        s2.emplace_back(a);
        tag = 1;
      }
    }
  }
  len = s2.size();
  a = s2.front();
  b = s2.back();
  if (a[0] != '/') {
    cout << '/';
  }
  if (b[0] == '/' && len > 1) {
    s2.pop_back();
  }
  for (auto x : s2) {
    cout << x;
  }
  cout << "\n";
  return 0;
}

### Prompt

Create a solution in CPP for 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;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  string a, b, s;
  int len = 0, tag = 0;
  vector<string> s2;
  cin >> s;
  len = s.length();
  for (int i = 0; i < len; i++) {
    if (s[i] != '/') {
      a = s[i];
      s2.emplace_back(a);
      tag = 0;
    } else {
      if (tag == 0) {
        a = s[i];
        s2.emplace_back(a);
        tag = 1;
      }
    }
  }
  len = s2.size();
  a = s2.front();
  b = s2.back();
  if (a[0] != '/') {
    cout << '/';
  }
  if (b[0] == '/' && len > 1) {
    s2.pop_back();
  }
  for (auto x : s2) {
    cout << x;
  }
  cout << "\n";
  return 0;
}

```