#include<iostream>
#include<cstdio>
#include<string>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<ctime>
#include<queue>
#include<stack>
#include<map>
#include<vector>//好看的头文件们
using namespace std;
string s;
bool f;
stack<int>q; 
int main()
{
	cin>>s;
	for(int i=0;i<s.size()-1;i++)
	{
		if(q.top()=='(')
		{
			f=true;
		}
		if(s[i]=='('||s[i]==')')
		{
			q.push(s[i]);
		}
		if(q.top()==')'&&f)
		{
			q.pop();
			q.pop();
		}
	}
	if(q.empty())
	{
		cout<<"YES";
	}else{
		cout<<"NO";
	}
	return 0;
}