Code wars challenge

function iqTest(numbers){
  var storeArray = numbers.split(' ').map(Number);
//   console.log("The store array looks like "+storeArray);
  var evenArray=[];
  var oddArray=[];
  var evenPos;
  var oddPos;
  for(i = 0; i < storeArray.length; i++){
    if(storeArray[i] % 2 === 0){
      evenArray.push(storeArray[i]);
      evenPos = i;
    //   console.log("The latest position of an even number is " + evenPos);
    }
     else{
     oddArray.push(storeArray[i]);
     oddPos = i;
    //  console.log("The latest position of an odd number is " + oddPos);
     }
}
    if(evenArray.length > oddArray.length){
        return oddPos+1;
    }
    else{
        return evenPos+1;
    }

    // console.log("The oddArray has " + oddArray); 
    // console.log("The evenArray has "+ evenArray);
    // return evenArray.length;
}
console.log(iqTest("1 2 1 1"));