#line 1 "/workspaces/compro/lib/template.hpp"


#line 1 "/workspaces/compro/lib/io/vector.hpp"
#include <iostream>
#include <vector>

#ifndef IO_VECTOR
#define IO_VECTOR

template <class T> std::ostream &operator<<(std::ostream &out, const std::vector<T> &v) {
  int size = v.size();
  for (int i = 0; i < size; i++) {
    std::cout << v[i];
    if (i != size - 1)
      std::cout << " ";
  }
  return out;
}

template <class T> std::istream &operator>>(std::istream &in, std::vector<T> &v) {
  for (auto &el : v) {
    std::cin >> el;
  }
  return in;
}

#endif
#line 4 "/workspaces/compro/lib/template.hpp"
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(v) (v).begin(), (v).end()
#define coutd(n) cout << fixed << setprecision(n)
#define ll long long int
#define vl vector<ll>
#define vi vector<int>
#define MM << " " <<

using namespace std;

template <class T> void say(bool val, T yes, T no) { cout << (val ? yes : no) << "\n"; }

void say(bool val, string yes = "Yes", string no = "No") { say<string>(val, yes, no); }

template <class T> void chmin(T &a, T b) {
  if (a > b)
    a = b;
}

template <class T> void chmax(T &a, T b) {
  if (a < b)
    a = b;
}

// C++ 17に完全移行したら消す
// 最大公約数を求める
template <class T> T gcd(T n, T m) { return n ? gcd(m % n, n) : m; }

// 最小公倍数を求める
template <class T> T lcm(T n, T m) {
  int g = gcd(n, m);
  return n * m / g;
}

// 重複を消す。計算量はO(NlogN)
template <class T> void unique(std::vector<T> &v) {
  std::sort(v.begin(), v.end());
  v.erase(std::unique(v.begin(), v.end()), v.end());
}


#line 2 "main.cpp"

int enc(int h, int m, int s) { return h * 60 * 60 + m * 60 + s; }

int solve(int A, int B) {
  A %= 12;
  int ans[12] = {0,
                 enc(1, 5, 27),
                 enc(2, 10, 54),
                 enc(3, 16, 21),
                 enc(4, 21, 49),
                 enc(5, 27, 16),
                 enc(6, 32, 43),
                 enc(7, 38, 10),
                 enc(8, 43, 38),
                 enc(9, 49, 5),
                 enc(10, 54, 32),
                 enc(12, 0, 0)};

  int ret = enc(12, 0, 0);
  REP(i, 12) {
    int tmp = ans[i] - enc(A, B, 0);
    if (tmp >= 0)
      chmin(ret, tmp);
  }
  return ret;
  // TODO: edit here
}

// generated by online-judge-template-generator v4.7.1 (https://github.com/online-judge-tools/template-generator)
int main() {
  int A;
  int B;
  std::cin >> A >> B;
  auto ans = solve(A, B);
  std::cout << ans << std::endl;
  return 0;
}