function solution(n) {
let b = n.toString(2);
let one = b.split("1").length-1;
let c = n+1;
while(one !== c.toString(2).split("1").length-1){
c++;
}
return c;
}
function nextBigNumber(n) {
var size = n.toString(2).match(/1/g).length
while(n++) {
if(size === n.toString(2).match(/1/g).length) return n
}
}
function solution(n,a=n+1) {
return n.toString(2).match(/1/g).length == a.toString(2).match(/1/g).length ? a : solution(n,a+1);
}