#include <bits/stdc++.h>
using namespace std;
using namespace std::chrono;
long long M1 = 1000000007;
long long M2 = 67280421310721;
long long M3 = 998244353;
long long INF = 1e18;
long long power(long long a, long long b, long long mod) {
  long long ans = 1;
  long long prod = a;
  while (b) {
    if (b % 2) ans = (ans * prod) % mod;
    prod = (prod * prod) % mod;
    b /= 2;
  }
  return ans;
}
long long inv(long long a, long long mod) { return power(a, mod - 2, mod); }
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
void solve() {
  long long n;
  cin >> n;
  string s;
  cin >> s;
  long long i;
  long long c1 = 0, c2 = 0;
  for (i = 0; i <= n - 1; i++) {
    if (s[i] == '(')
      c1++;
    else
      c2++;
  }
  if (c1 != c2) {
    cout << "No\n";
    return;
  }
  long long val = 0;
  for (i = 0; i <= n - 1; i++) {
    if (s[i] == ')')
      val--;
    else
      val++;
    if (val < -1) {
      cout << "No\n";
      return;
    }
  }
  cout << "Yes\n";
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout << fixed << setprecision(10);
  auto start = high_resolution_clock::now();
  long long i, t = 1;
  for (i = 1; i <= t; i++) solve();
  auto stop = high_resolution_clock::now();
  auto duration = duration_cast<microseconds>(stop - start);
}
