#include<iostream>
using namespace std;
int n,m;
int minn=500;
void dfs(int x,int t)
{
	if(t>=minn)
	{
		return; 
	}
	if(x==m)
	{
		minn=min(minn,t);
		return;
	}
	else if(x>m)
	{
		dfs(x-1,t+1);
		dfs(x-5,t+1);
		dfs(x-10,t+1);
	}
	else
	{
		dfs(x+1,t+1);
		dfs(x+5,t+1);
		dfs(x+10,t+1);
	}
	
}
int main(){
    cin>>n>>m;
   	dfs(n,0);
   	cout<<minn<<endl;
    return 0;
    }