function solution(routes) {
let answer = 0; // [-20,-15],[-18,-13],[-17,-5],[-16,-3]
routes.sort((a,b)=>a[1]-b[1]);
let i=1;
let start=routes[0][1];
while(i<routes.length){
if(start<routes[i][0]){
answer++;
start=routes[i][1];
}
i++;
}
answer++;
return answer;
}