#include <iostream>
#include <algorithm>
using namespace std;
#define MAXN 101
#define MAXSUM 100000
int A[MAXN];
bool dp[MAXN][MAXSUM];
// 题目可转换为从2n个数中选出n个数,其和尽量接近于给定值sum/2
int main()
{
int n, i, k1, k2, s, u;
cin >> n;
for (i = 1; i <= 2 * n; i++)
cin >> A[i];
int sum = 0;
for (i = 1; i <= 2 * n; i++)
sum += A[i];
memset(dp, 0, sizeof(dp));
dp[0][0] = true;
#include <algorithm>
using namespace std;
#define MAXN 101
#define MAXSUM 100000
int A[MAXN];
bool dp[MAXN][MAXSUM];
// 题目可转换为从2n个数中选出n个数,其和尽量接近于给定值sum/2
int main()
{
int n, i, k1, k2, s, u;
cin >> n;
for (i = 1; i <= 2 * n; i++)
cin >> A[i];
int sum = 0;
for (i = 1; i <= 2 * n; i++)
sum += A[i];
memset(dp, 0, sizeof(dp));
dp[0][0] = true;