#include <bits/stdc++.h>
using namespace std;
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
template <typename T, typename V>
void __print(const pair<T, V> &x) {
  cerr << '{';
  __print(x.first);
  cerr << ',';
  __print(x.second);
  cerr << '}';
}
template <typename T>
void __print(const T &x) {
  int f = 0;
  cerr << '{';
  for (auto &i : x) cerr << (f++ ? "," : ""), __print(i);
  cerr << "}";
}
void _print() { cerr << "]\n"; }
template <typename T, typename... V>
void _print(T t, V... v) {
  __print(t);
  if (sizeof...(v)) cerr << ", ";
  _print(v...);
}
void file_io();
void PLAY();
long long power(long long b, long long n, long long MOD);
long long findlcm(vector<int> arr, int n);
int gcd(int a, int b);
long long max_subarray_sum(vector<int> A);
int main() {
  int n;
  string s;
  cin >> n >> s;
  int cnt1, cnt2;
  cnt1 = cnt2 = 0;
  for (char c : s) {
    if (c == '(')
      cnt1++;
    else
      cnt2++;
  }
  if (cnt1 != cnt2) return cout << "No", 0;
  int f = 0;
  stack<int> st;
  for (char c : s) {
    if (c == '(')
      st.push('(');
    else {
      if (st.empty()) {
        if (f)
          return cout << "No", 0;
        else
          f++;
      } else {
        st.pop();
      }
    }
  }
  cout << "Yes";
}
void file_io() {
  freopen("input.txt", "r", stdin);
  freopen("output.txt", "w", stdout);
}
void PLAY() {
  ios_base::sync_with_stdio(false);
  cin.tie(0), cout.tie(0);
}
long long max_subarray_sum(vector<int> A) {
  int n = A.size();
  vector<long long> local(n);
  long long global = A[0];
  local[0] = A[0];
  for (int i = 1; i < n; i++) {
    local[i] = max(local[i - 1] + A[i], (long long)(A[i]));
    global = max(global, local[i]);
  }
  return global;
}
long long power(long long b, long long n, long long MOD) {
  if (n < 0) return cerr << "n must be non-negative\n", 0;
  if (n == 0) return 1;
  if (n == 1) return b % MOD;
  if (n % 2 == 0) {
    b %= MOD;
    b *= b;
    b %= MOD;
    return power(b, n / 2, MOD) % MOD;
  }
  b %= MOD;
  return ((b) * (power(b * b, --n / 2, MOD) % MOD)) % MOD;
}
long long findlcm(vector<int> arr, int n) {
  long long ans = arr[0];
  for (int i = 1; i < n; i++) ans = (((arr[i] * ans)) / (gcd(arr[i], ans)));
  return ans;
}
int gcd(int a, int b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
