// 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
    }
}

import java.util.*;

class Solution {
    public int solution(int[] A) {
        Arrays.sort(A);

        for (int i=0; i<A.length; i++) {
            if 
        }
    }
}

import java.util.*;

class Solution {
    public int solution(int[] A) {
        Arrays.sort(A);

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

import java.util.*;

class Solution {
    public int solution(int[] A) {
        Arrays.sort(A);

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

import java.util.*;

class Solution {
    public int solution(int[] A) {
        Arrays.sort(A);

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

import java.util.*;

class Solution {
    public int solution(int[] A) {
        Arrays.sort(A);

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

import java.util.*;

class Solution {
    public int solution(int[] A) {
        Arrays.sort(A);

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

import java.util.*;

class Solution {
    public int solution(int[] A) {
        Arrays.sort(A);

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

import java.util.*;

class Solution {
    public int solution(int[] A) {
        Arrays.sort(A);

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

import java.util.*;

class Solution {
    public int solution(int[] A) {
        Arrays.sort(A);

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

import java.util.*;

class Solution {
    public int solution(int[] A) {
        Arrays.sort(A);

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

import java.util.*;

class Solution {
    public int solution(int[] A) {
        Arrays.sort(A);

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

import java.util.*;
import java.arra
class Solution {
    public int solution(int[] A) {
        Arrays.sort(A);

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

import java.util.*;

class Solution {
    public int solution(int[] A) {
        Arrays.sort(A);

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

        return A.length 
    }
}

import java.util.*;

class Solution {
    public int solution(int[] A) {
        Arrays.sort(A);

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

        return A.length + 1;
    }
}

import java.util.*;

class Solution {
    public int solution(int[] A) {
        Arrays.sort(A);

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

import java.util.*;

class Solution {
    public int solution(int[] A) {
        Arrays.sort(A);

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

import java.util.*;

class Solution {
    public int solution(int[] A) {
        Arrays.sort(A);

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