import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {
    static boolean y;
    static void combinationUtil(int arr[], int n, int r, int index,
                                int data[], int i)
    {
        int x=0;
        if (index == r)
        {
            for (int j=0; j<r; j++)
                x +=data[j]*Math.pow(10,r-j-1);
            if (x%3==0)
                y=true;
            
        return;
        }
        if (i >= n)
        return;
 
        data[index] = arr[i];
        combinationUtil(arr, n, r, index+1, data, i+1);
 
        combinationUtil(arr, n, r, index, data, i+1);
    }
    static void printCombination(int arr[], int n, int r)
    {
        
        int data[]=new int[r];
 
       
        combinationUtil(arr, n, r, 0, data, 0);
    }


    static String canConstruct(int[] a) {
        printCombination(a,a.length,a.length);
        if(y==true){
            y=false;
            return "Yes";
        }
        else
            y=false;
            return "No";
        
    }

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int t = in.nextInt();
        List al = new ArrayList();
        for(int a0 = 0; a0 < t; a0++){
            int n = in.nextInt();
            int[] a = new int[n];
            for(int a_i = 0; a_i < n; a_i++){
                a[a_i] = in.nextInt();
                for (int j=0 ;j<String.valueOf(a[a_i]).length();j++){
                    
                    al.add(a[a_i]%10);
                    a[a_i] /=10;
                }
            }
            int count[] = new int[al.size()]; 
            	   for (int i =0; i < al.size(); i++)
            count[i] = (int)al.get(i);
            String result = canConstruct(count);
            System.out.println(result);
        }
        in.close();
    }
}