n=int(input())
l=list(map(int,input().split()))
l1=[]
for i in range(1,n+1):
l1.append(i)
k=set(l1)-set(l)
for i in k:
print(i)#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
n = n;
int a[n];
for(int i=0; i<n-1; i++) {
cin >> a[i];
}
sort(a, a+n-1);
for(int i=0; i<n; i++) {
if(a[i] != (i+1)) {
cout << (i+1);
break;
}
}
return 0;
}
1529A - Eshag Loves Big Arrays | 19. Remove Nth Node From End of List |
925. Long Pressed Name | 1051. Height Checker |
695. Max Area of Island | 402. Remove K Digits |
97. Interleaving String | 543. Diameter of Binary Tree |
124. Binary Tree Maximum Path Sum | 1465. Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts |
501A - Contest | 160A- Twins |
752. Open the Lock | 1535A - Fair Playoff |
1538F - Interesting Function | 1920. Build Array from Permutation |
494. Target Sum | 797. All Paths From Source to Target |
1547B - Alphabetical Strings | 1550A - Find The Array |
118B - Present from Lena | 27A - Next Test |
785. Is Graph Bipartite | 90. Subsets II |
1560A - Dislike of Threes | 36. Valid Sudoku |
557. Reverse Words in a String III | 566. Reshape the Matrix |
167. Two Sum II - Input array is sorted | 387. First Unique Character in a String |