
import java.util.*;
import java.io.*;
import java.math.BigInteger;
public class Main {

	private static final int mod =(int)1e9+7;
	public static void main(String[] args) throws Exception  {
	      Scanner  sc=new Scanner(System.in);
	      PrintWriter out=new PrintWriter(System.out);
	      int x=sc.nextInt();
	    if(x==0) {
	      out.println(1);
	    }else {
	      out.println(0);
	    }
	      out.flush();
	    }
//	    static int binarySearch(int i,int j,int a[]) {
//	      
//	    }
	
	static boolean vis[]=new boolean[10001];
	      static int gcd(int a, int b) 
	      { 
	          if (a == 0) 
	              return b; 
	          return gcd(b % a, a); 
	      } 
	    static  void dfs(int n,boolean flag,ArrayList<ArrayList<Integer>> adj,int src,boolean vis[],ArrayList<Integer> centroid,int size[]) {
	        vis[src]=true;
	        size[src]=1;
	        for(int i:adj.get(src)) {
	          if(vis[i]==false){
	            dfs(n,flag,adj,i,vis,centroid,size);
	            size[src]+=size[i];
	            if(size[i]>n/2) {
	              flag=false;
	            }
	          }
	        }
	        if(n-size[src]>n/2) {
	          flag=false;
	        }
	        if(flag==true) {
	          centroid.add(src);
	        }
	    }
	
	     
	      
} import java.util.*; util.* java import java.io.*; io.* java import java.math.BigInteger; BigInteger java.math public class Main {

	private static final int mod =(int)1e9+7;
	public static void main(String[] args) throws Exception  {
	      Scanner  sc=new Scanner(System.in);
	      PrintWriter out=new PrintWriter(System.out);
	      int x=sc.nextInt();
	    if(x==0) {
	      out.println(1);
	    }else {
	      out.println(0);
	    }
	      out.flush();
	    }
//	    static int binarySearch(int i,int j,int a[]) {
//	      
//	    }
	
	static boolean vis[]=new boolean[10001];
	      static int gcd(int a, int b) 
	      { 
	          if (a == 0) 
	              return b; 
	          return gcd(b % a, a); 
	      } 
	    static  void dfs(int n,boolean flag,ArrayList<ArrayList<Integer>> adj,int src,boolean vis[],ArrayList<Integer> centroid,int size[]) {
	        vis[src]=true;
	        size[src]=1;
	        for(int i:adj.get(src)) {
	          if(vis[i]==false){
	            dfs(n,flag,adj,i,vis,centroid,size);
	            size[src]+=size[i];
	            if(size[i]>n/2) {
	              flag=false;
	            }
	          }
	        }
	        if(n-size[src]>n/2) {
	          flag=false;
	        }
	        if(flag==true) {
	          centroid.add(src);
	        }
	    }
	
	     
	      
} Main private static final int mod =(int)1e9+7; mod (int)1e9+7 (int)1e9 7 static boolean vis[]=new boolean[10001]; vis new boolean[10001] 10001 public static void main(String[] args) throws Exception  {
	      Scanner  sc=new Scanner(System.in);
	      PrintWriter out=new PrintWriter(System.out);
	      int x=sc.nextInt();
	    if(x==0) {
	      out.println(1);
	    }else {
	      out.println(0);
	    }
	      out.flush();
	    } main {
	      Scanner  sc=new Scanner(System.in);
	      PrintWriter out=new PrintWriter(System.out);
	      int x=sc.nextInt();
	    if(x==0) {
	      out.println(1);
	    }else {
	      out.println(0);
	    }
	      out.flush();
	    } Scanner  sc=new Scanner(System.in); sc new Scanner(System.in) PrintWriter out=new PrintWriter(System.out); out new PrintWriter(System.out) int x=sc.nextInt(); x sc.nextInt() sc.nextInt sc if(x==0) {
	      out.println(1);
	    }else {
	      out.println(0);
	    } x==0 x 0 {
	      out.println(1);
	    } out.println(1) out.println out 1 {
	      out.println(0);
	    } out.println(0) out.println out 0 out.flush() out.flush out String[] args args static int gcd(int a, int b) 
	      { 
	          if (a == 0) 
	              return b; 
	          return gcd(b % a, a); 
	      } gcd { 
	          if (a == 0) 
	              return b; 
	          return gcd(b % a, a); 
	      } if (a == 0) 
	              return b; a == 0 a 0 return b; b return gcd(b % a, a); gcd(b % a, a) gcd b % a b a a int a a int b b static  void dfs(int n,boolean flag,ArrayList<ArrayList<Integer>> adj,int src,boolean vis[],ArrayList<Integer> centroid,int size[]) {
	        vis[src]=true;
	        size[src]=1;
	        for(int i:adj.get(src)) {
	          if(vis[i]==false){
	            dfs(n,flag,adj,i,vis,centroid,size);
	            size[src]+=size[i];
	            if(size[i]>n/2) {
	              flag=false;
	            }
	          }
	        }
	        if(n-size[src]>n/2) {
	          flag=false;
	        }
	        if(flag==true) {
	          centroid.add(src);
	        }
	    } dfs {
	        vis[src]=true;
	        size[src]=1;
	        for(int i:adj.get(src)) {
	          if(vis[i]==false){
	            dfs(n,flag,adj,i,vis,centroid,size);
	            size[src]+=size[i];
	            if(size[i]>n/2) {
	              flag=false;
	            }
	          }
	        }
	        if(n-size[src]>n/2) {
	          flag=false;
	        }
	        if(flag==true) {
	          centroid.add(src);
	        }
	    } vis[src]=true vis[src] vis src true size[src]=1 size[src] size src 1 for(int i:adj.get(src)) {
	          if(vis[i]==false){
	            dfs(n,flag,adj,i,vis,centroid,size);
	            size[src]+=size[i];
	            if(size[i]>n/2) {
	              flag=false;
	            }
	          }
	        } int i adj.get(src) adj.get adj src {
	          if(vis[i]==false){
	            dfs(n,flag,adj,i,vis,centroid,size);
	            size[src]+=size[i];
	            if(size[i]>n/2) {
	              flag=false;
	            }
	          }
	        } {
	          if(vis[i]==false){
	            dfs(n,flag,adj,i,vis,centroid,size);
	            size[src]+=size[i];
	            if(size[i]>n/2) {
	              flag=false;
	            }
	          }
	        } if(vis[i]==false){
	            dfs(n,flag,adj,i,vis,centroid,size);
	            size[src]+=size[i];
	            if(size[i]>n/2) {
	              flag=false;
	            }
	          } vis[i]==false vis[i] vis i false {
	            dfs(n,flag,adj,i,vis,centroid,size);
	            size[src]+=size[i];
	            if(size[i]>n/2) {
	              flag=false;
	            }
	          } dfs(n,flag,adj,i,vis,centroid,size) dfs n flag adj i vis centroid size size[src]+=size[i] size[src] size src size[i] size i if(size[i]>n/2) {
	              flag=false;
	            } size[i]>n/2 size[i] size i n/2 n 2 {
	              flag=false;
	            } flag=false flag false if(n-size[src]>n/2) {
	          flag=false;
	        } n-size[src]>n/2 n-size[src] n size[src] size src n/2 n 2 {
	          flag=false;
	        } flag=false flag false if(flag==true) {
	          centroid.add(src);
	        } flag==true flag true {
	          centroid.add(src);
	        } centroid.add(src) centroid.add centroid src int n n boolean flag flag ArrayList<ArrayList<Integer>> adj adj int src src boolean vis[] vis ArrayList<Integer> centroid centroid int size[] size public class Main {

	private static final int mod =(int)1e9+7;
	public static void main(String[] args) throws Exception  {
	      Scanner  sc=new Scanner(System.in);
	      PrintWriter out=new PrintWriter(System.out);
	      int x=sc.nextInt();
	    if(x==0) {
	      out.println(1);
	    }else {
	      out.println(0);
	    }
	      out.flush();
	    }
//	    static int binarySearch(int i,int j,int a[]) {
//	      
//	    }
	
	static boolean vis[]=new boolean[10001];
	      static int gcd(int a, int b) 
	      { 
	          if (a == 0) 
	              return b; 
	          return gcd(b % a, a); 
	      } 
	    static  void dfs(int n,boolean flag,ArrayList<ArrayList<Integer>> adj,int src,boolean vis[],ArrayList<Integer> centroid,int size[]) {
	        vis[src]=true;
	        size[src]=1;
	        for(int i:adj.get(src)) {
	          if(vis[i]==false){
	            dfs(n,flag,adj,i,vis,centroid,size);
	            size[src]+=size[i];
	            if(size[i]>n/2) {
	              flag=false;
	            }
	          }
	        }
	        if(n-size[src]>n/2) {
	          flag=false;
	        }
	        if(flag==true) {
	          centroid.add(src);
	        }
	    }
	
	     
	      
} public class Main {

	private static final int mod =(int)1e9+7;
	public static void main(String[] args) throws Exception  {
	      Scanner  sc=new Scanner(System.in);
	      PrintWriter out=new PrintWriter(System.out);
	      int x=sc.nextInt();
	    if(x==0) {
	      out.println(1);
	    }else {
	      out.println(0);
	    }
	      out.flush();
	    }
//	    static int binarySearch(int i,int j,int a[]) {
//	      
//	    }
	
	static boolean vis[]=new boolean[10001];
	      static int gcd(int a, int b) 
	      { 
	          if (a == 0) 
	              return b; 
	          return gcd(b % a, a); 
	      } 
	    static  void dfs(int n,boolean flag,ArrayList<ArrayList<Integer>> adj,int src,boolean vis[],ArrayList<Integer> centroid,int size[]) {
	        vis[src]=true;
	        size[src]=1;
	        for(int i:adj.get(src)) {
	          if(vis[i]==false){
	            dfs(n,flag,adj,i,vis,centroid,size);
	            size[src]+=size[i];
	            if(size[i]>n/2) {
	              flag=false;
	            }
	          }
	        }
	        if(n-size[src]>n/2) {
	          flag=false;
	        }
	        if(flag==true) {
	          centroid.add(src);
	        }
	    }
	
	     
	      
} Main

