#include <bits/stdc++.h>
using namespace std;
string path1, path2, slash = "/";
int i, prevstop, start, finish, dirs;
bool onlyslash = 1;
string getdir(int xxxxxx) {
  bool startkn = 0;
  for (int j = prevstop; j < path1.size(); ++j) {
    if (path1[j] != 47) {
      if (!startkn) {
        start = j;
        startkn = 1;
      }
    } else if (startkn)
      if ((path1[j] == 47) || (j + 1 == path1.size())) {
        finish = j;
        prevstop = finish;
        break;
      }
  }
  return path1.substr(start, finish - start);
}
int main() {
  cin >> path1;
  prevstop = 0;
  for (i = prevstop; i < path1.size(); ++i)
    if (path1[i] != 47) onlyslash = 0;
  for (i = prevstop; i < path1.size() - 1; ++i)
    if ((path1[i] != 47) && (path1[i + 1] == 47)) ++dirs;
  if (path1[path1.size() - 1] != 47) ++dirs;
  if (onlyslash)
    cout << "/\n";
  else {
    path2 = slash;
    for (i = 0; i < dirs - 1; ++i) path2 += getdir(1) + slash;
    path2 += getdir(1);
    cout << path2 << "\n";
  }
}

### Prompt

Construct a CPP code solution to the problem outlined:

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;
string path1, path2, slash = "/";
int i, prevstop, start, finish, dirs;
bool onlyslash = 1;
string getdir(int xxxxxx) {
  bool startkn = 0;
  for (int j = prevstop; j < path1.size(); ++j) {
    if (path1[j] != 47) {
      if (!startkn) {
        start = j;
        startkn = 1;
      }
    } else if (startkn)
      if ((path1[j] == 47) || (j + 1 == path1.size())) {
        finish = j;
        prevstop = finish;
        break;
      }
  }
  return path1.substr(start, finish - start);
}
int main() {
  cin >> path1;
  prevstop = 0;
  for (i = prevstop; i < path1.size(); ++i)
    if (path1[i] != 47) onlyslash = 0;
  for (i = prevstop; i < path1.size() - 1; ++i)
    if ((path1[i] != 47) && (path1[i + 1] == 47)) ++dirs;
  if (path1[path1.size() - 1] != 47) ++dirs;
  if (onlyslash)
    cout << "/\n";
  else {
    path2 = slash;
    for (i = 0; i < dirs - 1; ++i) path2 += getdir(1) + slash;
    path2 += getdir(1);
    cout << path2 << "\n";
  }
}

```