#pragma GCC optimize("O3")
#include<bits/stdc++.h> 
using namespace std;
using ll=long long;
using P=pair<ll,ll>;
template<class T> using V=vector<T>; 
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
const ll inf=(1e18);
//const ll mod=998244353;
const ll mod=1000000007;
const vector<int> dy={-1,0,1,0},dx={0,-1,0,1};
ll GCD(ll a,ll b) {return b ? GCD(b,a%b):a;}
ll LCM(ll c,ll d){return c/GCD(c,d)*d;}
struct __INIT{__INIT(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(20);}} __init;
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
template<class T>void debag(const vector<T> &a){cerr<<"debag :";for(auto v:a)cerr<<v<<" ";cerr<<"\n";}
template<class T>void print(const vector<T> &a){for(auto v:a)cout<<v<<" ";cout<<"\n";}
#include <boost/multiprecision/cpp_int.hpp>
namespace mp = boost::multiprecision;
using Bint = mp::cpp_int;
int main(){
   string s,p;
   cin>>p>>s;
   Bint b(s);
   if(b==0){
       cout<<p<<"\n";
       return 0;
   }
   bool t=(p[0]=='-');
   if(p.front()=='-'){
        reverse(all(p));
        p.pop_back();
        reverse(all(p));
   }
   ll res=t;
   b--;
   V<int> f(10,0);
   f[0]=6;
   f[1]=2;
   f[2]=5;
   f[3]=5;
   f[4]=4;
   f[5]=5;
   f[6]=6;
   f[7]=4;
   f[8]=7;
   f[9]=6;
   int n=p.size();
   for(int i=0;i<n;i++){
       res+=f[int(p[i]-'0')];
   }
   while(b>0){
         if(res>10){
             int tmp=res;
             res=0;
             while(tmp){
                   res+=f[tmp%10];
                   tmp/=10;
             }
         }
         else if(f[res]==res){
              cout<<res<<"\n";
              return 0;
         }
         else{
             res=f[res];
         }
         b--;
   }
   cout<<res<<"\n";
}