#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll LINF = 1001002003004005006ll;
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
template <class T>
bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
bool chmin(T &a, const T &b) {
  if (b < a) {
    a = b;
    return 1;
  }
  return 0;
}
void solve() {
  int a, b, c, n;
  cin >> a >> b >> c >> n;
  if ((a + b + c + n) % 3 == 0) {
    int sum = a + b + c + n;
    if (a > sum / 3 or b > sum / 3 or c > sum / 3)
      cout << "NO" << endl;
    else
      cout << "YES" << endl;
  } else
    cout << "NO" << endl;
}
signed main() {
  cin.tie(0);
  ios::sync_with_stdio(0);
  int q;
  cin >> q;
  while (q--) solve();
  return 0;
}
