#include <bits/stdc++.h>
using namespace std;
void adskiy_razgon() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
}
const int MAX = 2e5 + 7;
const int MOD = 1e+9 + 7;
const long long INF = 1e+18 + 7;
int nod(int a, int b) {
  if (a == 0 || b == 0) {
    return 0;
  } else if (a == b) {
    return a;
  } else if (a > b) {
    return nod(a - b, b);
  } else {
    return nod(a, b - a);
  }
}
int nok(int a, int b) { return a * b / nod(a, b); }
void sp(int a, double b) { cout << fixed << setprecision(a) << b; }
vector<char> v;
set<char> k;
int main() {
  adskiy_razgon();
  string s;
  cin >> s;
  string f;
  for (int i = (0); i < (s.size()); i++) {
    if (s[i] != '/') {
      v.push_back(s[i]);
    } else {
      if (!v.empty()) {
        cout << '/';
        for (int j = (0); j < (v.size()); j++) {
          cout << v[j];
        }
        v.clear();
      }
    }
    k.insert(s[i]);
  }
  if (!v.empty()) {
    cout << '/';
    for (int j = (0); j < (v.size()); j++) {
      cout << v[j];
    }
    v.clear();
  }
  if (k.size() == 1) {
    cout << s[0];
  }
  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;
void adskiy_razgon() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
}
const int MAX = 2e5 + 7;
const int MOD = 1e+9 + 7;
const long long INF = 1e+18 + 7;
int nod(int a, int b) {
  if (a == 0 || b == 0) {
    return 0;
  } else if (a == b) {
    return a;
  } else if (a > b) {
    return nod(a - b, b);
  } else {
    return nod(a, b - a);
  }
}
int nok(int a, int b) { return a * b / nod(a, b); }
void sp(int a, double b) { cout << fixed << setprecision(a) << b; }
vector<char> v;
set<char> k;
int main() {
  adskiy_razgon();
  string s;
  cin >> s;
  string f;
  for (int i = (0); i < (s.size()); i++) {
    if (s[i] != '/') {
      v.push_back(s[i]);
    } else {
      if (!v.empty()) {
        cout << '/';
        for (int j = (0); j < (v.size()); j++) {
          cout << v[j];
        }
        v.clear();
      }
    }
    k.insert(s[i]);
  }
  if (!v.empty()) {
    cout << '/';
    for (int j = (0); j < (v.size()); j++) {
      cout << v[j];
    }
    v.clear();
  }
  if (k.size() == 1) {
    cout << s[0];
  }
  return 0;
}

```