#include <bits/stdc++.h>
using namespace std;
int main() {
  int i, j, t, tt, ii, jj;
  long long n, k, p, k1, need, d1, d2, x1, x2, x3, mid, min, max;
  bool flag;
  scanf("%d", &tt);
  for (t = 1; t <= tt; t++) {
    cin >> n >> k >> d1 >> d2;
    flag = false;
    for (i = 1; i <= 2; i++)
      for (j = 1; j <= 2; j++) {
        if (i == 1)
          ii = 1;
        else
          ii = -1;
        if (j == 1)
          jj = 1;
        else
          jj = -1;
        k1 = k + ii * d1 + jj * d2;
        if (k1 % 3 == 0) {
          x2 = k1 / 3;
          x1 = x2 - ii * d1;
          x3 = x2 - jj * d2;
          max = x1;
          if (x2 > max) max = x2;
          if (x3 > max) max = x3;
          min = x1;
          if (x2 < min) min = x2;
          if (x3 < min) min = x3;
          if (min >= 0) {
            mid = x1 + x2 + x3 - max - min;
            need = max - min + max - mid;
            if (n - k >= need) {
              p = n - k - need;
              if (p % 3 == 0) flag = true;
            }
          }
        }
      }
    if (flag)
      printf("yes\n");
    else
      printf("no\n");
  }
}
