function solution(n, lost, reserve) {
    let arr = new Array(n).fill(1), index=0;
    arr = arr.map((v,i) => {
        if(lost.indexOf(i+1) >= 0 && reserve.indexOf(i+1) >= 0) return 1;
        if(lost.indexOf(i+1) >= 0) return 0;
        if(reserve.indexOf(i+1) >= 0) return 2;

        return 1;
    })
    arr.forEach((v,i) => {
        if(arr[i-1] !== undefined && arr[i] === 2 && arr[i-1] === 0){
            arr[i-1]=1; arr[i]=1;
        }
        else if(arr[i+1] !== undefined && arr[i] === 2 && arr[i+1] === 0){
            arr[i+1]=1; arr[i]=1;
        }
    })
    arr.forEach(v => {
        if(v >= 1) index++;
    })
    return index;
}