source_code: import java.io.ByteArrayInputStream;
  import java.io.IOException;
  import java.io.InputStream;
  import java.io.PrintWriter;
  import java.util.ArrayList;
  import java.util.Arrays;
  import java.util.InputMismatchException;
  import java.util.List;
  
  public class Main {
  
  	private static final String NO = "NO";
  	private static final String YES = "YES";
  	InputStream is;
  	PrintWriter out;
  	String INPUT = "";
  
  	private static long MOD = 1000000007;
  	private static final int MAXN = 100000;
  
  	void solve() {
  		int T = 1;// ni();
  		for (int i = 0; i < T; i++) {
  			solve(i);
  		}
  	}
  
  	static final int N = 405;
  	static long[][] dp = new long[N][N];
  	static long[] p2 = new long[N];
  	static long[] fac = new long[N];
  	static long[] ifac = new long[N];
  
  	public static long bino(int n, int k) {
  		return ((fac[n] * ifac[n - k]) % MOD * ifac[k]) % MOD;
  	}
  
  	void solve(int T) {
  		int n = ni();
  		MOD = nl();
  
  		fac[0] = 1;
  		ifac[0] = 1;
  		p2[0] = 1;
  		for (int i = 1; i <= n; ++i) {
  			fac[i] = (fac[i - 1] * i) % MOD;
  			p2[i] = (p2[i - 1] * 2) % MOD;
  		}
  		ifac[n] = power(fac[n], MOD - 2);
  		for (int i = n - 1; i > 0; --i) {
  			ifac[i] = (ifac[i + 1] * (i + 1)) % MOD;
  		}
  		dp[0][0] = 1;
  		for (int i = 0; i <= n; ++i) {
  			for (int j = 0; j <= i; ++j) {
  				for (int k = 1; i + k <= n; ++k) {
  					dp[i + k + 1][j
  							+ k] = (dp[i + k + 1][j + k] + ((dp[i][j] * p2[k - 1]) % MOD * bino(k + j, k)) % MOD) % MOD;
  				}
  			}
  		}
  		long ans = 0;
  		for (int i = 0; i <= n; ++i) {
  			ans = (ans + dp[n + 1][i]) % MOD;
  		}
  
  		out.println(ans);
  	}
  
  	// a^b
  	long power(long a, long b) {
  		long x = 1, y = a;
  		while (b > 0) {
  			if (b % 2 != 0) {
  				x = (x * y) % MOD;
  			}
  			y = (y * y) % MOD;
  			b /= 2;
  		}
  		return x % MOD;
  	}
  
  	private long gcd(long a, long b) {
  		while (a != 0) {
  			long tmp = b % a;
  			b = a;
  			a = tmp;
  		}
  		return b;
  	}
  
  	void run() throws Exception {
  		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
  		out = new PrintWriter(System.out);
  
  		long s = System.currentTimeMillis();
  		solve();
  		out.flush();
  		if (!INPUT.isEmpty())
  			tr(System.currentTimeMillis() - s + "ms");
  	}
  
  	public static void main(String[] args) throws Exception {
  		new Main().run();
  	}
  
  	private byte[] inbuf = new byte[1024];
  	public int lenbuf = 0, ptrbuf = 0;
  
  	private int readByte() {
  		if (lenbuf == -1)
  			throw new InputMismatchException();
  		if (ptrbuf >= lenbuf) {
  			ptrbuf = 0;
  			try {
  				lenbuf = is.read(inbuf);
  			} catch (IOException e) {
  				throw new InputMismatchException();
  			}
  			if (lenbuf <= 0)
  				return -1;
  		}
  		return inbuf[ptrbuf++];
  	}
  
  	private boolean isSpaceChar(int c) {
  		return !(c >= 33 && c <= 126);
  	}
  
  	private int skip() {
  		int b;
  		while ((b = readByte()) != -1 && isSpaceChar(b))
  			;
  		return b;
  	}
  
  	private double nd() {
  		return Double.parseDouble(ns());
  	}
  
  	private char nc() {
  		return (char) skip();
  	}
  
  	private String ns() {
  		int b = skip();
  		StringBuilder sb = new StringBuilder();
  		while (!(isSpaceChar(b))) { // when nextLine, (isSpaceChar(b) && b != '
  									// ')
  			sb.appendCodePoint(b);
  			b = readByte();
  		}
  		return sb.toString();
  	}
  
  	private char[] ns(int n) {
  		char[] buf = new char[n];
  		int b = skip(), p = 0;
  		while (p < n) {
  			if (!(isSpaceChar(b)))
  				buf[p++] = (char) b;
  			b = readByte();
  		}
  		return n == p ? buf : Arrays.copyOf(buf, p);
  	}
  
  	private char[][] nm(int n, int m) {
  		char[][] map = new char[n][];
  		for (int i = 0; i < n; i++)
  			map[i] = ns(m);
  		return map;
  	}
  
  	private int[] na(int n) {
  		int[] a = new int[n];
  		for (int i = 0; i < n; i++)
  			a[i] = ni();
  		return a;
  	}
  
  	private List<Integer> na2(int n) {
  		List<Integer> a = new ArrayList<Integer>();
  		for (int i = 0; i < n; i++)
  			a.add(ni());
  		return a;
  	}
  
  	private int[][] na(int n, int m) {
  		int[][] a = new int[n][];
  		for (int i = 0; i < n; i++)
  			a[i] = na(m);
  		return a;
  	}
  
  	private int ni() {
  		int num = 0, b;
  		boolean minus = false;
  		while ((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'))
  			;
  		if (b == '-') {
  			minus = true;
  			b = readByte();
  		}
  
  		while (true) {
  			if (b >= '0' && b <= '9') {
  				num = num * 10 + (b - '0');
  			} else {
  				return minus ? -num : num;
  			}
  			b = readByte();
  		}
  	}
  
  	private long[] nl(int n) {
  		long[] a = new long[n];
  		for (int i = 0; i < n; i++)
  			a[i] = nl();
  		return a;
  	}
  
  	private long[][] nl(int n, int m) {
  		long[][] a = new long[n][];
  		for (int i = 0; i < n; i++)
  			a[i] = nl(m);
  		return a;
  	}
  
  	private long nl() {
  		long num = 0;
  		int b;
  		boolean minus = false;
  		while ((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'))
  			;
  		if (b == '-') {
  			minus = true;
  			b = readByte();
  		}
  
  		while (true) {
  			if (b >= '0' && b <= '9') {
  				num = num * 10 + (b - '0');
  			} else {
  				return minus ? -num : num;
  			}
  			b = readByte();
  		}
  	}
  
  	private static void tr(Object... o) {
  		System.out.println(Arrays.deepToString(o));
  	}
  
  }