void abort() { };
extern int __VERIFIER_nondet_int();
extern _Bool __VERIFIER_nondet_bool();
extern char __VERIFIER_nondet_char();
extern double __VERIFIER_nondet_double();
extern float __VERIFIER_nondet_float();
extern unsigned long __VERIFIER_nondet_ulong();
extern unsigned long long __VERIFIER_nondet_ulonglong();
extern unsigned int __VERIFIER_nondet_uint();
extern int __VERIFIER_nondet_int();
                        
                                                                                                                                                          
                                                                                     
                        
void assume_abort_if_not(int cond) {
  if(!cond) {abort();}
}
/*@ 
    requires (((cond != 0) && (SIZE == 20000001))) && (cond != 0);
    ensures ((((cond != 0) && (\old(SIZE) == SIZE)) && (SIZE == 20000001))) && (1);
@*/
void __VERIFIER_assert(int cond) {
  if (!(cond)) {
    ERROR: {/*@ assert(0); */;abort();}
  }
  return;
}
int SIZE = 20000001;
unsigned int __VERIFIER_nondet_uint();
/*@ 
    requires ((SIZE == 20000001));
    ensures (((\old(SIZE) == SIZE) && (SIZE == 20000001)));
@*/
int main() {
  unsigned int n,i,k;
  n = __VERIFIER_nondet_uint();
  if (!(n <= SIZE)) return 0;
  i = 0;
  // START NAIVELOOPABSTRACTION
  if (i < n) {
  i = __VERIFIER_nondet_uint();
  if (!(i < n)) abort();
  if( i < n ) {
      i = i + 1;
    }
  if (i < n) abort();
  }
  // END NAIVELOOPABSTRACTION
  int j = i;
/*@
loop invariant ((((((n <= 0) && (j == 0)) && (i == 0)) || ((((((((unsigned long long) i * 4294967293) + 60000003) % 4294967296) <= 60000000) && (n <= i)) && (i == j)) && (i <= 20000001))) && (SIZE == 20000001)));
@*/
  while( j < n ) {
    j = j+1;
  }
  k = j;
/*@
loop invariant (((((((k == 0) && (n <= 0)) && (j == 0)) && (i == 0)) || (((((((((unsigned long long) i * 4294967293) + 60000003) % 4294967296) <= 60000000) && (k == j)) && (i == j)) && (i <= 20000001)) && (n <= (j % 4294967296)))) && (SIZE == 20000001)));
@*/
  while( k < n ) {
    k = k+1;
  }
  __VERIFIER_assert((i+j+k)/3 <= SIZE);
  return 0;
}