#include<stdio.

h>

int square_number ( int a ) {

int so_chinh_phuong = 0 ;
int i;
for ( i = 1 ; i <= a ; i++ ) {
if ( i * i == a) {
so_chinh_phuong++;
}
}
return so_chinh_phuong;
}

int prime_number ( int a ) {

int i ;
int nguyen_to = 0;
if ( a < 2 ) {
return 0;
} else {
for ( i = 1 ; i <= a / 2 ; i++) {
if ( a % i == 0) {
nguyen_to++;
}
}
}
return nguyen_to;
}

void output_array ( int array[] , int n) {

int i;
printf ("Mang so nguyen vua nhap la :");
for ( i = 0 ; i <= n ; i++) {
printf ("%d ", array[i]);
}
}

void input_array ( int array[] , int n , char str[]) {

int i;
for ( i = 0 ; i <= n ; i++) {
printf ("\nNhap %d[%d] =",str, i);
scanf ("%d", &array[i]);
}
}

void even_elements ( int array[] , int n) {

printf ("\nCac phan tu chan trong mang :");
int i;
for ( i = 0 ; i <= n ; i++) {
if ( array[i] % 2 == 0 ) {
printf ("%d ", array[i]);
}
}
}

void not_end_7 ( int array[] , int n) {

int i;
printf ("\nCac phan tu khong tan cung la 7 la :");
for ( i = 0 ; i <= n ; i++) {
if ( array[i] % 7 != 0) {
 printf ("%d ", array[i]);
}
}

void countSquareInArray ( int array[] ,int n) {

int count = 0;
int i;
for ( i = 0 ; i <= n ; i++) {
if ( square_number(array[i])==1) {
count++;
}
}
printf ("\nCo %d phan tu la so chinh phuong trong mang ", count);
}

void sumPrimeInArray ( int array[] , int n) {

int sum = 0;
int i;
for ( i = 0 ; i <= n ; i++) {
if (prime_number(array[i])==1) {
sum=sum+array[i];
}
}
printf ("\nCac phan tu la so nguyen to co tong la %d", sum);
}

void notOddSquareInArray( int array[], int n) {

int sum_even_square = 0;
int count_even_square = 0;
int i;
for ( i = 0 ; i <= n ; i++) {
if ( !(square_number(array[i])==1 && array[i] % 2 != 0)) {
sum_even_square+=array[i];
count_even_square++;
}
}
if ( count_even_square == 0 ) {
printf ("Khong co so chinh phuong , khong tinh duoc");
} else {
printf ("\nTrung binh cac so khong phai la chinh phuong le la : %f",
(double)sum_even_square/(double)count_even_square);
}
}
int main () {
// Nhap n so lieu cho mang
printf ("Enter n :");
int n;
scanf ("%d", &n);
int arr[30] , b[30];
input_array(arr , n , "a");
input_array(b , n, "b");

// Hien mang vua nhap

output_array(arr , n);

// Hien cac phan tu thoa man dieu kien nao do

// Hien cac phan tu chan trong mang
 even_elements (arr , n);
// Hien cac phan tu khong tan cung la 7
not_end_7(arr, n);

// Co bao nhieu phan tu la so chinh phuong trong mang

countSquareInArray(arr , n);
// Tong cac phan tu la so nguyen to trong mang
sumPrimeInArray(arr, n);
// Tinh trung binh cac phan tu khong la chinh phuong le trong mang
notOddSquareInArray(arr , n);

return 0;
}