#include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>

using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i < n + 1; i++)
#define all(A) A.begin(), A.end()
typedef long long ll;

int main(){
  int n;
  cin >> n;
  cout << n-1 << endl;
}
#include <iostream>
using namespace std;
int main() {
  int n;
  while(cin>>n){
    cout<<n-1<<endl;
  } 
}