#include <bits/stdc++.h>
using namespace std;
using namespace std;
int CheckIR(int x1, int y1, int x2, int y2, int x3, int y3) {
  if (x1 == x2 && y1 == y2) return 0;
  if (x1 == x3 && y1 == y3) return 0;
  if (x2 == x3 && y2 == y3) return 0;
  int a = ((x2 - x1) * (x2 - x1) + (y2 - y1) * (y2 - y1));
  int b = ((x3 - x1) * (x3 - x1) + (y3 - y1) * (y3 - y1));
  int c = ((x3 - x2) * (x3 - x2) + (y3 - y2) * (y3 - y2));
  if (a == b + c || b == a + c || c == a + b) return 1;
  return 0;
}
int main() {
  string s;
  cin >> s;
  int len = s.size();
  int i = 0;
  int f = 0;
  while (i < len) {
    while (i < len && s[i] == '/') i++;
    if (i != len || len == 1 || f == 0) cout << "/";
    while (i < len && s[i] != '/') {
      f = 1;
      cout << s[i];
      i++;
    }
  }
  return 0;
}

### 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;
using namespace std;
int CheckIR(int x1, int y1, int x2, int y2, int x3, int y3) {
  if (x1 == x2 && y1 == y2) return 0;
  if (x1 == x3 && y1 == y3) return 0;
  if (x2 == x3 && y2 == y3) return 0;
  int a = ((x2 - x1) * (x2 - x1) + (y2 - y1) * (y2 - y1));
  int b = ((x3 - x1) * (x3 - x1) + (y3 - y1) * (y3 - y1));
  int c = ((x3 - x2) * (x3 - x2) + (y3 - y2) * (y3 - y2));
  if (a == b + c || b == a + c || c == a + b) return 1;
  return 0;
}
int main() {
  string s;
  cin >> s;
  int len = s.size();
  int i = 0;
  int f = 0;
  while (i < len) {
    while (i < len && s[i] == '/') i++;
    if (i != len || len == 1 || f == 0) cout << "/";
    while (i < len && s[i] != '/') {
      f = 1;
      cout << s[i];
      i++;
    }
  }
  return 0;
}

```