#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using ll = long long;
#define rep(i, s, t) for (ll i = s; i < (ll)(t); i++)
#define all(x) begin(x), end(x)

template <typename T> bool chmin(T& x, T y) {
	return x > y ? (x = y, true) : false;
}
template <typename T> bool chmax(T& x, T y) {
	return x < y ? (x = y, true) : false;
}

struct IOST {
	IOST() {
		ios::sync_with_stdio(false);
		cin.tie(nullptr);
		cout << fixed << setprecision(20);
	}
} IOST;

using mint = atcoder::modint998244353;

void solve() {
	int n;
	cin >> n;
	vector<string> s(n);
	rep(i, 0, n) cin >> s[i];
	vector<int> ct(2);
	rep(i, 0, n) rep(j, 0, n) ct[s[i][j] == '#']++;
	ct[0] %= 2;
	if ((n & 1) || ct[0] == 0) cout << "Yes\n";
	else cout << "No\n";
}

int main() {
	int t = 1;
	// cin>>t;
	rep(i, 0, t) solve();
}