#include <bits/stdc++.h>
using namespace std;
const double pi = acos(-1.0);
int main() {
  int i, j;
  char s[105];
  gets(s);
  int len = strlen(s);
  bool f = false;
  int last = -1;
  for (i = len - 1; i >= 0; i--) {
    if (s[i] != '/') {
      last = i;
      break;
    }
  }
  if (last == -1) {
    for (i = 0; i < len; i++) {
      if (s[i] != '/') {
        printf("%c", s[i]);
        f = false;
      } else if (!f) {
        printf("%c", s[i]);
        f = true;
      }
    }
  } else {
    for (i = 0; i <= last; i++) {
      if (s[i] != '/') {
        printf("%c", s[i]);
        f = false;
      } else if (!f) {
        printf("%c", s[i]);
        f = true;
      }
    }
    cout << endl;
  }
  return 0;
}

### Prompt

Please formulate 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;
const double pi = acos(-1.0);
int main() {
  int i, j;
  char s[105];
  gets(s);
  int len = strlen(s);
  bool f = false;
  int last = -1;
  for (i = len - 1; i >= 0; i--) {
    if (s[i] != '/') {
      last = i;
      break;
    }
  }
  if (last == -1) {
    for (i = 0; i < len; i++) {
      if (s[i] != '/') {
        printf("%c", s[i]);
        f = false;
      } else if (!f) {
        printf("%c", s[i]);
        f = true;
      }
    }
  } else {
    for (i = 0; i <= last; i++) {
      if (s[i] != '/') {
        printf("%c", s[i]);
        f = false;
      } else if (!f) {
        printf("%c", s[i]);
        f = true;
      }
    }
    cout << endl;
  }
  return 0;
}

```