Package for this problem was not updated by the problem writer or Codeforces administration after we’ve upgraded the judging servers. To adjust the time limit constraint, solution execution time will be multiplied by 2. For example, if your solution works for 400 ms on judging servers, then value 800 ms will be displayed and used to determine the verdict.

The following languages are only available languages for the problems from the contest

VK Cup 2012 Wild-card Round 1:

- Factor

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-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.

No tag edit access

J. Brackets

time limit per test

3 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputA sequence of brackets is called balanced if one can turn it into a valid math expression by adding characters "+" and "1". For example, sequences "(())()", "()" and "(()(()))" are balanced, while ")(", "(()" and "(()))(" are not.

You are given a string which consists of opening and closing round brackets. Check whether it is a balanced bracket sequence.

Input

The only line of input contains a string between 1 and 100 characters long, inclusive. Each character in the string will be "(" or ")".

Output

Output "YES" if the bracket sequence is balanced, and "NO" otherwise (quotes for clarity only).

Examples

Input

(()(()))()

Output

YES

Input

())()

Output

NO

Codeforces (c) Copyright 2010-2018 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Feb/25/2018 02:53:40 (d1).

Desktop version, switch to mobile version.

User lists

Name |
---|