#include <bits/stdc++.h>
using namespace std;
const int mod = 10000007;
const int maxn = 200009;
bool comp(int x, int y) { return x > y; }
void printarr(int arr[], int n) {
  for (int i = 0; i < n; ++i) std::cerr << arr[i] << (i < n - 1 ? ' ' : '\n');
}
template <typename T>
void printv(T &a) {
  for (auto it = a.begin(); it != a.end(); ++it) std::cerr << *it << ' ';
  std::cerr << '\n';
}
long long int ans;
int arr[maxn];
void solve() {
  bool ok = false;
  int n, m, k, q;
  std::cin >> n;
  ans = 0;
  ans = n / 3;
  if (n % 3 == 2) ans++, n--;
  long long int res = ans / 12;
  std::cout << res << ' ' << ans - res * 12;
  std::cout << '\n';
}
void sol() {}
void fastio() {
  std::ios_base::sync_with_stdio(false);
  std::cin.tie(0);
}
int main() {
  fastio();
  int testcases = 1;
  for (int t = 0; t < testcases; ++t) solve();
  return 0;
}
