Practice on Toph

Participate in exhilarating programming contests, solve unique algorithm and data structure challenges and be a part of an awesome community.

Neat Brackets

Limits: 1s, 512 MB

Given a sequence of opening (() and closing ()) parentheses 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
((()()))
Yes

Discussion