#include <stdio.h>

void sort(int *p, int n) {
     int min, pos, aux;
     for(int i = 0; i < n - 1; i++) {
         min = p[i];
         pos = i;
         for(int j = i + 1; j < n; ++j) {
             if(p[j] < min) {
               min = p[j];
               pos = j;
             }
         }
         aux = p[pos];
         p[pos] = p[i];
         p[i] = aux;
     }
}

int main(int argc, char const *argv[]) {

  int vec[100], n,
      arr[100], freq[100], k = 0;

  printf("N = ");
  scanf("%d", &n);
  for(int i = 0; i < n; ++i) scanf("%d", &vec[i]);
  for(int i = 0; i < n; ++i) printf("%d ", vec[i]);
  printf("\n");
  sort(vec, n);
  arr[k] = vec[k];
  freq[k] = 1;
  for(int i = 0; i < n - 1; i++) {
      if(vec[i] == vec[i+1]) {
        freq[k]++;
      } else {
        k++;
        arr[k] = vec[i+1];
        freq[k] = 1;
      }
  }

  for(int i = 0; i <= k; i++) {
      if(freq[i] == 1) printf("Elementul %d apare o singura data!\n",arr[i]);
      else
                       printf("Elementul %d apare de %d ori!\n",arr[i], freq[i]);
  }

  return 0;
}