#include <bits/stdc++.h>
using namespace std;
long long power(long long, long long);
long long ncr(long long, long long);
void fact();
long long mul(long long a, long long b);
int mod = 10;
const long long N = 100002LL;
long long fac[N + 2];
long long inv[N + 2];
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  {
    stack<char> p;
    long long n;
    cin >> n;
    long long cnt = 0;
    string s;
    cin >> s;
    for (long long i = 0; i < n; i++) {
      if (s[i] == '(')
        p.push(s[i]);
      else if (s[i] == ')') {
        if (p.empty()) {
          cnt++;
        } else
          p.pop();
      }
    }
    if ((p.size() == 1 && cnt == 1) || (p.size() == 0 && cnt == 0))
      cout << "YES";
    else
      cout << "NO\n";
  }
  return 0;
}
long long mul(long long a, long long b) { return ((a) * (b)) % mod; }
long long power(long long a, long long n) {
  long long res = 1;
  while (n) {
    if (n & 1) res = mul(res, a);
    n >>= 1;
    a = mul(a, a);
  }
  return res;
}
void fact() {
  inv[0] = fac[0] = 1;
  for (long long i = 1; i < N; i++) {
    fac[i] = mul(fac[i - 1], i);
    inv[i] = power(fac[i], mod - 2);
  }
}
long long ncr(long long r, long long n) {
  if (r > n) return 0;
  long long e = fac[n];
  e = mul(e, inv[r]);
  e = mul(e, inv[n - r]);
  return e;
}
