#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i< (n); i++)
using ll = long long;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
template<class T> void chmax(T& a, T b){
    if(a < b){
        a = b;
    }
}
template<class T> void chmin(T& a, T b){
    if(a > b){
        a = b;
    }
}
int main()
{
    int n;
    cin >> n;
    cout << n-1 << endl;
    return 0;
}
//𝓬𝓮𝓭𝓮𝓼𝓲𝓸𝓷😎
#include<bits/stdc++.h>
using namespace std;
/*--------------------------*defines*-----------------------------*/
#define endl              "\n"
#define int               long long
#define mp                make_pair
#define pb                push_back
#define vi                vector<int>
#define cedesion          signed main
#define inf               INT_MAX
#define rep(i,a,b)        for(int i=(a); i<(b); ++i)
#define rrep(i,a,b)       for(int i=(a); i>=(b); --i)
#define all(v)            v.begin(),v.end()
#define dall(v)           v.begin(),v.end(),greater<int>()
/*--------------------------*defines*-----------------------------*/
/*--------------------------*functions*---------------------------*/
bool perfectSquare(long double x){
    long double sr = sqrt(x);return ((sr - floor(sr)) == 0);
}
long long modexp(long long n,long long p,long long c){
    if(p == 0)return 1;
    long long ans = 1;
    if(p%2)ans = n%c;
    return ((ans)*(modexp((n*n)%c,p/2,c)%c))%c; 
} 
/*--------------------------*functions*---------------------------*/
/*------------------------*work space*----------------------------*/
void test_case()
{
    int n;
    cin>>n;
    cout<<n-1<<endl;    
}
cedesion()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    //#ifndef ONLINE_JUDGE
    //for getting input from input.txt
    //freopen("input.txt", "r", stdin);
    //for writing output in output.txt
    //freopen("output.txt", "w", stdout);
    //#endif
    int t=1;
    // cin>>t;
    while(t--)
    {
        test_case();
    }
    
    
    return 0;
}                                                    