class Solution {
    public int[] sortByBits(int[] arr) {
        int n=arr.length;
        for (int i = 0; i < n-1; i++){
            for (int j = 0; j < n-i-1; j++){
                if (func(arr[j]) > func(arr[j+1]) || (arr[j] > arr[j+1] && func(arr[j]) == func(arr[j+1])))
                {
                    int temp = arr[j];
                    arr[j] = arr[j+1];
                    arr[j+1] = temp;
                }
            }
        }
        return arr;
    }
    public int func(int n) {
        int count=0;
        while(n!=0){
            if((n&1)==1)
            count++;
            n=n>>>1;
        }
        return count;
    }
}