/**
 *    author:   K.R.Surrya  
 *    created:  13.09.2020 17:30:02
**/
//~ ~~ ~~~~ ~~~~~~~~   
#include<bits/stdc++.h>
using namespace std; 
using lint                 =            long long int;
using pii                  =            pair<int, int>;
using plii                 =            pair<lint, lint>;
typedef long long                       ll; 
typedef pair<ll,ll>                     pll;
#define mp                              make_pair
#define in                              insert
#define ff                              first
#define ss                              second
#define arr                             array
#define vi                              vector<int>
#define vli                             vector<lint>
#define vvi                             vector<vector<int>>
#define vii                             vector<pair<int, int>>
#define pb                              push_back
#define ALL(x)                          begin(x),end(x)
#define inf                             (1LL<63)-1
#define MOD                             1000000007
#define SZ(x)                           ((lint)(x).size())
#define                                 FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define                                 IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define                                 REP(i, n) FOR(i,0,n)
#define                                 IREP(i, n) IFOR(i,0,n)
#define                                 f_ip   ios_base::sync_with_stdio(false); cin.tie(NULL);
#define ZERO(a)                         fill(ALL(a),0)
#define lastBit(n)                      31-__builtin_clz(n) + 1 //32 bit integers, 1-based indexing.
#define firstBit(n)                     __builtin_ctz((n&(-n))) + 1
#define n2b(n, b)                       bitset<b>(n).to_string()
struct fast_ios                         { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
template<typename T>                    istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
template<typename T>                    bool chmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template<typename T>                    bool chmin(T &m, const T q) { if (q < m) {m = q; return true;} else return false; }
mt19937                                 rng(chrono::steady_clock::now().time_since_epoch().count());


        /* ~~Directions~~ */
       /* ~~~~~~~~~~~~~~~ */
const int dx[8] = {0, 1, -1, 0, 1, 1, -1, -1};
const int dy[8] = {1, 0, 0, -1, 1, -1, -1, 1};


        /* ~~Useful Functions~~ */
      /*~~~~~~~~~~~~~~~~~~~~~~*/
inline int add(lint a, lint b,int mod) { return ((a % mod) + (b % mod)) % mod; }
inline int sub(lint a, lint b,int mod) { return ((a % mod) - (b % mod) + mod) % mod; }
inline int mul(lint a, lint b,int mod) { return ((a % mod) * (b % mod)) % mod; }

        /* ~~Debugging~~ */         
      /*~~~~~~~~~~~~~~~~~*/       
#define LOCAL
#define sim template <class c
#define ris return *this
#define dor > deb &operator<<
#define eni(x)                                                                  \
    sim > typename enable_if<sizeof dud<c>(0) x 1, deb &>::type operator<<(c i) \
    {
sim > struct rge
{
    c b, e;
};
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c *x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct deb
{
#ifdef LOCAL
    ~deb()
    {
        cerr << endl;
    }
    eni(!=) cerr << boolalpha << i;
    ris;
} eni(==) ris << range(begin(i), end(i));
}
sim, class b dor(pair<b, c> d)
{
    ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d)
{
    *this << "[";
    for (auto it = d.b; it != d.e; ++it)
        *this << ", " + 2 * (it == d.b) << *it;
    ris << "]";
}
#else
    sim dor(const c &)
    {
        ris;
    }
#endif
}
;
#define what(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
// -DLOCAL


    /* ~~driver~~ */
    /*~~~~~~~~~~~~*/
void solve() {
     int x;cin >> x;
     int f = (x^1);
     cout << f << '\n';
}


int main()
{   
     /*
     #ifndef ONLINE_JUDGE
     freopen("input.txt", "r", stdin);
     freopen("output.txt", "w", stdout);
     #endif
     */

     int T=1;
     //cin>>T;
     for(int tt=1;tt<=T;++tt) {
         solve();
     }

    return 0;
}

 /* Eat -- Sleep ~~ CODE ~~ Repeat */


Measured memory_bytes: 3640