#include <iostream>
#include <sstream>
#include <iomanip>
#include <string>
#include <vector>
#include <array>
#include <bitset>
#include <algorithm>
#include <limits>
#include <cmath>
#include <queue>
#include <numeric>
#include <tuple>
#include <stack>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <optional>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
using pint = pair<int, int>;
constexpr double PI = 3.141592653589793;
constexpr ll MOD = 1e9 + 7;
constexpr ll mod = 998244353;
constexpr ll INF = 1LL << 60;
const vector<int> dy = { 0, 1, 0, -1 };
const vector<int> dx = { 1, 0, -1, 0 };
const vector<int> DY = { 0, 1, 1, 1, 0, -1, -1, -1 };
const vector<int> DX = { 1, 1, 0, -1, -1, -1, 0, 1 };
#define vec2d(T, name, n, m, ini) vector<vector<T>> name(n, vector<T>(m, ini))
#define vec3d(T, name, n, m, l, ini) vector<vector<vector<T>>> name(n, vector<vector<T>>(m, vector<T>(l, ini)))
#define REP(i, e) rep(i, 0, e)
#define rep(i, s, e) for (ll i = s; i < (e); ++i)
#define rrep(i, s, e) for (ll i = s; i >= (e); --i)
#define all(x) (x).begin(), (x).end()

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);

	ll n, m;
	cin >> n >> m;
	ll f1 = 0, f2 = 1;
	rep(i, 2, n) {
		ll tmp = (f1 + f2) % m;
		f1 = f2;
		f2 = tmp;
	}
	cout << f2 << "\n";
	return 0;
}