function solution(n) {
let nBin = n.toString(2);
let cnt=0;
for (let i=0; i<nBin.length; i++) {
if (nBin[i] === '1') cnt++;
}
while (1) {
n++;
let nBin2=n.toString(2);
let cnt2=0;
for (let i=0; i<nBin2.length; i++) {
if (nBin2[i] === '1') cnt2++;
}
if (cnt === cnt2) break;
}
return n;
}
console.log(solution(78));
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);
}