#include using namespace std; typedef long long ll; typedef pair P; #define REP(i,n) for(ll i=0;i> T; while(T--){ ll N; cin >> N; ll ok=-1,ng=1000000000; while(ng-ok>1){ ll x=(ok+ng)/2; if(2*x*(x+1)<=N) ok=x; else ng=x; } ll ans=0; for(i=1;i<=ok;i++){ ll mx=(N-i)/(2*i+1); ans+=2*(mx-i)+1; ans%=MOD; } cout << ans << endl; } return 0; }