time limit per test: 0.25 sec. memory limit per test: 131072 KB
input: standard output: standard
There is a correct brackets sequence. It's length doesn't exceed 10000 symbols. Your task is to find next (in lexicographic order) correct brackets sequence with the same length. You may assume that '(' < ')'.
The first line of the input contains correct brackets sequence. There are only '(' and ')' symbols in the input.
Write sought sequence in the single line of the output or 'No solution' if solution doesn't exist.
Saratov ST team Spring Contest #1
Codeforces (c) Copyright 2010-2019 Mike Mirzayanov