#include <bits/stdc++.h>
using namespace std;
template <class T>
inline T bigMod(T p, T e, T M) {
  long long ret = 1;
  for (; e > 0; e >>= 1) {
    if (e & 1) ret = (ret * p) % M;
    p = (p * p) % M;
  }
  return (T)ret;
}
template <class T>
inline T modInverse(T a, T M) {
  return bigMod(a, M - 2, M);
}
template <class T>
inline T gcd(T a, T b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
template <class T>
inline T lcm(T a, T b) {
  a = abs(a);
  b = abs(b);
  return (a / gcd(a, b)) * b;
}
template <class T>
inline string int2String(T a) {
  ostringstream str;
  str << a;
  return str.str();
}
long long string2int(string a) {
  stringstream str(a);
  long long b;
  str >> b;
  return b;
}
template <class T>
inline void read(T& r) {
  r = 0;
  int f = 1;
  char ch = getchar();
  while (ch < '0' or ch > '9') {
    f = (ch == '-' ? -1 : 1), ch = getchar();
  }
  while (ch >= '0' and ch <= '9') {
    r = r * 10 + ch - '0', ch = getchar();
  }
  r *= f;
}
const int dr[] = {0, 1, 0, -1, -1, 1, 1, -1, -2, -2, 2, 2, -1, -1, 1, 1};
const int dc[] = {1, 0, -1, 0, 1, 1, -1, -1, -1, 1, -1, 1, -2, 2, -2, 2};
string str[110];
int main() {
  int n;
  scanf("%d", &n);
  for (int i = int(0); i < int(n); i++) cin >> str[i];
  bool f = true;
  for (int i = int(0); i < int(n); i++) {
    for (int j = int(0); j < int(n); j++) {
      if (str[i][j] != '#') {
        if (str[i + 1][j - 1] != '#' && j - 1 >= 0 && str[i + 1][j] != '#' &&
            (i + 1 < n) && str[i + 2][j] != '#' && (i + 2) < n &&
            str[i + 1][j + 1] != '#' && j + 1 < n) {
          str[i][j] = '#';
          str[i + 1][j] = '#';
          str[i + 2][j] = '#';
          str[i + 1][j + 1] = '#';
          str[i + 1][j - 1] = '#';
        } else {
          f = false;
        }
      }
    }
  }
  if (f)
    cout << "YES" << endl;
  else
    cout << "NO" << endl;
  return 0;
}
