#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
#include <map>
#include <cmath>
#include <set>
#include <queue>
#define inf 0x3f3f3f3f
using namespace std;
const int maxn = 1e6+500;
typedef long long ll;
int main(){
ll n;
while(~scanf("%lld",&n)){
int k=sqrt(2*n);
int flag=1;
for(int i=k;i>=2;i--){
if((n-i*(i-1)/2)%i==0){
ll a=(n-i*(i-1)/2)/i;
flag=0;
printf("%lld\n",a);
}
}
if(flag){
printf("No Solution\n");
}
}
return 0;
}