#include using i32 = std::int32_t; using u32 = std::uint32_t; using i64 = std::int64_t; using u64 = std::uint64_t; using i128 = __int128_t; using u128 = __uint128_t; using isize = std::ptrdiff_t; using usize = std::size_t; class rep { struct Iter { usize itr; constexpr Iter(const usize pos) noexcept: itr(pos) { } constexpr void operator ++ () noexcept { ++itr; } constexpr bool operator != (const Iter& other) const noexcept { return itr != other.itr; } constexpr usize operator * () const noexcept { return itr; } }; const Iter first, last; public: explicit constexpr rep(const usize first, const usize last) noexcept: first(first), last(std::max(first, last)) { } constexpr Iter begin() const noexcept { return first; } constexpr Iter end() const noexcept { return last; } }; template using Vec = std::vector; constexpr usize SEG[] = { 6, 2, 5, 5, 4, 5, 6, 4, 7, 6 }; u64 f(const u64 x) { if (x < 10) { return SEG[x]; } return SEG[x % 10] + f(x / 10); } u64 take_mod(const std::string& S, const u64 mod) { u64 ret = 0; for (const auto c: S) { ret = (ret * 10) % mod; ret += c - '0'; ret %= mod; } return ret; } void F_main() { std::string P; std::cin >> P; std::string N; std::cin >> N; if (N == "0") { std::cout << P << '\n'; return; } std::array A{}; std::reverse(P.begin(), P.end()); if (P.back() == '-') { A[1] += 1; P.pop_back(); } while (!P.empty()) { A[1] += SEG[P.back() - '0']; P.pop_back(); } for (auto i: rep(1, 1000)) { A[i + 1] = f(A[i]); } if (N.size() <= 4) { const auto n = std::stoi(N); if (n <= 1000) { std::cout << A[n] << '\n'; return; } } Vec loop; std::array done{}; { u64 x = A[1000]; while (!done[x]) { loop.push_back(x); done[x] = true; x = SEG[x]; } } std::cout << loop[take_mod(N, loop.size()) - 1000 % loop.size()] << '\n'; return; } int main() { std::ios_base::sync_with_stdio(false); std::cin.tie(nullptr); F_main(); return 0; }