#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> P;
typedef vector<ll> VI;
typedef vector<VI> VVI;
#define REP(i,n) for(int i=0;i<(n);i++)
#define ALL(v) v.begin(),v.end()
constexpr ll MOD=1000000007;
constexpr ll INF=2e18;

int seg[10]={6,2,5,5,4,5,6,4,7,6};

int main(){
    string s; cin >> s;
    int n=s.size();
    string t; cin >> t;
    int m=s.size();
    if(t=="0"){
        cout << s << endl;
        return 0;
    }
    ll a=0;
    REP(i,m){
        if(s[i]=='-')
            a++;
        else
            a+=seg[s[i]-'0'];
    }
    map<int,int> mp, pm;
    mp[a]=1; pm[1]=a;
    int now=2;
    while(1){
        ll nxt=0;
        while(a){
            nxt+=seg[a%10];
            a/=10;
        }
        a=nxt;
        if(mp[a])
            break;
        mp[a]=now; pm[now]=a;
        now++;
    }
    int d=now-mp[a];
    ll tmp=mp[a], pw=1;
    bool f=0;
    for(int i=m-1;i>=0;i--){
        tmp-=pw*(t[i]-'0');
        pw*=10;
        if(tmp<=0){
            f=1;
            break;
        }
    }
    if(!f){
        cout << pm[stoi(t)] << endl;
        return 0;
    }
    ll md=d-(mp[a]%d);
    pw=1;
    for(int i=m-1;i>=0;i--){
        md=(md+pw*(t[i]-'0'))%d;
        pw=pw*10%d;
    }
    cout << pm[mp[a]+md] << endl;
    return 0;
}