#include <bits/stdc++.h>
using namespace std;
bool visited[1002];
vector<int> adj[1002];
int Distance[1002] = {0};
queue<int> q;
void bfs(int s) {
  visited[s] = true;
  Distance[s] = 0;
  q.push(s);
  while (!q.empty()) {
    int s = q.front();
    q.pop();
    for (auto u : adj[s]) {
      if (visited[u]) {
        continue;
      }
      visited[u] = true;
      Distance[u] = Distance[s] + 1;
      q.push(u);
    }
  }
}
void solve() {
  int n;
  cin >> n;
  if (n % 4) {
    cout << "NO\n";
  } else {
    cout << "YES\n";
  }
}
int main() {
  ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
  int t;
  cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}
