Neat Brackets

First Step Contest 2
Limits 1s, 512 MB

Given a sequence of opening and closing parentheses ("(" and ")") you will have to determine if it is a valid one.

A sequence of parentheses is considered valid if every opened parenthesis has a closing parenthesis appearing after it. And, there are no unpaired parenthesis in the sequence.

Input

The input will contain a string of opening and closing parentheses. The string will be no longer than 25 characters.

Output

Print "Yes" if the input string contains a valid sequence of parentheses. Otherwise, print "No".

Samples

InputOutput
((()(
No
InputOutput
((()()))
Yes

Submit

Login to submit.

Contributors

Statistics

82% Solution Ratio
YouKnowWhoEarliest, Mar '19
YouKnowWhoFastest, 0.0s
Cloud_Lightest, 0 B
AnotherTwinkleShortest, 65B
Toph uses cookies. By continuing you agree to our Cookie Policy.