Help me in solving XORPROD problem

help
,
1

My issue

My code

#include<bits/stdc++.h>
using namespace std;
#include <bitset>
#define ll long long int
#define vll vector<long long int>
#define pb push_back
#define maxm *max_element(v.begin(), v.end())
int mod = 1e9+7;



void solve(){
ll n,ans=1,cnt1=0; cin>>n;
vll v(n),v1;
for(int i=0;i<n;i++){
   cin>>v[i];
   ans=(ans*v[i])%998244353;
   if(v[i]%2==0)v1.push_back(v[i]);
   if(v[i]==1)cnt1++;
}
sort(v1.rbegin(),v1.rend());
ll p= v1.size();
for(int i=0;i<min(p,cnt1);i++){
   ans=(ans/v1[i])*(v1[i]+1)%998244353;
}
cout<<ans<<endl;
}
   
 

int main(){
 ios_base::sync_with_stdio(false);
 cin.tie(NULL);
 int t=1;
 cin>>t;
 while(t--){
    solve();
 }
}

Problem Link: XORPROD Problem - CodeChef