Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

implementation

sortings

*1000

No tag edit access

The problem statement has recently been changed. View the changes.

×
A1. Balanced Shuffle (Easy)

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputA parentheses sequence is a string consisting of characters "(" and ")", for example "(()((".

A balanced parentheses sequence is a parentheses sequence which can become a valid mathematical expression after inserting numbers and operations into it, for example "(()(()))".

The balance of a parentheses sequence is defined as the number of opening parentheses "(" minus the number of closing parentheses ")". For example, the balance of the sequence "(()((" is 3.

A balanced parentheses sequence can also be defined as a parentheses sequence with balance 0 such that each of its prefixes has a non-negative balance.

We define the balanced shuffle operation that takes a parentheses sequence and returns a parentheses sequence as follows: first, for every character of the input sequence, we compute the balance of the prefix of the sequence before that character and write those down in a table together with the positions of the characters in the input sequence, for example:

Prefix balance | 0 | 1 | 2 | 1 | 2 | 3 | 2 | 1 |

Position | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 |

Character | ( | ( | ) | ( | ( | ) | ) | ) |

Then, we sort the columns of this table in increasing order of prefix balance, breaking ties in decreasing order of position. In the above example, we get:

Prefix balance | 0 | 1 | 1 | 1 | 2 | 2 | 2 | 3 |

Position | 1 | 8 | 4 | 2 | 7 | 5 | 3 | 6 |

Character | ( | ) | ( | ( | ) | ( | ) | ) |

The last row of this table forms another parentheses sequence, in this case "()(()())". This sequence is called the result of applying the balanced shuffle operation to the input sequence, or in short just the balanced shuffle of the input sequence.

You are given a balanced parentheses sequence. Print its balanced shuffle.

Input

The only line of input contains a string $$$s$$$ consisting only of characters "(" and ")". This string is guaranteed to be a non-empty balanced parentheses sequence with its length not exceeding $$$500\,000$$$.

Output

Print the parentheses sequence $$$t$$$ — the balanced shuffle of $$$s$$$.

Example

Input

(()(()))

Output

()(()())

Codeforces (c) Copyright 2010-2024 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Jun/13/2024 03:06:36 (j1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|