#include <bits/stdc++.h>
using namespace std;
#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 pb push_back
#define MP(a, b) make_pair((a), (b))
template <class T> vector<T> make_vec(size_t a, T val) {
    return vector<T>(a, val);
}
template <class... Ts> auto make_vec(size_t a, Ts... ts) {
    return vector<decltype(make_vec(ts...))>(a, make_vec(ts...));
}
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using Graph = vector<vector<int>>;
template <typename T> struct edge {
    int to;
    T cost;
    edge(int t, T c) : to(t), cost(c) {}
};
template <typename T> using WGraph = vector<vector<edge<T>>>;
const int INF = 1 << 30;
const ll LINF = 1LL << 60;
const int MOD = 1e9 + 7;
const double eps = 0.000001;

int main() {
    int A, B;
    cin >> A >> B;
    int sec = A * 3600 + B * 60;
    const double av = 360.0 / (12.0 * 60.0 * 60.0);
    const double bv = 360.0 / (60.0 * 60.0);
    double adeg = av * sec;
    double bdeg = bv * B * 60;
    if(adeg > 360.0 - eps)
        adeg -= 360.0;
    if(bdeg > 360.0 - eps)
        bdeg -= 360.0;
    if(adeg > bdeg - eps) {
        cout << (int)((adeg - bdeg) / (bv - av) + eps) << endl;
    } else {
        cout << (int)((360.0 - bdeg + adeg) / (bv - av) + eps) << endl;
    }
}