Find the Power of Two that is Smaller or Equal to n

#include <bits/stdc++.h>

using namespace std;

int main() {
    int n;
    cin >> n;
    int exponent = 0;
    for (int i = 0; i < 30; i++) {
        // find the highest power of two that can still divide 'n'
        if ((n >> i) == 1) {
            exponent = i;
        }
    }
    cout << (1 << exponent) << '\n';
    return 0;
}