int utopianTree(int n) {
    int height = 1;
    auto is_odd = [](int num){ return (num & 1);};
    
    for (int i=1;i<=n;i++) {
        if (is_odd(i)) {
            height *= 2;
        } else {
            height += 1;
        }
    }
    
    return height;
}