// you can also use imports, for example:
// import java.util.*;

// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");

class Solution {
    public int solution(int[] A) {
        // write your code in Java SE 8
    }
}

// you can also use imports, for example:
// import java.util.*;

// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");

class Solution {
    public int solution(int[] A) {
        // write your code in Java SE 8
    }
}

#include <bits/stdc++.h>

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)

    // sort
    sort(A.begin(), A.end());

    for(int i=0; i<A.size(); i++){
        if(A[i] != i+1){
            return i+1;
        }
    }
}

#include <bits/stdc++.h>

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)

    // sort
    oi
    sort(A.begin(), A.end());

    for(int i=0; i<A.size(); i++){
        if(A[i] != i+1){
            return i+1;
        }
    }
}

#include <bits/stdc++.h>

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)

    // sort
    if(A.size() != 0){
        return 1;
    }
    
    sort(A.begin(), A.end());

    for(int i=0; i<A.size(); i++){
        if(A[i] != i+1){
            return i+1;
        }
    }
}

#include <bits/stdc++.h>

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)

    // sort
    if(A.size() != 0){
        return 1;
    }

    sort(A.begin(), A.end());

    for(int i=0; i<A.size(); i++){
        if(A[i] != i+1){
            return i+1;
        }
    }
}

#include <bits/stdc++.h>

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)

    // sort
    if(A.size() != 0){
        return 1;
    }

    sort(A.begin(), A.end());

    for(int i=0; i<=A.size(); i++){
        if(A[i] != i+1){
            return i+1;
        }
    }
}

#include <bits/stdc++.h>

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)

    // sort
    if(A.size() = 0){
        return 1;
    }

    sort(A.begin(), A.end());

    for(int i=0; i<=A.size(); i++){
        if(A[i] != i+1){
            return i+1;
        }
    }
}

#include <bits/stdc++.h>

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)

    // sort
    if(A.size() == 0){
        return 1;
    }

    sort(A.begin(), A.end());

    for(int i=0; i<=A.size(); i++){
        if(A[i] != i+1){
            return i+1;
        }
    }
}

#include <bits/stdc++.h>

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)

    // sort
    if(A.size() == 0){
        return 1;
    }

    sort(A.begin(), A.end());

    for(int i=0; i<=A.size(); i++){
        if(A[i] != i+1){
            return i+1;
        }
    }
}

#include <bits/stdc++.h>

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)

    // sort
    if(A.size() == 0){
        return 1;
    }

    sort(A.begin(), A.end());

    for(int i=0; i<=A.size(); i++){
        if(A[i] != i+1){
            return i+1;
        }
    }
}