斐波那契数列

#include <iostream>

using namespace std;
int n,a,b,p;
int f(int x){
    if(x <= 2){
        return 1;
    }
    return (a*f(x-1)+b*f(x-2))%p;
}
int main()
{
    cin>>n>>a>>b>>p;
    cout<<f(n)<<endl;
    return 0;
}