Two set bits

#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;


int main() {
    int t;
    cin>>t;
    double m=1e9+7;
    while(t--){
        long long int n,x=0,k=1,i,ans;
        cin>>n;
        n=n%(long)m;
        k=(sqrt(1+8*n))/2;
        x=(k*(k-1))/2;
        i=(n-x-1)%(long)m;
        //cout<<k<<" "<<x<<" ";
        k=k%(long)m;
        i=i%(long)m;
        ans=(((long)1<<k)%(long)m+((long)1<<i)%(long)m)%(long)m;
        cout<<ans<<endl;
    }
    return 0;
}