#include <bits/stdc++.h>
using namespace std;
int main() {
  stack<char> sl;
  queue<char> q;
  string s;
  int i;
  cin >> s;
  for (i = 0; i < s.size(); i++) {
    if (q.empty() || s[i] != '/') {
      q.push(s[i]);
      if (!sl.empty()) {
        sl.pop();
      }
      if (s[i] == '/') {
        sl.push(s[i]);
      }
    } else if (sl.empty() && s[i] == '/') {
      q.push(s[i]);
      sl.push(s[i]);
    } else if (!sl.empty() && s[i] == '/')
      continue;
  }
  int l = q.size();
  if (l == 1 && q.front() == '/') {
    cout << "/";
    return 0;
  }
  for (i = 0; i < l; i++) {
    if (i == l - 1 && q.front() == '/')
      continue;
    else {
      cout << q.front();
      q.pop();
    }
  }
}

### 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;
int main() {
  stack<char> sl;
  queue<char> q;
  string s;
  int i;
  cin >> s;
  for (i = 0; i < s.size(); i++) {
    if (q.empty() || s[i] != '/') {
      q.push(s[i]);
      if (!sl.empty()) {
        sl.pop();
      }
      if (s[i] == '/') {
        sl.push(s[i]);
      }
    } else if (sl.empty() && s[i] == '/') {
      q.push(s[i]);
      sl.push(s[i]);
    } else if (!sl.empty() && s[i] == '/')
      continue;
  }
  int l = q.size();
  if (l == 1 && q.front() == '/') {
    cout << "/";
    return 0;
  }
  for (i = 0; i < l; i++) {
    if (i == l - 1 && q.front() == '/')
      continue;
    else {
      cout << q.front();
      q.pop();
    }
  }
}

```