重排数列--是否存在排列，排列后数组的每两个相邻元素的乘积都是4的倍数

i从0到n-1，是否存在排列，使得a[i]*a[i+1]的值都是4的倍数

import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        int m, n;
        int[] arr;
        Scanner sc = new Scanner(System.in);
        m = sc.nextInt();
        for (int i = 0; i < m; i++) {
            n = sc.nextInt();
            arr = new int[n];
            //记录能被4整除的个数,能被2整除的个数以及奇数的个数
            int c4 = 0, c2 = 0, c1 = 0;
            for (int j = 0; j < n; j++) {
                arr[j] = Integer.parseInt(sc.next());
                if (arr[j] % 4 == 0) c4++;
                else if (arr[j] % 2 == 0) c2++;
                else c1++;