#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a / gcd(a, b) * b; }
const int mod = 1e9 + 7;
long long binpow(long long a, long long b) {
  long long res = 1;
  while (b > 0)
    if (b & 1) {
      res = (long long)(res * 1ll * a);
      --b;
    } else {
      a = (long long)(a * 1ll * a);
      b >>= 1;
    }
  return (long long)res;
}
vector<vector<int>> g;
vector<bool> used;
vector<long double> ver;
void dfs(int v, int prev) {
  used[v] = true;
  double cnt = 0, sum = 0;
  for (int i = 0; i < g[v].size(); i++) {
    int to = g[v][i];
    if (to == prev) continue;
    dfs(to, v);
    sum += ver[to];
    cnt++;
  }
  if (cnt == 0)
    ver[v] = 0;
  else
    ver[v] = 1 + sum / cnt;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int q;
  cin >> q;
  while (q--) {
    int n;
    cin >> n;
    if (n % 4 == 0) {
      cout << "YES" << endl;
    } else
      cout << "NO" << endl;
  }
  return 0;
}
