Given N integers, you are supposed to find the smallest positive integer that is NOT in the given list.

Input Specification:

Each input file contains one test case. For each case, the first line gives a positive integer N (≤). Then N integers are given in the next line, separated by spaces. All the numbers are in the range of int.

Output Specification:

Print in a line the smallest positive integer that is missing from the input list.

Sample Input:

105 -25 9 6 1 3 4 2 5 17

Sample Output:

7 注意点：考虑两种极端情况； 1.所有数都小于零 2.所有数都大于1

1 #include
     
       2 #include
      
        3 #include
       
         4 using namespace std; 5 int main(){ 6   int n, i; 7   cin>>n; 8   vector
        
          v(n); 9   for(i=0; i
         
          >v[i];10   sort(v.begin(), v.end());11   if(v[0]>1)cout<
          
           <
           
            =0) break;15 bool flag=true;16 for(; i
            
             1){18 cout<
             
              <