#include <bits/stdc++.h>
using namespace std;
using Int = long long;
constexpr static int mod = 1e9 + 7;
constexpr static int inf = (1 << 30) - 1;
constexpr static Int infll = (1LL << 61) - 1;
int Competitive_Programming = (ios_base::sync_with_stdio(false), cin.tie(nullptr), cout << fixed << setprecision(15), 0);
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

struct UnionFind
{
public:
	UnionFind() : _sz(0), comp(0) {}
	UnionFind(int n) : _sz(n), comp(n), data(n, -1), ptr(n, 0)
	{
		for (int i = 0; i < n; i++)
			ptr[i] = i;
	}

	bool unite(int x, int y)
	{
		x = root(x), y = root(y);
		if (x == y)
			return false;
		if (data[x] > data[y])
			swap(x, y);
		swap(ptr[x], ptr[y]);
		comp--, data[x] += data[y], data[y] = x;
		return true;
	}

	int root(int k)
	{
		if (data[k] < 0)
			return k;
		return data[k] = root(data[k]);
	}

	int size(int k)
	{
		return -data[root(k)];
	}

	bool same(int x, int y)
	{
		return root(x) == root(y);
	}

	int component()
	{
		return comp;
	}

	vector<int> get_set(int x)
	{
		vector<int> res;
		int y = x;
		res.push_back(x);
		while (ptr[y] != x)
		{
			y = ptr[y];
			res.push_back(y);
		}
		return res;
	}

private:
	vector<int> data, ptr;
	int comp, _sz;
};

int main()
{
	int N, A, B;
	cin >> N >> A >> B;
	UnionFind uf(N);

	for (int i = 0; i < N; i++)
	{
		if (i - A >= 0)
			uf.unite(i, i - A);
		if (i + A < N)
			uf.unite(i, i + A);

		if (i - B >= 0)
			uf.unite(i, i - B);
		if (i + B < N)
			uf.unite(i, i + B);
	}

	cout << (uf.component() == 1 ? "YES\n" : "NO\n");
}