#include<string>
#include<deque>
#include<queue>
#include<vector>
#include<algorithm>
#include<iostream>
#include<set>
#include<cmath>
#include<tuple>
using namespace std;
typedef long long int llint;
#define mp make_pair
#define mt make_tuple
#define pub push_back
#define puf push_front
#define pob pop_back
#define pof pop_front
#define fir first
#define sec second
#define res resize
#define ins insert
#define era erase
const llint mod=1000000007;
const llint big=1e9+1e8;
const llint red=0xE869120;
const llint pro=1002001;
int main(void){
	llint ans,ansa,n,m;
	ans=1;ansa=0;
	cin>>n>>m;
	for(int i=2;i<=n;i++){
		ans=ans+ansa;
		ans%=m;
		swap(ans,ansa);
	}
	cout<<ansa<<endl;
	return 0;
}