My code is producing wrong output for a specific test case. What could be the problem with my code to fail a particular test case and how to solve it?

Question - You are given the array a consisting of n positive (greater than zero) integers.

In one move, you can choose two indices i and j (i≠j) such that the absolute difference between ai and aj is no more than one (|ai−aj|≤1) and remove the smallest of these two elements. If two elements are equal, you can remove any of them (but exactly one).

Your task is to find if it is possible to obtain the array consisting of only one element using several (possibly, zero) such moves or not.

You have to answer t independent test cases.

Input - The first line of the input contains one integer t (1≤t≤1000) — the number of test cases. Then t test cases follow.

The first line of the test case contains one integer n (1≤n≤50) — the length of a. The second line of the test case contains n integers a1,a2,…,an (1≤ai≤100), where ai is the i-th element of a.

Output - For each test case, print the answer: "YES" if it is possible to obtain the array consisting of only one element using several (possibly, zero) moves described in the problem statement, or "NO" otherwise.

Code Forces question link - https://codeforces.com/problemset/problem/1399/A

My code -

int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);

    int t;
    cin >> t;
    while(t--){
        int a,count=0;
        cin >> a;
        int arr[a];
        for(int i=0;i<a;i++){
            cin >> arr[i];
        }
        for(int i=0;i<a;i++){
            if((arr[i]+1)==arr[i+1] || arr[i]==arr[i+1]){
                count++;
            }
        }
        if((a-count)>1){
            cout << "NO" << endl;
        }else{cout << "YES" << endl;}
    }
}

The code produces the correct output for all test cases except when the input is - 1 1 1 2 4. It produces YES while the output should be NO and even my code seems to work that way in producing NO. What could be the problem here and how do I fix it?