#include #include using namespace std; int n; vector e(20); vector v(20, 0); bool fg = 0; void dfs(int cnt) { if (cnt == n) { int cnt1 = 0, cnt2 = 0, cnt3 = 0; for (int i = 0; i < n; i++) { if (v[i] == 0) { cnt1 += e[i]; } else if (v[i] == 1) { cnt2 += e[i]; } else { cnt3 += e[i]; } } if (cnt1 == cnt2 && cnt2 == cnt3) { fg = 1; } return; } for (int i = 0; i < 3; i++) { v[cnt] = i; dfs(cnt + 1); } return; } int main() { cin >> n; for (int i = 0; i < n; i++) { cin >> e[i]; } dfs(0); if (fg) { cout << "Yes" << endl; } else { cout << "No" << endl; } return 0; }