#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using LI = long long int;
using LD = long double;
using namespace std;
template <typename T>
using APQUE = priority_queue<T, vector<T>, greater<T>>;
template <typename T>
using DPQUE = priority_queue<T>;

int main() {
    int n;
    cin >> n;
    if (n % 2 == 1) {
        cout << "Yes" << endl;
        return 0;
    }
    vector<string> grid(n);
    rep(i, n) cin >> grid[i];
    int cnt = 0;
    for (auto &row : grid) {
        cnt += count(row.begin(), row.end(), '#');
    }
    if (cnt % 2 == 1) {
        cout << "No" << endl;
    } else {
        cout << "Yes" << endl;
    }
}