function solution(A, B) {

    var dirStack  = [];
    var sizeStack = [];

    sizeStack.push(A[A.length - 1]);
    dirStack.push(B[B.length -1]);

    console.log(A);
    console.log(B);
    console.log("-------------------------------------");


    for(var i = A.length -2; i >= 0; i--){
        var tmp = dirStack.pop();
        dirStack.push(tmp);

        if(B[i] === 1 && tmp != B[i]){
            var stop = false;
            do{
                var tmp2 = sizeStack.pop();

                if(tmp2 === undefined){
                    break;
                }
                var stc = dirStack.pop();

                if(tmp2 > A[i] || stc === B[i]){
                    sizeStack.push(tmp2);
                    dirStack.push(stc);
                    if(stc === B[i]) break;
                    stop = true;
                }
            }while(!stop);

            if(!stop){

                sizeStack.push(A[i]);
                dirStack.push(B[i]);
            }

        }else{

            dirStack.push(B[i]);
            sizeStack.push(A[i]);

        }


    }
    console.log(dirStack);
    console.log(sizeStack);
    return dirStack.length;
}