import java.util.*;
import java.io.*;
import java.math.BigInteger;
public class Main {

	private static final int mod =(int)1e9+7;
	public static void main(String[] args) throws Exception  {
	      Scanner  sc=new Scanner(System.in);
	      PrintWriter out=new PrintWriter(System.out);
	      int x=sc.nextInt();
	    if(x==0) {
	      out.println(1);
	    }else {
	      out.println(0);
	    }
	      out.flush();
	    }
//	    static int binarySearch(int i,int j,int a[]) {
//	      
//	    }
	
	static boolean vis[]=new boolean[10001];
	      static int gcd(int a, int b) 
	      { 
	          if (a == 0) 
	              return b; 
	          return gcd(b % a, a); 
	      } 
	    static  void dfs(int n,boolean flag,ArrayList<ArrayList<Integer>> adj,int src,boolean vis[],ArrayList<Integer> centroid,int size[]) {
	        vis[src]=true;
	        size[src]=1;
	        for(int i:adj.get(src)) {
	          if(vis[i]==false){
	            dfs(n,flag,adj,i,vis,centroid,size);
	            size[src]+=size[i];
	            if(size[i]>n/2) {
	              flag=false;
	            }
	          }
	        }
	        if(n-size[src]>n/2) {
	          flag=false;
	        }
	        if(flag==true) {
	          centroid.add(src);
	        }
	    }
	
	     
	      
}