for (i=0; i < N-1; i++) {
        frq = 1;
        for (k = i+1; k<N; k++)
            if (arr[i] == arr[k])
                frq += 1;
        if (frq > max_frq) {
            max_frq = frq;
            num = arr[i];
        }
    }