#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
int main()
{
	ll t = 1;
//	cin >> t;
	while(t--)
	{
		ll n;
		cin >> n;
		ll c = 0 , x = 1 , c1 = 0;
		while(1)
		{
			// x*y + x*(x-1)/2 = 
			ll val = n - ((x*(x-1))/2);
		//	cout << val << endl;
			ll val1 = val / x;
			if(val1 < 0)
				break;
			if(val % x == 0 && val1 > 0)
			{
			//	cout << "i " << val1 << endl;
				c++;
			}
			x++;
		}
		cout << 2*c+c1 << endl;
	}
}
#include<bits/stdc++.h>
#define pb push_back 
 #define fo(i,n) for(int i=0;i<n;i++)
#define ll long long 
#define int long long 
#define Mod 1000000007
#define maxn 200005
#define MAX 4294967296  // 2^32
const int M=1e9+7;
#define ip pair<int,int>
#define test(t) ll t;cin>>t;while(t--)
  
using namespace std;

long long power(int x,int y){
if(y==0)return 1;

long long res=1;
while(y>0){
    if(y&1){
        res=(res*x)%Mod;
 
    }
    x=x*x%Mod;
  y/=2;
}
return res;

}


ll power(ll x, ll y, ll p)
{
    ll res = 1;      // Initialize result
 
    x = x % p;  // Update x if it is more than or
                // equal to p
 
    while (y > 0)
    {
        // If y is odd, multiply x with result
        if (y & 1)
            res = (res*x) % p;
 
        // y must be even now
        y = y>>1; // y = y/2
        x = (x*x) % p;
    }
    return res;
}
long long gcd(int x,int y){
    // if(y>x)swap(x,y);
    if(y==0)return x;
    return gcd(y,x%y);
}
// const int N=200005;
// int dp[N];
// int r=1000000000000000005;
int fact[250005];
// int prime[25]={2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97};
// set<int>st;
int mul(int l,int r){
    return ((l%Mod)%Mod*(r%Mod)%Mod)%Mod;
}
int nCr(int n,int k){
if(n<k)return 0;
int ans=fact[n]%Mod;
ans=mul(ans,power(fact[n-k],Mod-2));
ans=mul(ans,power(fact[k],Mod-2));
return ans;
}

// int n;
// int v=100000000000000;
// void dfs(int i,int j){
// size[i]=1;
// bool is=1;
// for(auto it:adj[i]){
//     if(!vis[it]){
//         dfs(it,i);
//         size[i]+=size[it];
        
//     }
// }




// }
bool prime(int x){

if(x<2)return false;

for(int i=2;i*i<=x;i++){
    if(x%i==0)return false;

}
return true;


}

void solve(){

int n;
cin>>n;
int ans=0;
for(int i=2;i<=(i*(i+1))/2;i++){
    if((n-((i*(i+1))/2))%i==0)ans++;
}

cout<<2*ans;
return ;

}

signed main(){


    // std::string binary = std::bitset<8>(n).to_string();
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
   // memset(fact,0,sizeof(fact));

 // test(t)

int n;
cin>>n;
int ans=1;
for(int i=2;(i*(i+1))/2<=n;i++){
    if((n-((i*(i+1))/2))%i==0)ans++;
}

cout<<2*ans;


  


}