#include<bits/stdc++.h>
using namespace std;

int main(){
    int N;cin>>N;
    vector<int> prime,p(200010,1);
    for(int i = 0;i<=200000;++i){
        if(p[i]){
            for(int j=2;j*i<=200000;++j){
                p[i*j] = 0;
            }
        }
    }
    vector<int> dp(200001,0);
    for(int i=2;i<=200000;++i){
        if(p[i]){
            prime.push_back(i);
            dp[i] = 1;
        }
    }
    
    for(int i=0;i<prime.size();++i){
        for(int sum = 0;sum<=200000;++sum){
            if(sum-prime[i]<0) continue;
            if(dp[sum-prime[i]]) ++dp[sum];
        }
    }
    
    cout<<dp[N]<<endl;
}