#include <bits/stdc++.h>
using namespace std;
using ii = pair<int, int>;
#define ff first
#define ss second

char s[1000010];

bool comp(ii a, ii b){
	return a.ss > b.ss;
}
int32_t main(){
	int n;
	scanf("%d", &n);
	vector<ii> v1, v2;
	for(int z=0; z<n; ++z){
		scanf("%s", s);
		int q = 0;
		int tam = int(strlen(s));
		int a=0, b=0;
		for(int i = 0; i<tam; ++i){
			if(s[i]==')'){
				if(q>0) --q;
				else ++b;
			}
			else ++q;
		}
		a = q;
		if(a>b) v1.emplace_back(a, b); 
		else v2.emplace_back(a, b); 
	}
	sort(v1.begin(), v1.end(), comp);
	sort(v2.begin(), v2.end());
	int q = 0;
	for(auto x:v2){
		int a = x.ff;
		int b = x.ss;
		if(a>q){
			printf("No\n");
			return 0;
		}
		q-=a;
		q+=b;
	}
	for(auto x:v1){
		int a = x.ff;
		int b = x.ss;
		if(a>q){
			printf("No\n");
			return 0;
		}
		q-=a;
		q+=b;
	}
	if(q==0)
		printf("Yes\n");
	else
		printf("No\n");
}

#include "bits/stdc++.h"
using namespace std;
#ifndef LOCAL
#define endl '\n'
#endif

#define fr(i, a, b) for(int i = a; i <= b; i++)
#define rf(i, a, b) for(int i = a; i >= b; i--)
#define pf push_front
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) (int)x.size()
#define lb lower_bound
#define ub upper_bound

typedef long long ll;
typedef long double f80;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

int pct(int x) { return __builtin_popcount(x); }
int pct(ll x) { return __builtin_popcountll(x); }
int bt(int x) { return 31 - __builtin_clz(x); } // floor(log2(x))
int bt(ll x) { return 63 - __builtin_clzll(x); } // floor(log2(x))
int cdiv(int a, int b) { return a / b + !(a < 0 || a % b == 0); }
ll cdiv(ll a, ll b) { return a / b + !(a < 0 || a % b == 0); }
int nxt_C(int x) { int c = x & -x, r = x + c; return (((r ^ x) >> 2) / c) | r; }
ll nxt_C(ll x) { ll c = x & -x, r = x + c; return (((r ^ x) >> 2) / c) | r; }

vector<int> get_bits(int mask) {
	vector<int> bb;
	while(mask) { int b = bt(mask); bb.pb(b); mask ^= (1 << b); }
	reverse(all(bb));
	return bb;
}

int get_mask(vector<int> v) {
	int mask = 0;
	for(int x : v) { mask ^= (1 << x); }
	return mask;
}

template<typename T>
void uniq(vector<T> &v) { sort(all(v)); v.resize(unique(all(v)) - v.begin()); }

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

ll rand(ll l, ll r){
	uniform_int_distribution<ll> uid(l, r);
	return uid(rng);
}

void sc() {}

template <typename Head, typename... Tail>
void sc(Head &H, Tail &... T) { cin >> H; sc(T...); }

#ifdef LOCAL
#define debug(...) cerr << "[L:" << __LINE__ << "][" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

// #ifndef LOCAL
// string to_string(__int128 x) {
// 	string s = "";
// 	bool neg = 0;
// 	if(x < 0) { s += "-"; neg = 1; x = -x; }
// 	if(!x) s += '0';
// 	while(x) {
// 		int rem = x % 10;
// 		s += to_string(rem);
// 		x /= 10;
// 	}
// 	reverse(s.begin() + neg, s.end());
// 	return s;
// }
// #endif

const int mod = 1e9 + 7; // 998244353;

int pwr(int a,ll b) {
	int ans = 1;
	while(b) {
		if(b & 1) ans = (ans * 1LL * a) % mod;
		a = (a * 1LL * a) % mod;
		b >>= 1;
	}
	return ans;
}

/*
	Lookout for overflows!!
	Check array sizes!!
	Clear before test cases!!
	Use the correct modulo!!
	Check for corner cases!!
	Are you forgetting something?!
	Read problem statement carefully!!!
*/

const int N = 2005;
int pre[3][N][N];
char a[N][N];

int get(int b,int r1,int c1,int r2,int c2) {
    if(r1 > r2 || c1 > c2) return 0;
    r1--, c1--;
    return pre[b][r2][c2] - pre[b][r1][c2] - pre[b][r2][c1] + pre[b][r1][c1];
}

void solve() {
    int n, m, q;
    sc(n, m, q);
    fr(i, 0, n + 1) {
        fr(j, 0, m + 1) {
            a[i][j] = '0';
        }
    }
    fr(i, 1, n) {
        fr(j, 1, m) {
            sc(a[i][j]);
            pre[0][i][j] = pre[0][i - 1][j] + pre[0][i][j - 1] - pre[0][i - 1][j - 1] + (a[i][j] == '1');
            pre[1][i][j] = pre[1][i - 1][j] + pre[1][i][j - 1] - pre[1][i - 1][j - 1] + (a[i][j] == '1' && a[i - 1][j] == '1');
            pre[2][i][j] = pre[2][i - 1][j] + pre[2][i][j - 1] - pre[2][i - 1][j - 1] + (a[i][j] == '1' && a[i][j - 1] == '1');
            debug(i, j, pre[0][i][j]);        
        }
    }
    fr(i, 1, q) {
        int r1, c1, r2, c2;
        sc(r1, c1, r2, c2);
        int g1 = get(0, r1, c1, r2, c2);
        int g2 = get(1, r1 + 1, c1, r2, c2);
        int g3 = get(2, r1, c1 + 1, r2, c2);
        debug(g1, g2, g3);
        cout << g1 - g2 - g3 << endl;
    }
}

int main() {
	ios :: sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int t = 1;
	// cin >> t;
	for(int tt = 1; tt <= t; tt++) {
		solve();
	}
	return 0;
}