#include #pragma GCC optimize("Ofast") #define _GLIBCXX_DEBUG using namespace std; using std::cout; using std::cin; using std::endl; using ll=long long; using ld=long double; ll ILL=1167167167167167167; const int INF=2100000000; const ll mod=998244353; #define rep(i,a) for (ll i=0;i using _pq = priority_queue, greater>; template ll LB(vector &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();} template ll UB(vector &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();} template bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;} template bool chmax(T &a,const T &b){if(a void So(vector &v) {sort(v.begin(),v.end());} template void Sore(vector &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});} void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";} template void vec_out(vector &p){for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<1){ ll med=(l+r)/2; if(med*med*med>A) r=med; else l=med; } return l; } void solve(); // oddloop int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int t=1; //cin>>t; rep(i,t) solve(); } void solve(){ ll N; cin>>N; ll ans=0; int J=0; for(ll i=1;i<=N+3;i++){ if(J==0&&i*i*i*i>=N*N*27ll){ J=1; } if((N*N)%i!=0) continue; if(J==0) continue; ll tmp=(N*N)/i; ll up=f(tmp); for(ll a=1;a<=min(up,i/3);a++){ if(tmp%a!=0) continue; ll X=tmp/a; ll Y=i-a; if(X>((Y+1)/2)*(Y/2)) continue; for(ll b=a;true;b++){ if(X/b