diff --git a/GUI1 b/GUI1
new file mode 100644
index 0000000..489a89f
--- /dev/null
+++ b/GUI1
@@ -0,0 +1,40 @@
+#include <bits/stdc++.h>
+#include <algorithm>
+#include <ext/pb_ds/assoc_container.hpp>
+#include <ext/pb_ds/tree_policy.hpp>
+#define ass 1e18
+#define MOD 1000000007
+#define mp make_pair
+#define pb push_back
+#define fi first
+#define se second
+#define boost ios_base::sync_with_stdio(false);cin.tie(NULL);
+#define debug(x) cout << #x << ": " << x << endl;
+#define debug2(x,y) cout<<#x<<": "<< x<< ", "<< #y<< ": "<< y<< endl;
+#define debug3(x,y,z) cout<<#x<<": "<< x<< ", "<< #y<< ": "<< y<<" "<<#z<<" : "<<z<< endl;
+using namespace std;
+typedef long long int ll;
+#include <ext/pb_ds/assoc_container.hpp> 
+#include <ext/pb_ds/tree_policy.hpp> 
+using namespace __gnu_pbds;   
+#define ordered_set tree<ll, null_type,less<ll>, rb_tree_tag,tree_order_statistics_node_update>
+ll arr[200005];
+int main()
+{
+	boost
+	ll t,ans,sum,sum2,a,n,m,i;
+	cin>>n;
+	sum=0;sum2=0;
+	for(i=0;i<n;i++)
+	{
+		cin>>arr[i];
+		sum+=arr[i];
+	}
+	sort(arr,arr+n);
+	for(i=0;i<n/2;i++)
+		sum2+=arr[i];
+	sum-=sum2;
+	ans=sum*sum+sum2*sum2;
+	cout<<ans;
+	return 0;
+}