#include using namespace std; using ll = long long; using pll = pair; #define drep(i, cc, n) for (ll i = (cc); i <= (n); ++i) #define rep(i, n) drep(i, 0, n - 1) #define all(a) (a).begin(), (a).end() #define pb push_back #define fi first #define se second const ll MOD = 1000000007; const ll MOD2 = 998244353; const ll INF = 1LL << 60; const ll N_MAX = 2e5; int main(){ ll a, b, c; cin >> a >> b >> c; ll x; cin >> x; ll g_ab = __gcd(a, b); ll g_bc = __gcd(b, c); ll g_ca = __gcd(c, a); ll g_abc = __gcd(a, g_bc); if(x%g_abc == 0){ cout << "Yes" << endl; }else{ cout << "No" << endl; } }