import java.util.*;


class Main{
    public static int biFind(int[] target , String con , int cri){
        //return the first index if found, -1 if not found, -2 if error
        int k = target.length -1;
        int nope = 0;
        int mid = k + (k-nope)/2+1;
        if(con.equals("<")){
            if(target[k]>=cri){
                return -1;
            }else if(target[0]<cri){
                return 0;
            }
            while(nope<k-1){
                mid = nope + (k-nope)/2;
                if(target[mid]<cri){
                    k = mid;
                }else{
                    nope = mid;
                }
            }
            return k;
        }else if(con.equals("<=")){
            if(target[k]>cri){
                return -1;
            }else if(target[0]<=cri){
                return 0;
            }
            while(nope>k){
                mid = k + (k-nope)/2+1;
                if(target[mid]<=cri){
                    k = mid;
                }else{
                    nope = mid;
                }
            }
            return k;
        }else{
            return -2;
        }
    }


    //ans
    public static void main(String[] args){
	Scanner sc = new Scanner(System.in);
      int i = sc.nextInt();
      System.out.println(1-i);
    }
} import java.util.*; util.* java class Main{
    public static int biFind(int[] target , String con , int cri){
        //return the first index if found, -1 if not found, -2 if error
        int k = target.length -1;
        int nope = 0;
        int mid = k + (k-nope)/2+1;
        if(con.equals("<")){
            if(target[k]>=cri){
                return -1;
            }else if(target[0]<cri){
                return 0;
            }
            while(nope<k-1){
                mid = nope + (k-nope)/2;
                if(target[mid]<cri){
                    k = mid;
                }else{
                    nope = mid;
                }
            }
            return k;
        }else if(con.equals("<=")){
            if(target[k]>cri){
                return -1;
            }else if(target[0]<=cri){
                return 0;
            }
            while(nope>k){
                mid = k + (k-nope)/2+1;
                if(target[mid]<=cri){
                    k = mid;
                }else{
                    nope = mid;
                }
            }
            return k;
        }else{
            return -2;
        }
    }


    //ans
    public static void main(String[] args){
	Scanner sc = new Scanner(System.in);
      int i = sc.nextInt();
      System.out.println(1-i);
    }
} Main public static int biFind(int[] target , String con , int cri){
        //return the first index if found, -1 if not found, -2 if error
        int k = target.length -1;
        int nope = 0;
        int mid = k + (k-nope)/2+1;
        if(con.equals("<")){
            if(target[k]>=cri){
                return -1;
            }else if(target[0]<cri){
                return 0;
            }
            while(nope<k-1){
                mid = nope + (k-nope)/2;
                if(target[mid]<cri){
                    k = mid;
                }else{
                    nope = mid;
                }
            }
            return k;
        }else if(con.equals("<=")){
            if(target[k]>cri){
                return -1;
            }else if(target[0]<=cri){
                return 0;
            }
            while(nope>k){
                mid = k + (k-nope)/2+1;
                if(target[mid]<=cri){
                    k = mid;
                }else{
                    nope = mid;
                }
            }
            return k;
        }else{
            return -2;
        }
    } biFind {
        //return the first index if found, -1 if not found, -2 if error
        int k = target.length -1;
        int nope = 0;
        int mid = k + (k-nope)/2+1;
        if(con.equals("<")){
            if(target[k]>=cri){
                return -1;
            }else if(target[0]<cri){
                return 0;
            }
            while(nope<k-1){
                mid = nope + (k-nope)/2;
                if(target[mid]<cri){
                    k = mid;
                }else{
                    nope = mid;
                }
            }
            return k;
        }else if(con.equals("<=")){
            if(target[k]>cri){
                return -1;
            }else if(target[0]<=cri){
                return 0;
            }
            while(nope>k){
                mid = k + (k-nope)/2+1;
                if(target[mid]<=cri){
                    k = mid;
                }else{
                    nope = mid;
                }
            }
            return k;
        }else{
            return -2;
        }
    } int k = target.length -1; k target.length -1 target.length target target.length 1 int nope = 0; nope 0 int mid = k + (k-nope)/2+1; mid k + (k-nope)/2+1 k + (k-nope)/2+1 k (k-nope)/2 (k-nope) k nope 2 1 if(con.equals("<")){
            if(target[k]>=cri){
                return -1;
            }else if(target[0]<cri){
                return 0;
            }
            while(nope<k-1){
                mid = nope + (k-nope)/2;
                if(target[mid]<cri){
                    k = mid;
                }else{
                    nope = mid;
                }
            }
            return k;
        }else if(con.equals("<=")){
            if(target[k]>cri){
                return -1;
            }else if(target[0]<=cri){
                return 0;
            }
            while(nope>k){
                mid = k + (k-nope)/2+1;
                if(target[mid]<=cri){
                    k = mid;
                }else{
                    nope = mid;
                }
            }
            return k;
        }else{
            return -2;
        } con.equals("<") con.equals con "<" {
            if(target[k]>=cri){
                return -1;
            }else if(target[0]<cri){
                return 0;
            }
            while(nope<k-1){
                mid = nope + (k-nope)/2;
                if(target[mid]<cri){
                    k = mid;
                }else{
                    nope = mid;
                }
            }
            return k;
        } if(target[k]>=cri){
                return -1;
            }else if(target[0]<cri){
                return 0;
            } target[k]>=cri target[k] target k cri {
                return -1;
            } return -1; -1 1 if(target[0]<cri){
                return 0;
            } target[0]<cri target[0] target 0 cri {
                return 0;
            } return 0; 0 while(nope<k-1){
                mid = nope + (k-nope)/2;
                if(target[mid]<cri){
                    k = mid;
                }else{
                    nope = mid;
                }
            } nope<k-1 nope k-1 k 1 {
                mid = nope + (k-nope)/2;
                if(target[mid]<cri){
                    k = mid;
                }else{
                    nope = mid;
                }
            } mid = nope + (k-nope)/2 mid nope + (k-nope)/2 nope (k-nope)/2 (k-nope) k nope 2 if(target[mid]<cri){
                    k = mid;
                }else{
                    nope = mid;
                } target[mid]<cri target[mid] target mid cri {
                    k = mid;
                } k = mid k mid {
                    nope = mid;
                } nope = mid nope mid return k; k if(con.equals("<=")){
            if(target[k]>cri){
                return -1;
            }else if(target[0]<=cri){
                return 0;
            }
            while(nope>k){
                mid = k + (k-nope)/2+1;
                if(target[mid]<=cri){
                    k = mid;
                }else{
                    nope = mid;
                }
            }
            return k;
        }else{
            return -2;
        } con.equals("<=") con.equals con "<=" {
            if(target[k]>cri){
                return -1;
            }else if(target[0]<=cri){
                return 0;
            }
            while(nope>k){
                mid = k + (k-nope)/2+1;
                if(target[mid]<=cri){
                    k = mid;
                }else{
                    nope = mid;
                }
            }
            return k;
        } if(target[k]>cri){
                return -1;
            }else if(target[0]<=cri){
                return 0;
            } target[k]>cri target[k] target k cri {
                return -1;
            } return -1; -1 1 if(target[0]<=cri){
                return 0;
            } target[0]<=cri target[0] target 0 cri {
                return 0;
            } return 0; 0 while(nope>k){
                mid = k + (k-nope)/2+1;
                if(target[mid]<=cri){
                    k = mid;
                }else{
                    nope = mid;
                }
            } nope>k nope k {
                mid = k + (k-nope)/2+1;
                if(target[mid]<=cri){
                    k = mid;
                }else{
                    nope = mid;
                }
            } mid = k + (k-nope)/2+1 mid k + (k-nope)/2+1 k + (k-nope)/2+1 k (k-nope)/2 (k-nope) k nope 2 1 if(target[mid]<=cri){
                    k = mid;
                }else{
                    nope = mid;
                } target[mid]<=cri target[mid] target mid cri {
                    k = mid;
                } k = mid k mid {
                    nope = mid;
                } nope = mid nope mid return k; k {
            return -2;
        } return -2; -2 2 int[] target target String con con int cri cri //ans
    public static void main(String[] args){
	Scanner sc = new Scanner(System.in);
      int i = sc.nextInt();
      System.out.println(1-i);
    } main {
	Scanner sc = new Scanner(System.in);
      int i = sc.nextInt();
      System.out.println(1-i);
    } Scanner sc = new Scanner(System.in); sc new Scanner(System.in) int i = sc.nextInt(); i sc.nextInt() sc.nextInt sc System.out.println(1-i) System.out.println System.out System System.out 1-i 1 i String[] args args
import java.util.*;


class Main{
    public static int biFind(int[] target , String con , int cri){
        //return the first index if found, -1 if not found, -2 if error
        int k = target.length -1;
        int nope = 0;
        int mid = k + (k-nope)/2+1;
        if(con.equals("<")){
            if(target[k]>=cri){
                return -1;
            }else if(target[0]<cri){
                return 0;
            }
            while(nope<k-1){
                mid = nope + (k-nope)/2;
                if(target[mid]<cri){
                    k = mid;
                }else{
                    nope = mid;
                }
            }
            return k;
        }else if(con.equals("<=")){
            if(target[k]>cri){
                return -1;
            }else if(target[0]<=cri){
                return 0;
            }
            while(nope>k){
                mid = k + (k-nope)/2+1;
                if(target[mid]<=cri){
                    k = mid;
                }else{
                    nope = mid;
                }
            }
            return k;
        }else{
            return -2;
        }
    }


    //ans
    public static void main(String[] args){
	Scanner sc = new Scanner(System.in);
      int i = sc.nextInt();
      System.out.println(1-i);
    }
}