#include <stdio.h>

void Swaper(int *A, int *B) {
    int C = *A;
    *A = *B;
    *B = C;
}

void Sorts(int t[]) {
    int L = 0;
    int n = 0;

    while (t[n+1] != 0) n++;

    while (L < n) {
        if (t[L] > t[L+1]) {
            Swaper(&t[L], &t[L+1]);
            L = 0;
        } else {
            L++;
        }
    }
}
int main() {
    int k = 0;
    int G[] = {1,1,4,5,1,4,0};
    Sorts(G);
    while (k < 7) {
        printf("%d",G[k]);
        k++;
    }
    
    return 0;
}