#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(a) (a).begin(), (a).end()
#define forn(i,a,b) for (int i = a; i <= b; i++)
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define rc(s) return cout<<s,0
#define rcc(s) cout<<s,exit(0)
#define er erase
#define in insert
#define pi pair <int, int>
# define sz(x) (int)((x).size())
#define inf 1000000000
const ll mod = 1000000007;
const int N = 2e5 + 11;
typedef struct celula
{   int nr;
    celula *next;
}* coada;

coada v,p,r;
int n,i,s,minim,maxim,k1,k2,k3,u,y;

void scrieinvers(coada r)
{
     if (r){ scrieinvers(r->next);
     	     cout<<r->nr<<" ";
	       }
}

int32_t main(){

    cout<<"N = "; cin>>n;
    p=NULL;
     if (!n) cout<<"Este vida";
    else {
  	  for(i=1; i<=n; i++){
    	r=new celula;
		cout<<"Nr"<<i<<"="; cin>>r->nr;
	   	r->next=NULL;

        if(p==NULL){ p=r; v=r;}
        else{
        	 v->next=r;
        	 v=r;
		    }
	 }




     maxim=p->nr; minim=p->nr; s=0;
     cout<<endl<<"Lista este:"<<endl;
	 for(r=p; r; r=r->next)
     {
       if (r->nr<minim) minim=r->nr;
	   if (r->nr>maxim) maxim=r->nr;
	   if (r->nr % 2==0) k1++;
	   else k2++;
	   if (r->nr==y && r->nr % 2==0) u=1;
       y=r->nr;
       s=s+r->nr;
	   cout<<r->nr<<' ';
	 }

	 for(r=p; r; r=r->next)
	 {
	   if (r->nr==maxim) k3++;
	 }



	cout<<endl<<endl;
	cout<<"Lista in ordine inversa este:"<<endl;
	scrieinvers(p);




	cout<<endl<<endl;
	cout<<"Suma este = "<<s<<endl;
	cout<<"Media este = "<<1.0*s/n<<endl;
	cout<<"MAXIM = "<<maxim<<endl;
	cout<<"MINIM = "<<minim<<endl;




	if (k1==0) cout<<"Nu sunt nr pare"<<endl; else cout<<"Nr pare="<<k1<<endl;
	if (k2==0) cout<<"Nu sunt nr impare"<<endl; else cout<<"Nr impare="<<k2<<endl;
	if (k3==0) cout<<"Nu-s nr egale cu max"<<endl; else cout<<"Nr egale cu max="<<k3<<endl;
	if (u==0 || n==1) cout<<"Nu-s nr pare consecutive egale"<<endl; else cout<<"Sunt nr pare consecutive egale"<<endl;
	}
}