// Problem: 1515_E. Phoenix and Computers
// Time complexity: cubic
import java.util.*;
import java.io.*;

public class _G14 {
    public static void main(String[] args) {
        MyScanner sc = new MyScanner();
        PrintWriter out = new PrintWriter(new BufferedOutputStream(System.out));
        int t = 1;
        while (t-- > 0) {
            int n = sc.nextInt();
            mod = sc.nextLong();
            long res = 0;
            initFac(n + 7);
            long [] tpow = new long[n + 7];
            long [][] combo = new long[n + 6][n + 6];
            for (int i = 0; i <= n; i++) {
                for (int j = 0; j <= i; j++) {
                    if (j == 0 || j == i)
                        combo[i][j] = 1;
                    else
                        combo[i][j] = (combo[i - 1][j - 1] + combo[i - 1][j]) % mod;
                }
            }
            tpow[0] = 1;
            for (int i = 1; i <= n + 6; i++) tpow[i] = (tpow[i - 1] * 2) % mod;
            // dp[i][auto]
            long [][] dp = new long[n + 1][n + 1];
            for (int i = 1; i <= n; i++) dp[i][0] = tpow[i - 1];
            for (int i = 3; i <= n; i++) {
                for (int auto = 1; auto <= n / 2; auto++) {
                    if (!check(i, auto)) continue;
                    long total = 0;
                    for (int j = i - 2; j >= 1; j--) {
                        if (!check(j, auto - 1)) break;
                        int len = i - j - 1;
                        long ways = tpow[len - 1];
                        int picked = j - (auto - 1);
                        long interleave = combo[len + picked][picked];
                        ways = (ways * interleave) % mod;
                        ways = (ways * dp[j][auto - 1]) % mod;
                        total = (total + ways) % mod;
                    }
                    dp[i][auto] = total;
                    if (i == n) res = (res + dp[i][auto]) % mod;
                }
            }
            res = (res + dp[n][0]) % mod;
            out.println(res);
        }
        out.close();
    }

    static boolean check(int n, int auto) {
        int rem = n - auto;
        int seg = auto + 1;
        return rem >= seg;
    }

    static long[] fac;
    static long mod;

    static void initFac(long n) {
        fac = new long[(int)n + 1];
        fac[0] = 1;
        for (int i = 1; i <= n; i++) {
            fac[i] = (fac[i - 1]  * i) % mod;
        }
    }



    static long nck(int n, int k) {
        if (n < k)
            return 0;
        long den = inv((int) (fac[k] * fac[n - k] % mod));
        return fac[n] * den % mod;
    }

    static long pow(long b, long e) {
        long ans = 1;
        while (e > 0) {
            if (e % 2 == 1)
                ans = ans * b % mod;
            e >>= 1;
            b = b * b % mod;
        }
        return ans;
    }

    static long inv(long x) {
        return pow(x, mod - 2);
    }




    static void sort(int[] a) {
        ArrayList<Integer> q = new ArrayList<>();
        for (int i : a) q.add(i);
        Collections.sort(q);
        for (int i = 0; i < a.length; i++) a[i] = q.get(i);
    }

    static void sort(long[] a) {
        ArrayList<Long> q = new ArrayList<>();
        for (long i : a) q.add(i);
        Collections.sort(q);
        for (int i = 0; i < a.length; i++) a[i] = q.get(i);
    }


    //-----------MyScanner class for faster input----------
    public static class MyScanner {
        BufferedReader br;
        StringTokenizer st;

        public MyScanner() {
            br = new BufferedReader(new InputStreamReader(System.in));
        }

        String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

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

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

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

        String nextLine() {
            String str = "";
            try {
                str = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }


    }

}