#include <stdio.h>

#include <string.h>

int head, tail, size;

char str[100010];

struct Node

{

    int prev, next;

    char c;

} node[100010];

int Insert(int ind, char c)

{

    node[ ++ size].c = c;

    node[size].prev = ind, node[size].next = node[ind].next;

    node[node[ind].next].prev = size, node[ind].next = size;

    return size;

}

void print()

{

    int i = head;

    while (node[i].next != tail)

    {

        i = node[i].next;

        putchar(node[i].c);

    }

    puts("");

    return;

}

int main()

{

    // freopen("O.in", "r", stdin);

    // freopen("O.out", "w", stdout);

    while (~scanf("%s", str))

    {

        int len = strlen(str);

        head = 1, tail = 2, size = 2;

        node[head].next = tail, node[tail].prev = head;

        int ind = head;

        for (int i = 0; i < len; ++ i)

        {

            if (str[i] == '[')

                ind = head;

            else if (str[i] == ']')

                ind = node[tail].prev;

            else

                ind = Insert(ind, str[i]);

        }

        print();

    }

    return 0;

}