#include <iostream>
using namespace std;

int main() {

  int a;
  cin >> a;

  int b;
  b = a-1;
   
cout << b;
	return 0;
}
/*
ID: tdpenci1
LANG: C++
TASK: beads
*/
#include "bits/stdc++.h"

using namespace std;

#pragma optimize ("Ofast")
typedef long long ll;
#define all(x) x.begin(), x.end()
#define trav(i, x) for(auto &i : x)
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define eb emplace_back
#define FOR(i, N) for(int i = 0; i < (N); i++)
#define vt vector
const ll mod = 1e9 + 7;
const int mxA = 1e7;




void io(const string s="") {
	if(s != "") {
		freopen((s+".in").c_str(), "r", stdin);
		freopen((s+".out").c_str(), "w", stdout);
	} else {
		ios_base::sync_with_stdio(false); cin.tie(0);
	}
}

bool ispal(string v) {
	string t=v;
	reverse(t.begin(),t.end());
	return v==t;
}
void solve() {
	int n; cin >> n;
	cout << (n-1) << "\n";
}
int main() {
	io();

	int t = 1, i = 1; 
	while(t--) {
		solve();
	}
}

