#include<bits/stdc++.h>

using namespace std;

int main()
{
    void *p = malloc(100);
    cout<<sizeof(p);
    return 0;
}


/*


 //Definition for a binary tree node.
  struct TreeNode {
      int val;
      TreeNode *left;
      TreeNode *right;
      TreeNode() : val(0), left(nullptr), right(nullptr) {}
      TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
      TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
  };
 
class Solution {
public:
    TreeNode* dfs(vector<int>& nums,int l,int r)
    {
        if(l>r)return nullptr;
        int temp = l;
        for(int i = l;i<=r;i++)
        {
            if(nums[i]>nums[temp])
            temp = i;
        }
        TreeNode* cur = new TreeNode(nums[temp]);
        cur->left = dfs(nums,l,temp-1);
        cur->right = dfs(nums,temp+1,r);
        return cur;
    }
    TreeNode* constructMaximumBinaryTree(vector<int>& nums) {
        return dfs(nums,0,nums.size()-1);
    }
};

int main()
{

    return 0;
}*/