#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,sse4.1,sse4.2,popcnt,abm,mmx,avx,tune=native")
#pragma comment(linker, "/stack:200000000"]

#include <iostream>
#include <vector>
#include <cmath>
#include <numeric>
#include <algorithm>
#include <unordered_set>
#include <unordered_map>
#include <set>
#include <map>
#include <queue>
#include <deque>
#include <bitset>
#include <stack>
#include <random>
#include <fstream>
#include <sstream>

#define pb push_back
#define ll long long
#define ld long double
#define all(a) a.begin(), a.end()
#define sz(a) (int)a.size()
#define cinv(v) for (auto& x: v) cin >> x
#define forn(i, n) for (int i = 0; i < n; ++i)
#define forln(i, l, n) for (int i = l; i < n; ++i)

using namespace std;

//tg: @galebickosikasa

const int maxn = (int) 3e5;
const ll inf = (ll) 2e18;
const ld pi = 3.14159265358979323846264;
const ld eps = 1e-8;
const ll mod = (ll)1e9 + 7;

random_device rd;
mt19937 SuperRandom(rd());



int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);
	string a, b;
	cin >> a >> b;
	int i = 0, j = 0, sum = 0;
	while (j < sz(b)) {
		if (i == sz(a)) break;
		while (i < sz(a)) {
			if (j == sz(b)) break;
			sum += a[i] - '0';
			sum %= 10;
			if (sum == b[j] - '0') sum = 0, ++j;
			++i;
		}
	}
	cerr << i << '\n';
	if (j == sz(b) && i == sz(a) && sum == 0) cout << "YES";
	else cout << "NO";

}