Problem: <image>

Input

The input contains two integers a1, a2 (0 ≤ ai ≤ 32), separated by a single space.

Output

Output a single integer.

Examples

Input

1 1


Output

0


Input

3 7


Output

0


Input

13 10


Output

1

Solution (in JAVA):

Solution:
//package codeforces;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.Closeable;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collection;
import java.util.Collections;
import java.util.Comparator;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Iterator;
import java.util.LinkedList;
import java.util.List;
import java.util.ListIterator;
import java.util.Map;
import java.util.PriorityQueue;
import java.util.Queue;
import java.util.Set;
import java.util.StringTokenizer;
import java.util.TreeSet;

public class A implements Closeable {
    BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
    PrintWriter writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));

    A() throws IOException {
//        reader = new BufferedReader(new FileReader("input.txt"));
//        writer = new PrintWriter(new FileWriter("output.txt"));
    }

    StringTokenizer stringTokenizer;

    String next() throws IOException {
        while (stringTokenizer == null || !stringTokenizer.hasMoreTokens()) {
            stringTokenizer = new StringTokenizer(reader.readLine());
        }
        return stringTokenizer.nextToken();
    }

    int nextInt() throws IOException {
        return Integer.parseInt(next());
    }

    long nextLong() throws IOException {
        return Long.parseLong(next());
    }

    double nextDouble() throws IOException {
        return Double.parseDouble(next());
    }

    private int MOD = 1000 * 1000 * 1000 + 7;

    int sum(int a, int b) {
        a += b;
        return a >= MOD ? a - MOD : a;
    }

    int product(int a, int b) {
        return (int) (1l * a * b % MOD);
    }

    int pow(int x, int k) {
        int result = 1;
        while (k > 0) {
            if (k % 2 == 1) {
                result = product(result, x);
            }
            x = product(x, x);
            k /= 2;
        }
        return result;
    }

    int inv(int x) {
        return pow(x, MOD - 2);
    }

    void solve() throws IOException {
        String s =
                "111111101010101111100101001111111\n" +
                        "100000100000000001010110001000001\n" +
                        "101110100110110000011010001011101\n" +
                        "101110101011001001111101001011101\n" +
                        "101110101100011000111100101011101\n" +
                        "100000101010101011010000101000001\n" +
                        "111111101010101010101010101111111\n" +
                        "000000001111101111100111100000000\n" +
                        "100010111100100001011110111111001\n" +
                        "110111001111111100100001000101100\n" +
                        "011100111010000101000111010001010\n" +
                        "011110000110001111110101100000011\n" +
                        "111111111111111000111001001011000\n" +
                        "111000010111010011010011010100100\n" +
                        "101010100010110010110101010000010\n" +
                        "101100000101010001111101000000000\n" +
                        "000010100011001101000111101011010\n" +
                        "101001001111101111000101010001110\n" +
                        "101101111111000100100001110001000\n" +
                        "000010011000100110000011010000010\n" +
                        "001101101001101110010010011011000\n" +
                        "011101011010001000111101010100110\n" +
                        "111010100110011101001101000001110\n" +
                        "110001010010101111000101111111000\n" +
                        "001000111011100001010110111110000\n" +
                        "000000001110010110100010100010110\n" +
                        "111111101000101111000110101011010\n" +
                        "100000100111010101111100100011011\n" +
                        "101110101001010000101000111111000\n" +
                        "101110100011010010010111111011010\n" +
                        "101110100100011011110110101110000\n" +
                        "100000100110011001111100111100000\n" +
                        "111111101101000101001101110010001";
        s = s.replaceAll("\n", "");
        int r = nextInt(), c = nextInt();
        writer.println(s.charAt(r * 33 + c));
    }

    public static void main(String[] args) throws IOException {
        try (A a = new A()) {
            a.solve();
        }
    }

    @Override
    public void close() throws IOException {
        reader.close();
        writer.close();
    }
}