#include <bits/stdc++.h>
using namespace std;
long long mod = 1e9 + 7;
void ans(bool b) { cout << (b ? "Yes" : "No") << endl; }
void ans2(bool b) { cout << (b ? "YES" : "NO") << endl; }
template <typename T>
inline bool chmax(T& a, T b) {
  if (a < b) a = b;
  return a < b;
}
template <typename T>
inline bool chmin(T& a, T b) {
  if (b < a) a = b;
  return b < a;
}
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T& val) {
  fill((T*)array, (T*)(array + N), val);
}
template <typename T>
void vdeb(T v) {
  cout << "#vector set debug" << endl;
  for (auto vv : v) cout << vv << " ";
  cout << endl;
}
template <typename T1, typename T2>
void adeb(T1 arr[], T2 n) {
  cout << "#adebug" << endl;
  for (int i = 0; i <= n; i++) cout << arr[i] << " ";
  cout << endl;
}
template <typename T1>
void mdeb(T1 mp) {
  cout << "#map pair debug" << endl;
  for (auto const& m : mp) cout << m.first << " " << m.second << endl;
}
int dx[] = {1, 0, -1, 0, 1, -1, 1, -1};
int dy[] = {0, 1, 0, -1, 1, -1, -1, 1};
class ACollectingCoins {
 public:
  void solve(std::istream& in, std::ostream& out) {
    long long a, b, c, t, n;
    in >> t;
    for (long long i = 0; i < t; i++) {
      in >> a >> b >> c >> n;
      vector<long long> v{a, b, c};
      sort(v.begin(), v.end());
      long long mx = v[2];
      long long cnt = mx - v[1] + mx - v[0];
      if (n >= cnt && (n - cnt) % 3 == 0)
        out << "YES" << endl;
      else
        out << "NO" << endl;
    }
  }
};
int main() {
  ACollectingCoins solver;
  std::istream& in(std::cin);
  std::ostream& out(std::cout);
  solver.solve(in, out);
  return 0;
}
