static long visit(int A[], int n, int verbose, long count){
		
	// If verbose mode = 3, print all the possible combinations
	   if (verbose == 3) {
			 for(int i = 1; i <= n; i++) {
				 if (A[i] != 0) System.out.print(i + " "); // print the chosen elements from 1...n
			 }
			 System.out.println();
	   }
	   
	// If verbose mode = 2, print all the possible permutations
	   else if (verbose == 2) {
			 for(int i = 1; i <= n; i++) {
				 System.out.print(A[i] + " "); // print all elements
			 }
			 System.out.println();
	   }
	   
	 //Otherwise do nothing but increment the count by 1 
	   return ++count;
	}