Just a Graph

You are given an undirected graph with $N$ nodes (numbered $1$ through $N$). For each valid $i$, the $i$-th node has a weight $W_i$. Also, for each pair of nodes $i$ and $j$, there is an edge connecting these nodes if $j - i \neq W_j - W_i$. Find the number of connected components in this graph. ### Input - The first line of the input contains a single integer $T$ denoting the number of test cas