#include<bits/stdc++.h>
using namespace std;
typedef double db;
typedef long long ll;
typedef pair<int, int> pii;
#define fi first
#define se second
#define empb emplace_back
#define all(x) (x).begin(),(x).end()



int main() {
#ifdef local
	freopen("in.txt", "r", stdin);
#endif
	ios::sync_with_stdio(false);
	cin.tie(0), cout.tie(0);
	int n;
	cin >> n;
	vector<pii> edges;
	vector<vector<int> > E(n);
	for(int i = 1, u, v; i < n; i++) {
		cin >> u >> v;
		--u, --v;
		E[u].push_back(edges.size());
		edges.emplace_back(u, v);
		E[v].push_back(edges.size());
		edges.emplace_back(v, u);
	}
	if(n <= 3) {
		cout << "YES\n";
		return 0;
	}
	vector<int> fib = {1, 2};
	int u = 2, v = 1;
	while(u < n) {
		int t = u;
		u = u + v;
		v = t;
		fib.push_back(u);
	}
	if(fib.back() != n) {
		cout << "NO\n";
		return 0;
	}
	vector<int> sz(n);
	vector<bool> used(2 * n - 2);
	function<void(int, int)> prepare = [&](int u, int p) {
		sz[u] = 1;
		for(auto &i : E[u]) {
			int v = edges[i].se;
			if(used[i] || v == p) continue;
			prepare(v, u);
			sz[u] += sz[v];
		}
	};
	function<int(int, int, int)> Find = [&](int u, int p, int d) {
		for(auto &i : E[u]) {
			int v = edges[i].se;
			if(used[i] || v == p) continue;
			if(sz[v] == fib[d - 1] || sz[v] == fib[d - 2]) {
				return sz[v] == fib[d - 1] ? (i ^ 1) : i;
			}
			auto r = Find(v, u, d);
			if(r != -1) {
				return r;
			}
		}
		return -1;
	};
	function<bool(int, int)> ok = [&](int u, int d) {
		if(d <= 2) {
			return true;
		}
		prepare(u, -1);
		int id = Find(u, -1, d);
		if (id == -1) {
			return false;
		}
		int x, y;
		tie(x, y) = edges[id];
		used[id] = used[id ^ 1] = 1;
		if(ok(x, d - 1) && ok(y, d - 2)) {
			return true;
		}
		return false;
	};
	int cur = fib.size() - 1;
	if(ok(0, cur)) {
		cout << "YES\n";
	} else {
		cout << "NO\n";
	}
	return 0;
}
