#include<bits/stdc++.h>
using namespace std;
#define ll                long long
#define all(x)            (x).begin(),(x).end()
#define sz(x)             (ll)((x).size())
#define GCD(m,n)          __gcd(m,n)
#define LCM(m,n)          ((m*n)/GCD(m,n))
#define PI                3.14159265

//max element of a vector = *max_element (first_index, last_index);
// s.find_first_of('')
const ll M=1e9+7;

ll sign(ll x){
	return (x>0)-(x<0);
}

bool is_prime(ll n){
	ll i;
	for(i=2;i<=n;i++){
		if(n%i==0){
			return false;
		}
	}
	return true;
}

ll power(ll a,ll b,ll mod){
    if(b==0){
        return 1;
    }
    ll x=power(a,b/2,mod);
    x=(x*x)%mod;
    if(b%2){
        x=(x*a)%mod;
    }
    return x;
}

bool isPalindrome(string str){
	ll l = 0;
	ll h = str.length()-1;

	while(h>l){
		if(str[l++]!=str[h--]){
			return false;
		}
	}
	return true;
}


void kickstart(ll test){
	cout << "Case #" << test << ": ";
	cout << "\n";
}

ll gcd(ll x, ll y) {
	return y == 0 ? x : gcd(y, x % y);
}

int main(){
	
	ios_base::sync_with_stdio(false);
	cin.tie(0); cout.tie(0);

	#ifndef ONLINE_JUDGE
		freopen("input.txt", "r", stdin);     // to be uncommented when I/P 
		freopen("output.txt", "w", stdout);   // & O/P is in file format
	#endif

	ll n;
	cin>>n;
	ll x = n*n;
	cout<<2-x;
	return 0;
}

