#include <stdio.h>
#include <stdlib.h>

#define PRIMES
#define ________(t, l) case t: if(o_ < _o) _O_(_o_, o_, _o); break;
#define _(f, e) case f:for(i=0;i<n;i++) scanf("%d",&_o_[i]); break; case f+1: for(i=0;i<n;i++) printf("%d ",_o_[i]); break; case f+2: _O_(_o_,o_,_o); _O_(_o_,o_+1,_o); break; case f+3: _O_(_o_, o_, _o); break; case f+4: if(o_ < _o) _O_(_o_, o_, _o); break; case f+5: while(_o_[_] < _o) _++;while(_o_[__] > _o) __--; break; case f+6: o_ = _o_[_];_o_[_] = _o_[__]; _o_[__] = o_; _++; __--; break; case f+7: for(i=o; i<=O; i++) {_o_[i]=_o_[o];i++;}; break; case f+8: _o = _o_[(o + O) / 2]; break;
#define _______(h, b) case h+53: _O_(_o_, o_, _o); break;case h+67: while(_o_[_] < _o) _++;while(_o_[__] > _o) __--; break;case h+19: _O_(_o_,o_,_o); _O_(_o_,o_+1,_o);break;_(h+3, b) _(h+73, b) _(h+29, b) _(h+97, b)
#define _____(g, r) case g+137: o_ = _o_[_];_o_[_] = _o_[__]; _o_[__] = o_;_++;__--; break; _(g+139, r) _(g+3, r) _______(g+13, r) _______(g+167, r)
#define __(k, j) _(k+2347, j) _(k+1951, j) _(k+449, j) _(k+509, j) _(k+929, j) _____(k+3, j) _____(k+521, j) _____(k+1579, j) _____(k+1973, j) _____(k+967, j) _______(k+1373, j) _______(k+307, j) ________(k+919, j)
#define ___(l, t) case l+13: _o = _o_[(o + O) / 2];break;_(l+19, t) _(l+2609, t) _(l+3, t) __(l+41, t) __(l+2971, t) _____(l+2687, t) _______(l+5471, t) _______(l+2423, t) ________(l+5443, t) ________(l+2683, t)
#define ____(b, l) __(b+6729, l) ___(b+787, l) _____(b+439, l) _____(b+3, l) _______(b+9089, l) _______(b+307, l) _______(b+6529, l)
#define ______(p, l) __(p+6473, l) __(p+19009, l) ___(p+23017, l) ___(p+3, l) ____(p+8929, l)
#define o(p, l) switch(l+p) {____(p+41131, l) ____(p+30389, l) ____(p+111121, l) ______(p+51511, l) ______(p+3, l) ______(p+81901, l)}
#undef PRIMES

void _O_(int* _o_, int o, int O) {
    int _ = o;
    int __ = O;
    int o_ = 0;
    int n, i, _o;
    o(1505, 9263);
    o(3830, 31189);
    while(_ <= __) {o(6500, 36985);if(_ <= __) {o(9677, 89032);}}
    o(2930, 37582);
    o_ = o;_o = __;o(9929, 25975);
    o_ = _;_o = O;o(4827, 111580);
}

int main() {
    int* _o_;
    int o, O, _, __, n, i, _o, o_;
    printf("Enter number of integers to sort:\n");
    scanf("%d", &n);
    _o_ = (int*)malloc(n*sizeof(int));
    printf("Enter the integers themselves:\n");
    o(9233, 36991);
    o(3543, 100249);
    _o = n-1;
    o_ = 0;
    o(1715, 67022);
    printf("After sort:\n");
    o(2343, 58914)
        printf("\nThank you.\n");
    return 0;
}