#include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<algorithm>
#include<vector>
#include<math.h>
#include<iomanip>
#include<stack>
#include<queue>
#include<set>
#include<map>
 
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
 
//const ll mod = 1000000007;
const ll mod = 998244353;
const ld pi = 3.14159265358979;

ll gcd(ll a , ll b){
	if(a < b)swap(a , b);
	if(a % b == 0)return b;
	else return gcd(b , a % b);
}

int main(){	
	cin.tie(0);
	ios::sync_with_stdio(false);
	//cout << fixed << setprecison(15);
	ll n;
	cin >> n;
	ll sum = (n - 1) * n / 2;
	ll ans  =gcd(n  ,sum);
	cout << ans << endl;
	return 0;
}