1331D - Again - CodeForces Solution

///---------------------------------------------------------------------------------------------------------------->>>>>>>>
#include<bits/stdc++.h>
using namespace std;
//------------------------------------------------------------------------------------------------------------------->>>>>>
typedef long long ll;
typedef double dl;
const int inf = 2e9;
const ll infll = 2e18;
//------------------------------------------------------------------------------------------------------------------->>>>>>
#define endl '\n'
#define optimize() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define fraction() cout.unsetf(ios::floatfield); cout.precision(10); cout.setf(ios::fixed,ios::floatfield);
//--------------------------------------------------------------------------------------------------------------------->>>>
///check distinct number-[  dist (array name,array size)] return the value of counting distinct number<------------------->
int dist(int *arr,int n){int i,j,cnt=1;for(i=1;i<n;i++){for(j=0;j<i;j++)if(arr[i]==arr[j])break; if(i==j)cnt++;}return cnt;}
int arrmax(int arr_nem[],int last){ int mx=arr_nem[0]; for(int i=1;i<last;i++)  if(mx<arr_nem[i]) mx=arr_nem[i]; return mx;}
int arrmin(int arr_nem[],int last){ int mn=arr_nem[0]; for(int i=1;i<last;i++)  if(mn>arr_nem[i]) mn=arr_nem[i]; return mn;}
///arrmax=(array name,array size_(n)),arrmin(array name,array size_(n)) it return the max or min value<------------------->
//---------------------------------------------------------------------------------------------------------------------->>>>
ll gcd (ll a, ll b) {return __gcd(a,b);}
ll lcm (ll a, ll b) {return a*(b/gcd(a,b));}
///------------------------------------------------------------------------------------------------------------------->>>>>>


int main()
{
    optimize();
    string str;
    cin>>str;
    int last=str.size()-1;
    int n=int(str[last]);
    if(n%2==0)
        cout<<0<<endl;
    else
        cout<<1<<endl;



    return 0;
}