#include <stdio.h>

#include <vector>

#include <list>

#include<iostream>

using namespace std;

struct BinaryTree{

    int weight;

    struct BinaryTree *left,*right;

};

int subtree_count(const struct BinaryTree *root,int m){

    int temp_val;

    static int count = ;

    static int result=;

    int left=;

    int right=;

    int flag=;

    if(count == ){

        flag =;

    }

    count ++;

    if(root==NULL){

        return ;

    }

    if(root->left!=NULL){

        left = subtree_count(root->left,m);

    }

    if(root->right!=NULL){

        right = subtree_count(root->right,m);

    }

    temp_val = left + right+root->weight;

    if(temp_val == m)

        result++;

    if(flag)

        return result;

    else

        return temp_val;

}

int main()

{

    int input=;

    //cin >> input;

    BinaryTree *root1 = new BinaryTree;

    root1->weight=;

    BinaryTree *root2 = new BinaryTree;

    root2->weight=;

    BinaryTree *root3 = new BinaryTree;

    root3->weight=;

    BinaryTree *root4 = new BinaryTree;

    root4->weight=;

    BinaryTree *root5 = new BinaryTree;

    root5->weight=;root4->right=NULL;

    root1->left=root2;

    root1->right=root3;

    root2->left=root4;

    root2->right=root5;

    root4->right=NULL;

    root4->left=NULL;

    root5->right=NULL;

    root5->left=NULL;

    root3->right=NULL;

    root3->left=NULL;

    cout <<subtree_count(root1,input);

    return ;

}