‎
 
#include <iostream> 
using namespace std; 
 
typedef long long LL; 
 
const int MAX_N = 100; 
 
LL c[MAX_N][MAX_N]; 
 
int main() { 
  int n = 66; 
  c[0][0] = 1; 
  for (int i=1; i<=n; i++) { 
    c[i][0] = c[i][i] = 1; 
    for (int j=1; j<i; j++) 
      c[i][j] = c[i-1][j] + c[i-1][j-1]; 
  } 
 
  LL k = c[66][33]; 
  int sum = 0; 
  for (; k>0; k/= 10) 
    sum += (k%10); 
  cout << sum << endl; 
 
  return 0; 
}