little boy Valera study algorithm sort integer array after study theory go practical task as result write program sort array n integer a1a2an nondecrease order the pseudocode program write Valera give the input program get number n array aloop integer variable 1 n1loop integer variable j n1if ajaj1 swap value element aj aj1but Valera mistake have not fully learn sort algorithm if Valera mistake program need counterexample make program work improperly example make program sort array nondecrease order if example give value n do not exist print 1