#include <iostream>
using namespace std;

int main(){
	int N;
	cin >> N;
	cout << N-1;
}

#include<bits/stdc++.h>
using namespace std;
using P=pair<int,int>;
using ll=long long;
template<class T> using heapq = priority_queue<T,vector<T>,greater<T>>;
template<class T> bool chmax(T &a,const T b) {if (a<b) {a=b;return true;} else return false;} 
template<class T> bool chmin(T &a,const T b) {if (a>b) {a=b;return true;} else return false;} 
#define rep(i,n) for(int i=0; i<(n); i++)
#define srep(i,a,b) for(int i=(a); i<(b); i++)
#define rrep(i,n) for(int i=(n)-1;i>=0; i--)
#define srrep(i,a,b) for(int i=(b)-1; i>=(a); i--)
int main(){
    int n; cin >> n;
    cout << n-1 << endl;
}