use proconio::marker::*;
use proconio::*;
use std::collections::*;

type Map<K, V> = BTreeMap<K, V>;
type Set<T> = BTreeSet<T>;
type Deque<T> = VecDeque<T>;
type Heap<T> = BinaryHeap<T>;

const MOD: u64 = 998_244_353;

fn main() {
    input! {
        n: usize,
        s: Bytes,
    }

    if n & 1 == 0 && s.iter().filter(|c| **c == b'(').count() == n / 2 {
        println!("Yes");
    } else {
        println!("No");
    }
}