import java.math.*; import java.util.*; import org.omg.CORBA.PUBLIC_MEMBER; public class Main { static int n; static int[] a; static int[] b; static int now=0; static int ans=0; static ArrayList aa = new ArrayList<>(); static ArrayList bb = new ArrayList<>(); public static void dfsa(int nn){ if(nn== ((1<>i & 1) ==0){ nn+= 1<bb.get(i)) count++; } if(count>(n/2)){ ans++; } } for(int i=0;i>i & 1) ==0){ nnn+= 1<