#include <bits/stdc++.h>
//#include <atcoder/all>
#define rep(i, a) for (int i = (int)0; i < (int)a; ++i)
#define rrep(i, a) for (int i = (int)a - 1; i >= 0; --i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define RREP(i, a, b) for (int i = (int)a - 1; i >= b; --i)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define popcount __builtin_popcount
using ll = long long;
constexpr ll mod = 1e9 + 7;
constexpr ll INF = 1LL << 60;

// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")
template <class T>
inline bool chmin(T &a, T b)
{
	if (a > b)
	{
		a = b;
		return true;
	}
	return false;
}
template <class T>
inline bool chmax(T &a, T b)
{
	if (a < b)
	{
		a = b;
		return true;
	}
	return false;
}

ll gcd(ll n, ll m)
{
	ll tmp;
	while (m != 0)
	{
		tmp = n % m;
		n = m;
		m = tmp;
	}
	return n;
}

ll lcm(ll n, ll m)
{
	return abs(n) / gcd(n, m) * abs(m); //gl=xy
}

using namespace std;
//using namespace atcoder;

vector<int>ans;

void f(int h,int m,int s){
	ans.eb(h*3600+m*60+s);
}
void solve(){
	int a,b;
	cin>>a>>b;
	f(12,0,0);
	f(1,5,27);
	f(2,10,54);
	f(3,16,21);
	f(4,21,49);
	f(5,27,16);
	f(6,32,43);
	f(7,38,10);
	f(8,43,38);
	f(9,49,5);
	f(10,54,32);
	a%=12;
	if(a==0&&b==0){
		cout<<0<<"\n";
		return;
	}
	int cur=a*3600+b*60;
	for(int i=0;i<100000;++i){
		for(auto x:ans){
			if(cur==x){
				cout<<i<<"\n";
				return;
			}
		}
		cur++;
	}
}


int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cout << fixed << setprecision(15);
	solve();
	return 0;
}