#include<iostream>
    #include<cstdio>
    #include<iomanip>
    #include<cassert>
    #include<string>
    #include<cmath>
    #include<iostream>
    #include<cmath>
    #include<sstream>
    #include<stdio.h>
    #include<stdlib.h>
     using namespace std;

  struct memnode;
  typedef memnode*mem;
  struct memnode
   {
    int kye;
    int val;
    mem left = NULL;
    mem right = NULL;
   }; 

  mem memroot = NULL;

  int fetch(mem&root,int k);

  int fetch(int k) 
   {
    if(k <= 0) return 1;
    else return(memroot,k);
   }

  int fetch(mem&root,int k)
   {
    if(root == NULL)
     {
      root = new memnode;
      root->kye = k;
      root->val = fetch(k/6)+fetch(k/3)+fetch(k/2);
      return root->val;
     }
    else if(root->kye == k)
     return root->val;
    else if(k < root->kye)
     return fetch(root->left,k);
    else
     return fetch(root->right,k);
   }

  int main()
   {
    return 1;
   }