#include<bits/stdc++.h>
#define N 200005
using namespace std;
vector<int> fib;
int arr[N];
vector<pair<int, bool>> v[N];
int n;
void no()
{
	cout << "No";
	exit(0);
}
void calculate_size(int u, int fa)
{
	arr[u] = 1;
	for (pair<int, bool> e : v[u])
	{
		if (e.second) continue;
		int v = e.first;
		if (v == fa) continue;
		calculate_size(v, u);
		arr[u] += arr[v];
	}
}
void cut_edge(int u, int fa, int k, int& pu, int& pv, int& kd)
{
	for (pair<int, bool> e : v[u])
	{
		if (pu) return;
		if (e.second) continue;
		int v = e.first;
		if (v == fa) continue;
		if (arr[v] == fib[k - 1] || arr[v] == fib[k - 2])
		{
			pu = u; pv = v;
			kd = (arr[v] == fib[k - 1]) ? k - 1 : k - 2;
			break;
		}
		cut_edge(v, u, k, pu, pv, kd);
	}
}
void check(int u, int k)
{
	if (k <= 1) return;
	calculate_size(u, 0);
	int pu = 0, pv = 0, kd = 0;
	cut_edge(u, 0, k, pu, pv, kd);
	if (!pu) no();
	for (pair<int, bool>& e : v[pu])
		if (e.first == pv) e.second = true;
	for (pair<int, bool>& e : v[pv])
		if (e.first == pu) e.second = true;
	check(pv, kd);
	check(pu, (kd == k - 1) ? k - 2 : k - 1);
}
int main()
{
	ios::sync_with_stdio(false);
	cin >> n;
	fib.push_back(1);
	fib.push_back(1);   
	int k=1;
	while (true)
	{
		if (fib[k] >= n)
			break;
		k++;
		fib.push_back(fib[k-1] + fib[k-2]);
	}
	int a, b;
	for (int i = 1; i < n; i++)
	{
		cin >> a >> b;
		v[a].push_back({ b,false });
		v[b].push_back({ a,false });
	}
	if (fib[k] != n)
		no();
	check(1,k);
	cout << "Yes";
	return 0;
}