#include <iostream>
#include <vector>
#include <algorithm>

#define MAX_C   (100)
#define MAX_N   (100)

using namespace std;

struct Tree {
    int r, x, y;
    vector<Tree*> children;
    bool operator <(const Tree &rside) const {
        return (r < rside.r);
    }
};

Tree trees[MAX_N];
int longest = 0;

bool enclose(int out, int in) {
    int x = trees[out].x - trees[in].x;
    int y = trees[out].y - trees[in].y;
    int r = trees[out].r - trees[in].r;
    return ((trees[out].r > trees[in].r) && (x*x + y*y < r*r));
}

Tree *makeTree(int n) {
    for(int i = 0; i < n; ++i) {
        for(int j = i + 1; j < n; ++j) {
            if(enclose(j, i)) {
                trees[j].children.push_back(&trees[i]);
                break;
            }
        }
    }

    return &trees[n-1];
}

int height(Tree *root) {
    int h1 = -1, h2 = -1;
    for(Tree *child : root->children) {
        int ch = height(child);
        if(ch >= h1) {
            h2 = h1;
            h1 = ch;
        }
    }

    if(h2 >= 0) {
        longest = max(longest, h1 + h2 + 2);
    }

    return (h1 + 1);
}

int main(void) {
    int nTests, n;
    cin >> nTests;

    while(nTests--) {
        cin >> n;
        for(int i = 0; i < n; ++i) {
            cin >> trees[i].x >> trees[i].y >> trees[i].r;
            trees[i].children.clear();
        }
        sort(trees, trees + n);

        Tree *root = makeTree(n);
        longest = -1;
        int h = height(root);
        cout << max(h, longest) << endl;
    }

    return 0;
}