#include <bits/stdc++.h>
using namespace std;
int main() {
  char cad[100000];
  gets(cad);
  int i, j, a = strlen(cad), cont = 0;
  for (j = 0; j < a; j++) {
    if (cad[j] == '/') {
      cont = cont + 1;
    }
  }
  if (cont == a) {
    cout << "/";
    return 0;
  }
  j = 0;
  while (j < a) {
    if (cad[j] != '/') {
      cout << "/";
      for (j = i; j < a; j++) {
        if (cad[j] != '/') {
          cout << cad[j];
        } else {
          i = j;
          break;
        }
      }
    }
    j++;
    i = j;
  }
  return 0;
}

### Prompt

Develop a solution in cpp to the problem described below:

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() {
  char cad[100000];
  gets(cad);
  int i, j, a = strlen(cad), cont = 0;
  for (j = 0; j < a; j++) {
    if (cad[j] == '/') {
      cont = cont + 1;
    }
  }
  if (cont == a) {
    cout << "/";
    return 0;
  }
  j = 0;
  while (j < a) {
    if (cad[j] != '/') {
      cout << "/";
      for (j = i; j < a; j++) {
        if (cad[j] != '/') {
          cout << cad[j];
        } else {
          i = j;
          break;
        }
      }
    }
    j++;
    i = j;
  }
  return 0;
}

```