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.

Example
Input
//usr///local//nginx/sbin
Output
/usr/local/nginx/sbin

读懂题意就好，英语不好。
代码：
#include <iostream>
#include <cstring>
#include <cstdio>
#include <queue>
#include <algorithm>
#include <cmath>

using namespace std;

int main()
{
    char s[105];
    char t[105];
    scanf("%s",s);
    int i = 0,j = 0,c = 0;
    while(s[i])
    {
        t[j ++] = s[i];
        if(s[i] == '/')
        {
            c ++;
            while(s[i + 1] == '/')i ++;
        }
        i ++;
    }
    if(c > 1)while(t[j - 1] == '/')j --;
    t[j] = '\0';
    printf("%s",t);
}