This year, as in previous years, MemSQL is inviting the top 25 competitors from the Start[c]up qualification round to compete onsite for the final round. Not everyone who is eligible to compete onsite can afford to travel to the office, though. Initially the top 25 contestants are invited to come onsite. Each eligible contestant must either accept or decline the invitation. Whenever a contestant declines, the highest ranked contestant not yet invited is invited to take the place of the one that declined. This continues until 25 contestants have accepted invitations.After the qualifying round completes, you know K of the onsite finalists, as well as their qualifying ranks (which start at 1, there are no ties). Determine the minimum possible number of contestants that declined the invitation to compete onsite in the final round.

The first line of input contains K (1 ≤ K ≤ 25), the number of onsite finalists you know. The second line of input contains r1, r2, ..., rK (1 ≤ ri ≤ 106), the qualifying ranks of the finalists you know. All these ranks are distinct.

Print the minimum possible number of contestants that declined the invitation to compete onsite.

NoteIn the first example, you know all 25 onsite finalists. The contestants who ranked 1-st, 13-th, and 27-th must have declined, so the answer is 3.

#include <iostream>
#include <cstdlib>
using namespace std;

int main()
{
   long int k,*a,c=0;
   cin>>k;
   a=(long int*)malloc(sizeof(long int)*k);
   for(long int i=0;i<k;i++)
   {
       cin>>a[i];
       if(a[i]>c){c=a[i];}
   }
   if(c>=25){cout<<c-25;}
   else{cout<<0;}
    return 0;

}

#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;
int n,m,a[30];
int main()
{
	scanf("%d",&n);
	for(int i=1;i<=n;i++)
	{
		scanf("%d",&a[i]);
		m=max(m,a[i]);
	}
	if(m>25) printf("%d",m-25);
	else printf("0");
	return 0;
}

#include<bits/stdc++.h>
using namespace std;
int a[2000],n,x,ans,m;
int main()
{
	cin>>n;
	while(n--) cin>>x,m=max(m,x);
	if(m<=25) cout<<0;
	else cout<<m-25;
	return 0;
}

#include<bits/stdc++.h>
using namespace std;
int main(){
	int n;
	cin>>n;
	int a[n];
	for(int i=0;i<n;i++){
		cin>>a[i];
	}
	sort(a,a+n);
	if(a[n-1]<25)cout<<0;
	else
	cout<<a[n-1]-25;
}

#include <bits/stdc++.h>

#define fr(i,a,b) for (int i = a; i < b; i++)
#define pb push_back
#define MOD 1000000009
#define fi first
#define sec second
#define EPS 1e-7
#define sc1(a) scanf ("%d", &a)

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> pll;
typedef pair<int, int> ii;
typedef pair<ii, int> iii;
typedef pair<ii, pair<string, string> > iiis;
typedef pair<double, double> dd;
typedef vector<int> vi;
typedef vector<ii> vii;

int const inf = 0x3f3f3f3f;

int a[26];

int main() {
	int n;
	scanf("%d", &n);

	for(int i = 0; i < n; i++) {
		scanf("%d", &a[i]);
	}

	sort(a, a + n);
	int resp = 0;

	for(int i = 0; i < n; i++) {
		resp = max(resp, a[i]);
	}

	printf("%d\n", max(0, resp - 25));

	return 0;
}

#define _CRT_SECURE_NO_WARNINGS
#include <limits.h>
#include <math.h>
#include <numeric>
#include <cstring>
#include <fstream>
#include <map>
#include <iostream>
#include <utility>
#include <set>
#include <algorithm>
#include <bitset>
#include <queue>
#include <functional>
#include <assert.h>
#include <ctime>
#include <utility>
#include <stack>
#include <stdint.h>
#define SI(i) scanf("%d ", &i)
#define SII(i,j) scanf("%d%d", &i, &j)
#define SIII(i,j, k) scanf("%d%d%d", &i, &j, &k)
#define SF(i) scanf("%.9lf", &i)
#define SFF(i,j) scanf("%.9lf%.9lf", &i, &j)
#define SFFF(i,j, k) scanf("%.9lf%.9lf%.9lf", &i, &j, &k)
#define SL(i) scanf("%I64", &i)
#define SLL(i,j) scanf("%I64%I64", &i, &j)
#define SLLL(i,j, k) scanf("%I64 %I64 %I64", &i, &j, &k)
#define SS(i) scanf("%s\n", i)
#define SSS(i,j) scanf("%s %s", i, j)
#define SC(i) scanf("%c ", &i)
#define SCC(i,j) scanf("%c %c\n", &i, &j)

#define PI(i) printf("%d ", i)
#define PI2(i) printf("%d", i)
#define PII(i,j) printf("%d %d ", i, j)
#define PL(i) printf("%I64 ", i)
#define PLS(i) printf("%I64", i)
#define PLL(i,j) printf("%I64 %I64 ", i, j)
#define PS(i) printf("%s", i)
#define PSS(i,j) printf("%s %s ", i, j)
#define PC(i) printf("%c", i)
#define PCC(i,j) printf("%c%c ", i, j)
#define PN printf("\n")
#define forin(i, k, n) for(int32_t i = (k); i < (n); ++i)
#define forin2(i, k, n) for(int32_t i = (k); i <= (n); ++i)
#define rforin(i, k, n) for(int32_t i = (k); i > (n); --i)
#pragma comment(linker, "/STACK:100000000000")
using namespace std;
int k, ks, mx = 0;
int main() {
#ifdef _DEBUG
	freopen("1.in", "rt", stdin);
	freopen("1.out", "wt", stdout);
#endif
	SI(k);
	forin(i, 0, k) {
		SI(ks);
		mx = max(mx, ks);
	}
	mx = max(mx, 25);
	PI(mx - 25);
	return 0;
}

#include<bits/stdc++.h>
using namespace std;
int k,a[26];
int main()
{
    cin>>k;
    for (int i=0;i<k;i++)
        cin>>a[i];
    sort(a,a+k);
    int kq=a[k-1]-25;
    if (kq<0) cout<<"0";
    else cout<<kq;
}

#include <iostream>
#include <algorithm>
using namespace std;

int main(){

 int n=0,k=0,anw=0,sup=0;
 cin>>n;

 int *a=new int [n];
 int *b=new int [n];

 for(int i=0;i<n;i++){
     cin>>a[i];
     if(a[i]>25)b[k++]=a[i];
 }
 if (k==0){cout<<0;return 0;}

 anw=k;

 sort(b,b+k);

 sup=25;
 for(int i=0;i<k;i++){
    anw=anw+(b[i]-sup-1);
    sup=b[i];
 }
 cout<<anw;
 return 0;
}

#include <bits/stdc++.h>
using namespace std;
int main()
{
	int kkk[25],n;
	cin>>n;
	for(int i=0;i<n;i++)
	{
		cin>>kkk[i];
	}
	sort(kkk,kkk+n);
	if(kkk[n-1]<=25)
	{
		cout<<'0';
		return 0;
	}
	else cout<<kkk[n-1]-25;
	return 0;
}

#include<bits/stdc++.h>
using namespace std;
int main()
{
	int n,a,maxx=-1;
	scanf("%d",&n);
	for(int i=1;i<=n;++i)
	{
		scanf("%d",&a);
		maxx=max(maxx,a);
	}
	if(maxx<=25)
	{
		cout<<0<<endl;
	}
	else
	{
		cout<<maxx-25<<endl;
	}
	return 0;
}

#include <iostream>
using namespace std;
int a[26],i,k,maxx,ans;
int main()
{
 	cin>>k;
    for(i=0;i<k;i++)
     cin>>a[i];

    maxx=a[0];
    for(i=0;i<k;i++)
     if(maxx<a[i]) maxx=a[i];

    if (maxx>25) ans=maxx-25;
            else ans=0;

    cout<<ans;

   // system("pause");

}

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
int n,m;
int main()
{
    scanf("%d",&n);
    while(n--)
    {
        int a;
        scanf("%d",&a);
        m=max(m,a);
    }
    printf("%d",max(m-25,0));
    return 0;
}

#include <iostream>
using namespace std;
int k,a,maxx;
int main()
{
cin>>k;
for (int i=0; i<k; i++)
{
cin>>a;
if (a>maxx) maxx=a;
}
if ((maxx-25)<0) cout<<0<<endl;
else cout<<maxx-25<<endl;
return 0;
}

#include<iostream>
#include<cstdio>
#define reg register
#define ios ios::sync_with_stdio(false)
using namespace std;
int main()
{
	ios;int K,maxn=0;
	cin>>K;
	for(reg int i=1,rank;i<=K;i++)
	{
		cin>>rank;
		maxn=max(maxn,rank);
	}
	cout<<max(maxn-25,0);
    return 0;
}

#include<bits/stdc++.h>

using namespace std;

int n,maxn=0;

int main() {
	cin>>n;
	for(int i=1;i<=n;i++) {
		int x;
		cin>>x;
		maxn=max(x,maxn);
	}

	if(maxn>25) cout<<maxn-25<<endl;
	else cout<<0<<endl;

	return 0;
}

#include<bits/stdc++.h>
using namespace std;
int main(){
	int a,b,s[100000],ans=0,mx=-99999;
	cin>>a;
	for(int i=0;i<a;i++){
		cin>>s[i];
		mx=max(mx,s[i]);
	}
	cout<<max(mx-25,ans);
}

#include<bits/stdc++.h>
using namespace std;
#define FS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll long long int
#define MAX_INT 100000
#define ld long double
#define pb push_back
#define mp make_pair
#define pu push
#define vsz(v) cout<<v.size()<<endl;
#define printv(v) for(ll i=0;i<v.size();i++)cout<<v[i]<<" "; cout<<endl;
#define printa(a,n) for(ll i=0;i<n;i++)cout<<a[i]<<" ";cout<<endl;
#define printrv(v) for(ll i=v.size()-1;i>=0;i--)cout<<v[i]<<" "; cout<<endl;
#define printvpair(v) for(ll i=0;i<v.size();i++)cout<<v[i].first<<" "<<v[i].second<<endl;
#define sz size()
#define ff first
#define ss second
#define vll vector<ll>
#define vbool vector<bool>
#define vpll vector<pair<ll,ll>>
#define vvpll vector<vector<pair<ll,ll>>>
#define qll queue<ll>
#define dqll deque<ll>
#define pll pair<ll,ll>
#define vllv vector<vector<ll>>
#define vstr vector<string>
#define setpri(x) cout<<setprecision(x);
#define all(v) v.begin(),v.end()
#define allr(v) v.rbegin(),v.rend()
#define scana(a,n) for(ll i=0;i<n;i++)cin>>a[i];
#define inf 1000000000000
#define yes cout<<"YES"<<endl
#define no cout<<"NO"<<endl
#define yesr {cout<<"YES"<<endl;return;}
#define nor {cout<<"NO"<<endl;return;}
ll MOD=1e9+7;
ll ceil1(ll n,ll x){if(n%x==0)return n/x; else return (n/x)+1;}
ll gcd(ll a,ll b){return __gcd(a,b);}
ll lcm(ll a,ll b){return (max(a,b)/gcd(a,b))*min(a,b);}
ll pow1(ll n,ll k,ll mm){
    if(k==0)return 1;
    if(k%2==0)return (pow1((n%mm)*(n%mm),k/2,mm))%mm;
    return ((n%mm)*(pow1((n%mm)*(n%mm),k/2,mm)%mm))%mm;
}
ll pow2(ll n,ll k){ll ans=1;
	while(k>0){
        if(k%2==1)ans=ans*n;n=n*n;k/=2;
    }return ans;
}
ll modinv(ll A,ll M){return pow1(A,M-2,M);}
ll fact(ll n){ll s=1; for(ll i=1;i<=n;i++)s*=i; return s;}
ll factmod(ll n,ll mod){ll s=1; for(ll i=1;i<=n;i++){s*=i;s%=mod;} return s;}
vll fact1tonmod(ll n,ll mod){vll  ans(n+1);ans[0]=ans[1]=1;
	for(ll i=2;i<=n;i++)ans[i]=(ans[i-1]*i)%mod;
	return ans;
}
ll ncrmod(ll n,ll r,ll mod){
	ll ans=((((factmod(n,mod)%mod)*(modinv(factmod(r,mod),mod)%mod))%mod)*(modinv(factmod(n-r,mod),mod)))%mod;
	return ans;
}
ll ncr(ll n,ll r){if(n==1 || r==0)return 1;if(r>n/2)r=n-r;
	ll ans=1;for(ll i=1;i<=r;i++){ans=((ans * n )/i);n--;}return ans;
}
ll ncrsum(ll n,ll r, ll mod){
	if(n==1 || r==0)return 1;
	ll ans=1,sum=1;for(ll i=1;i<=r;i++){ans=(((ans * n )/i)%mod);n--;sum+=ans;sum%=mod;}return sum;
}
bool isprime(ll n){if(n==1 || (n!=2 && n%2==0))return false; if(n==2)return true;
		for(ll i=3;i<=sqrt(n);i+=2)if(n%i==0)return false; return true; }
vll createprime(ll n){
	vector<bool> prime(n+1,true);vll ans;;prime[0]=prime[1]=false;
	for(ll i=2;i*i<=n;i++)if(prime[i])for(ll j=i*i;j<=n;j+=i)prime[j]=false;
	for(ll i=2;i<=n;i++)if(prime[i])ans.pb(i);
	return ans;
}
vbool createprimebool(ll n){
	vector<bool> prime(n+1,true);prime[0]=prime[1]=false;
	for(ll i=2;i*i<=n;i++)if(prime[i])for(ll j=i*i;j<=n;j+=i)prime[j]=false;
	return prime;
}
vll factor(ll n){
	vll ans;
	if(n>0)ans.pb(1);if(n==2)ans.pb(2);
	for(ll i=2;i*i<=n;i++){if(n%i==0){ans.pb(i);if(n/i!=i)ans.pb(n/i);}}if(n>2)ans.pb(n);
	return ans;
}
ll numoffactor(ll n){ return factor(n).sz;}
bool func(pair<ll,ll> &a,pair<ll,ll> &b ){
	if(a.ff != b.ff)return a.ff < b.ff;
	return a.ss > b.ss;
}
void solve(){
    ll i,j,k,n,m,x,y,z,d,l;
	cin>>n;
	vll a(n);
	scana(a,n);
	vll b(n);
	b=a;
	sort(all(a));
	ll ans=0;
	ll p=0;
	for(i=0;i<n;i++){
		ans+= (a[i]-p -1);
		p=a[i];
		// cout<<ans<<endl;
	}
	cout<<max(0ll,ans - (25-n))<<endl;

}
int main(){
	FS;
	ll i,j,k,n,m,x,y,z,q;
	q=1;
	 //cin>>q;
	while(q--){
		solve();
	}
	return 0;
}

#include <iostream>
#include <cstdlib>
#include <vector>
#include <math.h>
#include <algorithm>

using namespace std;

int main()
{

  int n; cin >> n;
  std::vector<int> onsight;
  int maxnum(0);
  for( int i=0 ; i < n;i++)
  {
    int a; cin >> a;
    onsight.push_back(a);
    maxnum = max(maxnum,a);
  }

  sort(onsight.begin(),onsight.end());

  //cout<< "sorted onsight list\n";
  //for( int i=0 ; i < n;i++)
  //{
  //  cout<< onsight[i] << endl;
  //}

  int numDeclines(0);
  if ( maxnum < 25)
  {
    cout << 0;
  }
  else
  {
    cout << maxnum - 25;
  }

  return 0;
}

#include <iostream>
using namespace std;
 int main()
 {
	 int k; cin>>k;
	 int t; cin>>t; int m=t;
	 for (int i=0; i<k-1; i++)
	 {
		 cin>>t;
		 if (t>m) m=t;
	 }
	 if (m-25<=0) cout<<0<<endl;
	 else cout<<m-25<<endl;
	 return 0;
 }

#include <iostream>
#include <string>
#include <vector>

using namespace std;

int main()
{
	int n, x, max,i;
	cin >> n;
	cin >> max;
	for (i = 1; i < n; i++)
	{
		cin >> x;
		if (x > max)
			max = x;
	}
	if (max - 25 > 0)
		cout << max - 25;
	else
		cout << 0;
	getchar();
	getchar();
	return 0;
}

#include <bits/stdc++.h>

using namespace std;

int main(){
    int m,l;
    cin>>m;
    int a[m];
    for(int i=0;i<m;i++){
        cin>>a[i];
    }

    sort(a,a+m);
    if(a[m-1]<=25)
    cout<<"0";
    else
   { l=a[m-1]-25;
    cout<<l;}
    return 0;

}

#pragma comment(linker, "/STACK:512000000")
#define _CRT_SECURE_NO_WARNINGS

#include <iostream>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <cmath>
#include <cassert>
#include <sstream>

using namespace std;

#define forn(i, n) for (int i = 0; i < int(n); i++)
#define for1(i, n) for (int i = 1; i <= int(n); i++)
#define forv(i, v) forn(i, v.size())

#define all(x) x.begin(), x.end()
#define pb push_back
#define mp make_pair

#define CIN_FILE "input.txt"
#define COUT_FILE "output.txt"

typedef long double ld;
typedef long long ll;
typedef pair<int, int> pii;

int main()
{

    int k, r;

    cin >> k;
    int maxr = 0;
    forn(i, k)
    {
    	cin >> r;
    	maxr = max(maxr, r);
    }

    cout << max(0, maxr - 25) << endl;
    return 0;
}

#include<bits/stdc++.h>
using namespace std;
int main(){
	int a,b,mx=-999;
	cin>>a;
	for(int i=0;i<a;i++){
		cin>>b;
		if(mx<b){
			mx=b;
		}
	}
	if(mx<=25){
		cout<<0;
	}
	else{
		cout<<mx-25;
	}
}

#include<bits/stdc++.h>
using namespace std;

#define MOD 1000000007
#define N 100010

typedef double lf;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef set<ll> sll;
typedef vector<ll> vll;
typedef vector<pair<ll,ll > >vpll;
typedef vector<vll > vvll;

#define sd(a) scanf("%d",&a)
#define sstr(a) scanf("%s",a)
#define sl(a) scanf("%lld",&a)
#define debug(a) printf("check%d\n",a)
#define clr(a) memset(a,0,sizeof(a))
#define rtn return
#define gc getchar
#define pb push_back
#define ff first
#define ss second
#define mp(x,y) make_pair(x,y)
#define all(a) a.begin(),a.end()
#define allr(a) a.rbegin(),a.rend()
#define lp(i,b) for(ll i = ll(0); i<ll(b) ; i++)
#define lpit(it,a) for(__typeof(a.begin()) it = a.begin(); it != a.end(); ++it)
#define mid(s,e) (s+(e-s)/2)
#define min3(a,b,c)	min(a,min(b,c))
#define max3(a,b,c)	max(a,max(b,c))

ll ip(){
	ll x = 0; bool isNeg = false; char c;
	c = gc();
	if(c == '-')	isNeg = true , c = gc();
	for( ; c >= '0'  && c <= '9' ; c = gc()); x = (x << 1) + (x << 3) + c - '0';
	if(isNeg)	x *= -1;	return x;
}
//////////////////////////////////////////// CONTAINERS FOR FUNCTIONS MENTIONED IN TEMPLATE ///////////////////////////////////
#define MAX 100005
//bool isPrime[MAX];
//int spf[MAX];
//////////////////////////////////////////// FUNCTIONS THAT NEED COMMENTED OUT CONTAINERS ////////////////////////////////////

//void prime_sieve(){ for(ll i=2 ; i*i<=MAX ; i++){	if(!isPrime[i]){ for(ll j=i*i ; j<=MAX ; j+=i)	isPrime[j] = 1;} } 	}
//void spf_sieve(){	for(ll i=2 ; i<MAX ; i+=2)	spf[i] = 2;
//	for(ll i=3 ; i<MAX ; i+=2){	if(!isPrime[i]){ spf[i] = i; for(ll j=i ; (j*i)<MAX ; j+=2){ if(!isPrime[i*j])	isPrime[i*j] = true , spf[i*j] = i; } } }
//}
//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
inline ll ncr(ll n,ll r){ ll ans = 1 ; if(r > n-r) r = n-r; lp(i,r+1){ans*=(n-i) ; ans/=(i+1); } rtn ans; }
inline ll gcd(ll a,ll b){if(!a) rtn b; rtn gcd(b%a,a); }
inline ll fme(ll x,ll n){ll ans=1;x%=MOD;while(n>0){if(n&1){ ans*=x;ans%=MOD;} x*=x;x%=MOD;n>>=1;}rtn ans%MOD;}
inline bool isPalin(string &s){	int len = s.size()-1;lp(i,(len/2)+2){if(!(s[i]==s[len-i]))	rtn false;} rtn true;}
inline ll lcm(ll a,ll b){rtn (a*b)/gcd(a,b); }
inline ll fmm(ll a,ll b) {ll r=0;a%=MOD;b%=MOD;while(b>0){if(b&1){r+=a;r%=MOD;}a+=a;a%=MOD;b>>=1;}rtn r%MOD;}
inline ll sfme(ll a,ll b) {ll r=1;a%=MOD;while(b>0){if(b&1)r=fmm(r,a);a=fmm(a,a);b>>=1;}rtn r%MOD;}
ll makeNum(string &str){ll a = 0;	lpit(it, str){ int num = *it - '0';	a = a*10 + num;} return a;}
inline int in(){ int NR=0; register char c=gc(); while( c < 48 || c > 57 ){c=gc();}
	while(c>47 && c< 58){	NR = (NR << 3) + (NR << 1) + (c - 48); c=gc();} return NR;
}

ll dx[] = {0,0,1,-1}, dy[] = {1,-1,0,0};
//--------------------------------TEMPLATE ENDS HERE--------------------------------------------------//

set<ll> s;

int main(){
	ll t, n, m, type;
	// START HERE //
	ll k;
	cin >> k;
	//vll v(k);
	lp(i, k){
		cin >> n;
		s.insert(n);
	}
	ll ans = 0;

	ll cnt = 25 - k;

	ll last = *(s.rbegin());

	for(ll i = 1; i <= last ; i++){
		if( s.find(i) == s.end() ){
			if( cnt > 0 ){
				cnt--;
			}else{
				ans++;
			}
		}
	}

	cout << ans << "\n";

	return 0;
}

/*Mrc01*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
#define ll long long
#define ull unsigned long long
#define f(i,x,n) for(ll int i=x;i<n;i++)
#define re(j,x,n) for(ll int j=x;j>=n;j--)
#define f1(k,x,n) for(ll int k=x;k<=n;k++)
#define mp make_pair
#define pb push_back
#define bit(x, i) (x >>(i - 1) & 1ll)
#define MAX 1000001
const int mod=1000000007;
using namespace __gnu_pbds;
using namespace std;
typedef tree<pair<ll int,ll int>,null_type, less<pair<ll int,ll int>>, rb_tree_tag,tree_order_statistics_node_update>
      new_data_set;
void solve()
{
    ll int k;
     cin>>k;
    ll int a[k];
    f(i,0,k)
     cin>>a[i];
    sort(a,a+k);
    ll int all=a[0]-1;
    f(i,1,k)
      all+=a[i]-a[i-1]-1;
    if(all-(25-k)<0)
      cout<<0;
    else
    cout<<all-(25-k);
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    // // ll int t;
    // //  cin>>t;
    // while(t--)
    {
       solve();
    }
    return 0;
}

// luogu-judger-enable-o2
#include<iostream>
#include<cstring>
#include<algorithm>

using namespace std;

const int kMaxN = 25 + 5 ;

int n, a[kMaxN], maxx;

int main(){

	cin >> n ;

	for(int i = 1 ; i <= n ; i++){
		cin >> a[i] ;
		maxx = max(maxx, a[i]);
	}

	if(maxx>25){
		cout << (maxx - 25) ;
	}

	else{
		cout << 0 ;
	}

	return 0;

}

#include <bits/stdc++.h>
using namespace std;

int main() {
	// your code goes here
	int k;
	cin>>k;
	int* a=new int[k];
	for(int i=0;i<k;i++)
	cin>>a[i];
	sort(a,a+k);
	if(k==25){
	    int c=a[0]-1;
	    for(int i=1;i<k;i++){
	        c+=(a[i]-a[i-1]-1);
	    }
	    cout<<c<<endl;
	}
	else{
	    if(a[k-1]<=25)
	    cout<<"0"<<endl;
	    else{
	        int s=0;
	        int* b=new int[k];
	        b[0]=a[0]-1;
	        for(int i=1;i<k;i++){
	            b[i]=(a[i]-a[i-1])-1;
	            s+=b[i];
	        }
	        s+=b[0];
	        cout<<(s-25+k)<<endl;
	    }
	}
	return 0;
}

#include<bits/stdc++.h>
using namespace std;
int main(){
	int n;
	cin>>n;
	int a[n];
	for(int i=0;i<n;i++){
		cin>>a[i];
	}
	sort(a,a+n);
	if(a[n-1]<25)cout<<0;
	else
	cout<<a[n-1]-25;
}

#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
    int n,a=0,m=0;
    cin>>n;
    for(int i=1;i<=n;i++)
    {
    	cin>>a;
    	m=max(m,a);
    }
    if(m<25)
    cout<<"0";
    else
    cout<<m-25;
    return 0;
}

#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <cmath>
#include <algorithm>
#include <functional>
#include <bitset>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <queue>
#include <stack>
#include <list>
using namespace std;

int main() {
	ios::sync_with_stdio(false); cin.tie(0);

	int n; cin >> n;

	int cnt = 0;
	int mx = INT_MIN;

	for (int i = 0; i < n; i++) {
		int x; cin >> x;

		if (x > 25) {
			cnt++;
		}

		mx = max(mx, x);
	}

	if (cnt == 0) cout << 0;
	else cout << mx - 25;
}

#include "bits/stdc++.h" // template by Benq
using namespace std; // Debug template by neal

using ll = long long;
using ld = long double;
using db = double;
using str = string;

#define pb push_back
#define eb emplace_back
#define mp(a, b) make_pair(a, b)
#define f first
#define s second
#define si(a) ((int)(a).size())
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define rs resize
#define ins insert
#define sor(a) sort(all(a))
#define int long long
#define trav(i, a) for(auto& i: a)

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
int rand(int a, int b) { return uniform_int_distribution<int>(a, b)(rng); }

template<class T> bool ckmin(T& a, const T& b) { return a > b ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
template<class T> void uni(vector<T>& v) { sor(v); v.erase(unique(all(v)), end(v)); }
constexpr int cdiv(const int& a, const int& b) { return a / b + ((a ^ b) > 0 && a % b); } // (a / b) rounded up
constexpr int fdiv(const int& a, const int& b) { return a / b - ((a ^ b) < 0 && a % b); } // (a / b) rounded down
int power(int a, int b, int c) { int res = 1; a %= c; while(b > 0) { if(b & 1) res = res * a % c; a = a * a % c; b >>= 1; } return res; }
int power(int a, int b) { int res = 1; while(b > 0) { if(b & 1) res = res * a; a = a * a; b >>= 1; } return res; }

// INPUT
template <class T> istream& operator >> (istream& is, vector<T>& hld) { for(int i = 0; i < si(hld); ++i) { cin >> hld[i]; } return is; }
template <class T> istream& operator >> (istream& is, vector<vector<T>>& hld) { for(int i = 0; i < si(hld); ++i) { cin >> hld[i]; } return is; }
template <class T, class U> istream& operator >> (istream& is, pair<T, U>& hld) { is >> hld.first >> hld.second; return is; }

// DEBUG
template <class T, class H> ostream& operator << (ostream &os, const pair<T, H> &p) { return os << '(' << p.f << ", " << p.s << ')'; }
template <class T_container, class T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type> ostream& operator << (ostream& os, const T_container& v) { os << '{'; string sep; for(const T& x: v) os << sep << x, sep = ", "; return os << '}'; }

void dbg_out() { cerr << endl; }
template <typename Head, typename... Tail> void dbg_out(Head H, Tail... T) { cerr << "[" << H << "]"; if(sizeof...(T)) { cerr << ", "; } dbg_out(T...); }

#ifdef LOCAL
#define dbg(...) cerr << "[" << #__VA_ARGS__ << "]: ", dbg_out(__VA_ARGS__)
#else
#define dbg(...)
#endif

// FILE I/O
void setIn(string s) { freopen(s.c_str(), "r", stdin); }
void setOut(string s) { freopen(s.c_str(), "w", stdout); }
void unsyncIO() { ios_base::sync_with_stdio(0); cin.tie(0); cout << fixed << setprecision(10); }
void setIO(string s = "") { unsyncIO(); if(si(s)) { setIn(s + ".in"); setOut(s + ".out"); } }

const string nl = "\n";
const int MX = 2e5 + 5;
const ll INF = 1e18;
const ll MOD = 1e9 + 7; // 998244353
const ld PI = acos((ld)-1);
const ld EPS = 1e-8;

int n;
vector<int> a;

int32_t main() {
	setIO();

	cin >> n;
	a.rs(n);
	cin >> a;
	cout << max(0LL, *max_element(all(a)) - 25) << nl;
}

#include <iostream>
using namespace std;
int k,a,maxx;
int main()
{
cin>>k;
for (int i=0; i<k; i++)
{
cin>>a;
if (a>maxx) maxx=a;
}
if ((maxx-25)<0) cout<<0<<endl;
else cout<<maxx-25<<endl;
return 0;
}

#include<bits/stdc++.h>
using namespace std;
int main() {
    int k, mx=0, t;
    cin>>k;
    while(k--){
        cin>>t;
        mx = max(mx, t);
    }
    cout<<(mx>25?mx-25:0);
}

#include <bits/stdc++.h>
using namespace std;
int n,a,x;
int main()
{
    scanf("%d",&n);
    for (int i=1;i<=n;i++)
    {
        scanf("%d",&a);
        x=max(a,x);
    }
    printf("%d",max(x-25,0));
    return 0;
}

#include<bits/stdc++.h>
using namespace std;
int k,x,m;
int main()
{
    cin>>k;
    while(k--)cin>>x,m=max(m,x);
    if(m<25)cout<<0;
    else cout<<m-25;
    return 0;
}

#include<bits/stdc++.h>
#define ll long long int
using namespace std;
int main(){
    ll n, ans = 0;
    cin >> n;
    ll l[ n + 1 ];
    for( int i = 1 ; i <= n ; i ++ ){
        cin >> l[ i ];
    }
    sort( l + 1, l + 1 + n );
    cout << max( ans, l[ n ] - 25 );
}

#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    ll int n;
    cin>>n;
    ll int a[n],max=-1;
    for(ll int i=0;i<n;i++)
    {
        cin>>a[i];
        if(max<a[i])
        max=a[i];
    }
    if(max<=25)
    cout<<"0";
    else
    cout<<max-25;
}

#include<cstdio>
#define sacnf scanf
#define pritnf printf
#define srnad srand
#define rnad rand
#define sl(sl_a) strlen(sl_a)
#define gt(gt_a) goto gt_a
#define mst(mst_a,mst_b) memset(mst_a,mst_b,sizeof(mst_a))
#define fora(fora_x,fora_a,fora_b) for(re nti (fora_x)=(fora_a);(fora_x)<=(fora_b);++(fora_x))
#define forb(forb_x,forb_a,forb_b) for(re nit (forb_x)=(forb_a);(forb_x)>=(forb_b);--(forb_x))
#define foral(foral_x,foral_a,foral_b) for(re ll (foral_x)=(foral_a);(foral_x)<=(foral_b);++(foral_x))
#define forbl(forbl_x,forbl_a,forbl_b) for(re ll (forbl_x)=(forbl_a);(forbl_x)>=(forbl_b);--(forbl_x))
#define re register
#define inl inline
#define br break
#define con continue
#define stt struct
#define nms namespace
#define gc getchar
#define rt return
#define infa (0x3f3f3f3f)
#define infb (0x7fffffff)
#define infd (0x7f)
#define in(in_a) freopen("F:/""/in"in_a".in","r",stdin)
#define out(out_a) freopen("F:/""/out"out_a".out","w",stdout)
#define fin(filein_a) freopen(filein_a".in","r",stdin)
#define fout(fileout_a) freopen(fileout_a".out","w",stdout)
#define finout(file_a) fin(file_a);fout(file_a)
typedef long long ll;
typedef int itn,nti,tin,tni,nit;
using namespace std;
const nit maxa=1004;
const nit maxb=54;
const nit maxc=4;
const tni maxd=34;
const nit num=25;

tni n,x,maxx=0,ans=0;

tin main()
{
	scanf("%d",&n);
	fora(i,1,n)
	{
		scanf("%d",&x);
		if(x>maxx)
		{
			maxx=x;
		}
	}
	//
	ans=maxx-num;
	if(ans<0)
	{
		ans=0;
	}
	//
	pritnf("%d\n",ans);
	rt 0;
}

#pragma GCC optimize(2)
#pragma GCC optimize(3)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline")
#pragma GCC optimize("-fgcse")
#pragma GCC optimize("-fgcse-lm")
#pragma GCC optimize("-fipa-sra")
#pragma GCC optimize("-ftree-pre")
#pragma GCC optimize("-ftree-vrp")
#pragma GCC optimize("-fpeephole2")
#pragma GCC optimize("-ffast-math")
#pragma GCC optimize("-fsched-spec")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-falign-jumps")
#pragma GCC optimize("-falign-loops")
#pragma GCC optimize("-falign-labels")
#pragma GCC optimize("-fdevirtualize")
#pragma GCC optimize("-fcaller-saves")
#pragma GCC optimize("-fcrossjumping")
#pragma GCC optimize("-fthread-jumps")
#pragma GCC optimize("-funroll-loops")
#pragma GCC optimize("-fwhole-program")
#pragma GCC optimize("-freorder-blocks")
#pragma GCC optimize("-fschedule-insns")
#pragma GCC optimize("inline-functions")
#pragma GCC optimize("-ftree-tail-merge")
#pragma GCC optimize("-fschedule-insns2")
#pragma GCC optimize("-fstrict-aliasing")
#pragma GCC optimize("-fstrict-overflow")
#pragma GCC optimize("-falign-functions")
#pragma GCC optimize("-fcse-skip-blocks")
#pragma GCC optimize("-fcse-follow-jumps")
#pragma GCC optimize("-fsched-interblock")
#pragma GCC optimize("-fpartial-inlining")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("-freorder-functions")
#pragma GCC optimize("-findirect-inlining")
#pragma GCC optimize("-fhoist-adjacent-loads")
#pragma GCC optimize("-frerun-cse-after-loop")
#pragma GCC optimize("inline-small-functions")
#pragma GCC optimize("-finline-small-functions")
#pragma GCC optimize("-ftree-switch-conversion")
#pragma GCC optimize("-foptimize-sibling-calls")
#pragma GCC optimize("-fexpensive-optimizations")
#pragma GCC optimize("-funsafe-loop-optimizations")
#pragma GCC optimize("inline-functions-called-once")
#pragma GCC optimize("-fdelete-null-pointer-checks")
#include<bits/stdc++.h>
using namespace std;
int kkksc03,x,mmax;
template<class T> inline void read(T &re)
{
    re=0;T sign=1;char tmp;
    while((tmp=getchar())&&(tmp<'0'||tmp>'9')) if(tmp=='-') sign=-1;re=tmp-'0';
    while((tmp=getchar())&&(tmp>='0'&&tmp<='9')) re=re*10+(tmp-'0');re*=sign;
}
int main()
{
    read(kkksc03);
    while(kkksc03--){read(x);mmax=max(mmax,x);}
    if (mmax<25){putchar('0');putchar('\n');return 0;}
    printf("%d\n",mmax-25);
    return 0;
}

#include <bits/stdc++.h>
using namespace std;
int i, cnt, mx, n;
int main(){
	cin >> n;
	for(i = 1;i <= n; i++){
		cin >> cnt;
		mx = max(mx, cnt);
	}
	cout << max(0, mx - 25);
}

// ConsoleApplication1.cpp : Defines the entry point for the console application.
//

#include <iostream>
#include <algorithm>
#include <concrt.h>
#include <conio.h>
#include <stdio.h>
#include <string>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <queue>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <stack>
#include <utility>
#include <vector>
#include <stdio.h>
#include <ctype.h>
#include <Windows.h>

#define ll long long int

int gcd(int a, int n)
{
	do
	{
		if (a > n) a -= n;
		else if (a < n) n -= a;
	} while (a != n);
	return n;
}

bool funct_sort_down(int a, int b)
{
	return a < b;
}

using namespace std;

int main()
{
	char mas[101];
	ll i, sh = 0, number, SL = 0, SF = 0;
	cin >> number;
	for (i = 0; i < number; i++)
	{
		cin >> SL;
		SF = max(SF, SL);
	}
	if (SF <= 25)
		cout << "0";
	else
		cout << SF - 25;

	return 0;
}

#include <cstdio>

int max(int a,int b){return(a>b?a:b);}

int n,Max,a;

int main()
{
    scanf("%d",&n);
    while(n--)
    {
        scanf("%d",&a);
        Max=max(Max,a);
    }
    printf("%d",max(Max-25,0));
    return 0;
}

#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;
int n,m,a[30];
int main()
{
	scanf("%d",&n);
	for(int i=1;i<=n;i++)
	{
		scanf("%d",&a[i]);
		m=max(m,a[i]);
	}
	if(m>25) printf("%d",m-25);
	else printf("0");
	return 0;
}

#include<bits/stdc++.h>
using namespace std;
int k, maxn, a[300];
int main() {
    scanf("%d",&k);
    for(int i = 1; i <= k; i++) scanf("%d",&a[i]);
    for(int i = 1; i <= k; i++)
        maxn = max(maxn, a[i]);
    maxn -= 25;
    printf("%d",max(maxn, 0));
    return 0;
}

#include<bits/stdc++.h>
using namespace std;

int main()
{
    int k,max=0,temp;
    cin>>k;
    for (int i = 0; i < k; ++i)
    {
    	cin>>temp;
    	if (temp>max)
    		max=temp;
    }
    temp=max-k;
    if (temp<(25-k))
    	cout<<0;
    else
    	cout<<temp+k-25;
 }

#include <string>
#include <vector>
#include <map>
#include <list>
#include <iterator>
#include <set>
#include <queue>
#include <iostream>
#include <sstream>
#include <stack>
#include <deque>
#include <cmath>
#include <memory.h>
#include <cstdlib>
#include <cstdio>
#include <cctype>
#include <algorithm>
#include <utility>
#include <assert.h>
#include <time.h>
#include <fstream>
#include <sys/stat.h>
#include <stdlib.h>
#include <stdio.h>
using namespace std;

typedef                                     unsigned long long int ull;
typedef                                     signed long long int sll;
typedef                                     long double lld;
typedef                                     vector<int>vi;
typedef                                     vector<long>vl;
typedef                                     vector<long long int>vll;
typedef                                     vector<double>vd;
typedef                                     vector<long double>vld;
typedef                                     vector<char>vc;
typedef                                     vector<string>vs;
typedef                                     pair<int,int>pii;
typedef                                     pair<long long,long long>pll;
typedef                                     pair<double,double>pdd;
typedef                                     pair<char,char>pcc;
typedef                                     pair<string,string>pss;
typedef                                     map<int,int>mii;
typedef                                     map<long long,long long>mll;
typedef                                     map<char,char>mcc;
typedef                                     map<string,string>mss;
typedef                                     map<string,int>msi;
typedef                                     map< int,vector<int> >miv;
typedef                                     map<vector<int>,vector<int> >mvvi;
typedef                                     map<string,vector<int> >msv;
typedef                                     set<int>si;
typedef                                     set<string>ss;
typedef                                     set<vector<int> >sv;
typedef                                     queue<int>qi;
typedef                                     queue<long long>qll;
typedef                                     queue<string>qs;
typedef                                     stack<int>stki;
typedef                                     stack<long long>stkll;

/**-------------------END OF typedef------------------------------**/

const int                                   INF  = 1000000000;
const int                                   MAX  = 4007;
const int                                   MAX2 = 1000000;
const int                                   MAXD = 20;
const int                                   BASE = 1000000007;
const int                                   MOD  = 1000000007;
const int                                   psz  = 2000006;

/**-------------------Constant int--------------------------------**/

#define sI(a)                               scanf("%d",&a)
#define sI2(a,b)                            sI(a) , sI(b)
#define sI3(a,b,c)                          sI(a), sI(b), sI(c)
#define sI4(a,b,c,d)                        sI(a), sI(b), sI(c), sI(d)

#define sL(a)                               scanf("%lld",&a)
#define sL2(a,b)                            sL(a) , sL(b)
#define sL3(a,b,c)                          sL(a), sL(b), sL(c)
#define sL4(a,b,c,d)                        sL(a), sL(b), sL(c), sL(d)

#define pI(a)                               printf("%d",a)
#define pI2(a,b)                            pI(a) , pI(b)
#define pI3(a,b,c)                          pI(a), pI(b), pI(c)
#define pI4(a,b,c,d)                        pI(a), pI(b), pI(c), pI(d)

#define pL(a)                               printf("%lld",a)
#define pL2(a,b)                            pL(a) , pL(b)
#define pL3(a,b,c)                          pL(a), pL(b), pL(c)
#define pL4(a,b,c,d)                        pL(a), pL(b), pL(c), pL(d)
#define pN                                  printf("\n");
#define LL                                  long long

/**----------------------Scan and print end--------------------------**/

#define min3(a,b,c)                         min(a,min(b,c))
#define max3(a,b,c)                         max(a,max(b,c))
#define min4(a,b,c,d)                       min(min(a,b),min(c,d))
#define max4(a,b,c,d)                       max(max(a,b),max(c,d))
#define max5(a,b,c,d,e)                     max(max3(a,b,c),max(d,e))
#define min5(a,b,c,d,e)                     min(min3(a,b,c),min(d,e))

/**----------------------MAX and MIN end-----------------------------**/

#define fst                                 first
#define snd                                 second
#define all(a)                              a.begin(),a.end()
#define rall(a)                             a.rbegin(),a.rend()
#define SQR(a)                              ((a)*(a))
#define Unique(a)                           sort(all(a)),a.erase(unique(all(a)),a.end())
#define Iterator(a)                         __typeof__(a.begin())
#define rIterator(a)                        __typeof__(a.rbegin())
#define FORI(a,it)                          for(Iterator(a) it = a.begin();it != a.end(); it++)
#define RFORI(a,it)                         for(rIterator(a) it = a.rbegin();it != a.rend(); it++)
#define FOR(i, a, b)                        for(int i=(a);i<(b);i++)
#define RFOR(i, b, a)                       for(int i=(b)-1;i>=(a);--i)
#define FILL(A,value)                       memset(A,value,sizeof(A))
#define SZ(V)                               (int)V.size()
#define PB                                  push_back
#define MP                                  make_pair
#define Pi                                  3.14159265358979
#define read(x)                             freopen(x, "r", stdin)
#define write(x)                            freopen(x, "w", stdout)

/**---------------------End of define of all----------------------**/

int fx[]={+0,+0,+1,-1,-1,+1,-1,+1};
int fy[]={-1,+1,+0,+0,+1,+1,-1,-1};

int dx[]={1,-1,0,0};
int dy[]={0,0,1,-1};

/**-----------------------Directional------------------------------**/

inline int number_of_edges(int degreeofvertices)   {int res; res=(degreeofvertices)/2;return res;};
inline int josephus(int n,int k)                   {if(n==1){return 1;}else{return (josephus(n-1,k)+k-1)%n+1;}}

/**-----------------------Normal equations-------------------------**/

inline int binary_src(int a[],int n,int k)         {int lo=0,hi=n-1,mid;while(lo<=hi){mid=(lo+hi)/2;if(a[mid]==k){return mid+1;}else if(a[mid]>k){hi=mid-1;}else if(a[mid]<k){lo=mid+1;}}return -1;}
inline bool isLeap(LL y)                          {return (y % 400 == 0) || (y % 100 ? y % 4 == 0 : false); }
inline int chToIn(char a)                          {int b;b = a-'0';return b;}
inline char inTOch(int a)                          {char b;b= a+'0';return b;}
inline int stToIn(string a)                        {int b;b=atoi(a.c_str());return b;}
inline string appendChar(string s,char a)          {s.append(1,a);return s;}
inline string rev(string a)                        {int siz=SZ(a);string res="";RFOR(i,siz,0){res+=a[i];}return res;}
inline int gcd(int a, int b)                       {return (b == 0 ? a : gcd(b, a % b));}
inline int lcm(int a, int b)                       {return (a * (b / gcd(a, b))); }
vll factors_n; inline LL factor_find_n(LL n)       {for(LL i=2; i<=n; i++)while(n%i==0){n/=i; factors_n.PB(i);}}
vll factors_sqr; inline LL factor_find_sqrt(LL n)  {for(LL i=2; i*i<=n; i++)while(n%i==0){n/=i; factors_sqr.PB(i);}}
inline LL bigmod(LL a,LL b,LL m)                   {if(b==0)return 1%m;LL x=bigmod(a,b/2,m);x=(x*x)%m;if(b%2==1){x=(x*a)%m;}return x;}
inline LL phi(LL n)                                {LL ret=n;for(LL i=2; i*i<=n; i++){if(n%i==0){while(n%i==0)n/=i;}ret-=ret/i;}if(n>1){ret-=ret/n;}return ret;}

/**---------------------End of functions--------------------------**/

int main(){
    LL n;
    sL(n);
    int ar[n+10];
    for(int i=0; i<n; i++){
        sI(ar[i]);
    }
    sort(ar,ar+n);
    int res=0;
    res=ar[n-1]-25;
    cout<<max(0,res)<<endl;
    return 0;
}

//666yuchen
#include<bits/stdc++.h>
using namespace std;
int k,x,maxz;
int main()
{
  cin>>k;
  for(int i=1;i<=k;i++)cin>>x,maxz=max(maxz,x);
  cout<<(maxz<=25?0:maxz-25);
  return 0;
}

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <ctype.h>
#include <math.h>
#include <locale.h>
#include <assert.h>

#define min(a,b) (((a)<(b)) ? (a) : (b))
#define max(a,b) (((a)>(b)) ? (a) : (b))

int Compare(const void * x1, const void * x2)
{
	return ((*((int*)x1)) - (*((int*)x2)));
}

int main(void)
{
	//freopen("", "r", stdin);
	//freopen("", "w", stdout);
	int k, r, ma = 0;
	scanf("%d", &k);
	for (int i = 0; i < k; i++)
	{
		scanf("%d", &r);
		ma = max(ma, r);
	}
	printf("%d\n", max(0, ma - 25));
	//fclose(stdin);
	//fclose(stdout);
	return 0;
}

#include<iostream>
using namespace std;
int main(){
	int a,b,mx=0;
	cin>>a;
	for(int i=0;i<a;++i)
	{
		cin>>b;
		mx=max(mx,b);

	}
	if(mx>=25)cout<<mx-25;
	else if(mx<25)cout<<0;

	return 0;
}

#include<bits/stdc++.h>
using namespace std;
int MAXN;
int main(){
	int n,x;
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>x;
		MAXN=max(MAXN,x);
	}
	if(MAXN<=25){
		cout<<"0";
		return 0;
	}
	cout<<MAXN-25;
	return 0;
}

#include <bits/stdc++.h>
using namespace std;
int main()
{
	int n;
	cin>>n;
	int maxn=0;
	for(int i=0;i<n;i++)
	{
		int x;
		cin>>x;
		maxn=max(x,maxn);
	}
	if(maxn<=25) cout<<0;
	else cout<<maxn-25;
	return 0;
}

#include <bits/stdc++.h>

using namespace std;

int main()
{
    int k, n, c = 0;
    vector<int> v;

    cin >> k;

    for(int i = 0; i < k; i++)
    {
        cin >> n;
        v.push_back(n);
    }
    sort(v.begin(), v.end());
    if(v[v.size() - 1] > 25) cout << v[v.size() - 1] - 25 << '\n';
    else cout << "0\n";
    return 0;
}

// 1513969438715

// luogu-judger-enable-o2
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int n,m,sum;
int main(){
	scanf("%d",&n);
	while(n--){
		scanf("%d",&m);
		sum=max(sum,m);
	}
	if(sum<25){
		putchar('0');
		putchar('\n');
		return 0;
	}
	printf("%d",sum-25);
	return 0;
}

#include <bits/stdc++.h>
using namespace std;

 int main()
 {
 	long long n;
 	cin >> n ;
 	int b[n + 100];
 	for ( int i = 0; i < n; i++ ){
 		cin >> b[i];
    }
    sort(b, b + n);
    int x = b[n - 1] - 25;
    if (x > 0)
    cout << x;
    else cout << "0";

 }

#include<bits/stdc++.h>
using namespace std;
int n,ans,a[30];
int main()
{
	cin>>n;
	for(int i=0;i<n;i++)cin>>a[i];
	sort(a,a+n);
	cout<<max(a[n-1],25)-25<<endl;
	return 0;
}

#include<bits/stdc++.h>
using namespace std;
int k,x,mmax;
int main(){
    scanf("%d",&k);
    while(k--){scanf("%d",&x);mmax=max(mmax,x);}
    if (mmax<25){putchar('0');putchar('\n');return 0;}
    printf("%d\n",mmax-25);
    return 0;
}

#include<iostream>
#include<cstdio>
#include<cstdio>
#include<cstring>
#include<string>
#include<cmath>
#include<algorithm>
using namespace std;
int mls[30];
int main()
{
	int k;
	cin>>k;
	int maxn=0;
	for(int i=1;i<=k;i++)
	{
		cin>>mls[i];
		maxn=max(maxn,mls[i]);
	}
	if(maxn<=25) cout<<0<<endl;
	else if(maxn>25) cout<<maxn-25<<endl;
	return 0;
}

#include<bits/stdc++.h>
using namespace std;
int main()
{
	long long k,i;
    cin>>k;
    long long a[k],m=25;
    for(i=0;i<k;i++)
    {
        cin>>a[i];
        if(a[i]>25)
        {
           if(m<a[i])
           {
           	m=a[i];
           }
        }
    }
    cout<<m-25;
	return 0;
}

#include<iostream>
using namespace std;
int main()
{
	int max=-1,k,x;cin>>k;
	for(int i=1;i<=k;i++)
	{
		cin>>x;
		if(x>max)max=x;
	}
	if(max-25<=0)cout<<"0";
	else cout<<max-25;
	return 0;
}

#include <bits/stdc++.h>

using namespace std;

int n, a[50], ans = 0;
bool joined[1000001];

main() {
  ios_base::sync_with_stdio(0);
  //freopen("input.txt", "r", stdin);
  //freopen("output.txt", "w", stdout);
  cin >> n;
  for (int i = 1; i <= n; ++i) {
    cin >> a[i];
    joined[a[i]] = 1;
  }
  int cnt = 1;
  for (int i = n + 1; i <= 25; ++i) {
    while (joined[cnt]) ++cnt;
    a[i] = cnt;
    joined[cnt] = 1;
  }
  n = 25;
  sort (a + 1, a + n + 1);
  for (int i = 1; i <= n; ++i) {
    if (a[i] - a[i - 1] == 1) continue;
    ans += a[i] - a[i - 1] - 1;
  }
  cout << ans;
}

//859 A
#include<iostream>
#include<algorithm>
#include<math.h>
using namespace std;
int main()
{
    int k,i,declined = 0;
    cin>>k;

    /*long current_r,prev_r = 25;

    for(i=0;i<k;i++)
    {
        cin>>current_r;
        if(current_r > 25)
        {
            declined += abs(current_r - prev_r)-1;
            prev_r = current_r;
        }
    }*/
    long available_ranks[k],prev_rank = 25;
    for(i = 0;i < k;i++)
        cin>>available_ranks[i];

    sort(available_ranks,available_ranks + k);
    for(i = 0;i < k;i++)
    {
        if(available_ranks[i] > 25)
        {
            declined += available_ranks[i] - prev_rank;
            prev_rank = available_ranks[i];
        }
    }
    cout<<declined;
}

#include<bits/stdc++.h>
using namespace std;
int k,x,ans;
int main()
{
    scanf("%d",&k);
    while(k--)
    {
        scanf("%d",&x);
        ans=max(ans,x);
    }
    printf("%d",max(ans-25,0));
    return 0;
}

#include<cstdio>
#include<iostream>
#include<climits>
using namespace std;
int r;
int main()
{
	int a,b,c,k,maxn=-1;
	scanf("%d",&k);
	for(a=0;a<k;++a)
	{
		scanf("%d",&r);
		maxn=max(maxn,r);
	}
	if(maxn<25)printf("0");
	else printf("%d",maxn-25);
	return 0;
}

#include<bits/stdc++.h>
using namespace std;
int n,a[100];
int main()
{
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		cin>>a[i];
	}
	sort(a+1,a+n+1);
	if(a[n]<=25)
	{
		cout<<"0"<<endl;
	}
	else
	{
		cout<<a[n]-25<<endl;
	}
	return 0;
}

#include <bits/stdc++.h>
using namespace std;
int main()
{

    int a[10000],n;

    scanf("%d",&n);

    for(int i=0;i<n;++i){
        scanf("%d",&a[i]);
    }

    sort(a,a+n);

    if(a[n-1]<=25){
        printf("0\n");
    }
    else {
        printf("%d\n",a[n-1]-25);
    }
}

#include<bits/stdc++.h>
using namespace std;
int main( void ) {
	int n = 0,a = 0, ma = 0;
	cin>>n;
	for(int i = 1; i <= n; ++i) {
		cin>>a;
		ma = max( ma , a );
	}
	if( ma > 25 ) cout<<ma - 25<<endl;
	  else if( ma <= 25 ) cout<< 0 <<endl;
	return 0;
}

#include <bits/stdc++.h>
using namespace std;
int main()
{
    int n;
    int x;
    while(scanf("%d",&n)!=EOF)
    {
        int ans = 0;
        for(int i=0;i<n;i++)
        {
            scanf("%d",&x);
            ans = max(ans,x);
        }
        if(ans>25)
            printf("%d\n",ans-25);
        else
            printf("0\n");
    }
    return 0;
}

#include<iostream>
#include<algorithm>
using namespace std;
int n,a[26];
int main()
{
	cin>>n;
	for(int i=1;i<=n;++i) cin>>a[i];
	sort(a+1,a+1+n);
	if(a[n]>25) cout<<a[n]-25;
	else cout<<0;
    return 0;
}

#include <iostream>
#include <stdio.h>
using namespace std;
#pragma GCC optimize(2)
#pragma GCC optimize(3)
int input()
{
	int re=0; char c=getchar();
	while(c<'0' or c>'9') c=getchar();
	while(c>='0' and c<='9') re=(re<<3)+(re<<1)+(c^48),c=getchar();
	return re;
}
int main()
{
	int k=input(),tmp,ans=0;
	while(k--)
	ans=max(ans,input());
	printf("%d\n",ans>25?ans-25:0);
    return 0;
}

#include <iostream>

using namespace std;
int main()
{
  int max,c,i,k,r;
  cin >> k;
  max=0;
  c=0;
  for (i=0; i<k; i++) {cin >> r; if (r>max) max=r; }
  if (max>25) c=max-25;
  cout << c;
  return 0;
}

#include<bits/stdc++.h>
using namespace std;
main(){
    int n,y=0,x;
    cin>>n;
    for(int i=1;i<=n;i++){
       cin>>x;
        if(x>y && x>25){
            y=x;
        }

    }

    if(y>25){
        cout<<y-25;
    }
    else{
        cout<<0;
    }

}

#include <bits/stdc++.h>
using namespace std;

int main()
{
    int n;
    int a;
    cin >> n;
    cin >> a;
    int max = a;
    for (int i = 1; i < n; ++i){
        cin >> a;
    	if (max < a)
    	{
    		max = a;
    	}
    }
    if (max > 25)
    {
    	cout << max-25;
    }
    else cout << "0";

    return 0;
}

#include<bits/stdc++.h>
using namespace std;
int n,maxa;
int main()
{
    scanf("%d",&n);
    while(n--)
    {
        int a;
        scanf("%d",&a);
        maxa=max(maxa,a);
    }
    printf("%d",max(maxa-25,0));
    return 0;
}//rjgisfgoihsoidfghstrhdgjfhk

// Problem1.cpp: определяет точку входа для консольного приложения.
//

#include <iostream>

using namespace std;

int main()
{
	int ans,k, a,max=0,i ;
	cin >> k;
	for (i = 0; i < k; i++)
	{
		cin >> a;
		if (a > max) { max = a; }
	}
	ans = max - 25;
	if (ans <= 0) {
		cout << 0;
	}
	else cout << ans;

    return 0;
}

#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back

using namespace std;

int main()
{
    ios::sync_with_stdio(false);
    int n;
    cin >>n;
    int a=0,b;
    for (int i=0;i<n;i++){
            cin>>b;
            a=max(a,b);
    }
    if(a>25){
        cout<<(a-25)<<endl;
    }
    else
        cout <<0<<endl;

}

#include<bits/stdc++.h>
using namespace std;

int main () { int n;
cin>>n;
int x;
int ans=-1;
while(n--)
{ cin>>x; ans=max(ans,x); }
if(ans<=25) cout<<0<<endl;
else cout<<ans-25<<endl; return 0; }

#include <stdio.h>
#include <string.h>

int MiniNums(int buff[], int n)
{
	int max = buff[0];
	for (int i = 0; i < n; i++)
	{
		if (max < buff[i])
			max = buff[i];
	}
	if (max < 25)
		return 0;
	else
		return max - 25;
}

int main()
{
	int num = 0;
	int buff[25];

	memset(buff, 0, sizeof(buff));
	scanf("%d", &num);
	for (int i = 0; i < num; i++)
		scanf("%d", &buff[i]);
	printf("%d\n", MiniNums(buff, num));

	//getchar();
	return 0;
}

#include<bits/stdc++.h>
#include<algorithm>
using namespace std;

int main()
{
    int n;
    scanf("%d",&n);
    int ans=0;
    while(n--)
    {
        int x;
        scanf("%d",&x);
        if(x>25)
          ans=max(ans,x-25);
    }
    printf("%d\n",ans);
    return 0;
}

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <math.h>
#include <cstring>
#include <set>

typedef long long ll;

using namespace std;

int main()
{
	int K;cin>>K;
	long r,m=0;
	for(int i(0);i<K;++i)
	{
		cin>>r;
		m=max(m,r);
	}
	if(m<=25) cout<<0<<endl;
	else cout<<m-25<<endl;

	return 0;
}

#include <iostream>
#include<bits/stdc++.h>
using namespace std;
const int N = 1e6;

int main()
{
    int k , a, ans=0 , maxi=0;
    cin>>k;

    for(int i=0 ; i<k ; ++i)
    {
        cin>>a;
        ans = max(a,ans);
    }
    ans = max(0 , ans-25);
    cout<<ans <<endl;

    return 0;
}

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int n,a[30],i;
    cin>>n;
    for(i=0;i<n;i++)  cin>>a[i];
    sort(a,a+n);
    if(a[n-1]<=25){
        cout<<0<<endl;
        return 0;
    }
    else  cout<<a[n-1]-25<<endl;
    return 0;
}

#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    ll int n;
    cin>>n;
    ll int a[n],max=-1;
    for(ll int i=0;i<n;i++)
    {
        cin>>a[i];
        if(max<a[i])
        max=a[i];
    }
    if(max<=25)
    cout<<"0";
    else
    cout<<max-25;
}

#include <iostream>
using namespace std;
int main()
{
	int a, b=0,n,c=0,d=0;
	cin >> n;
	for (int i = 1; i <= n; i++)
	{
		cin >> a;
		if (a > c)
			c = a;
	}
	cout << (c - 25 >= 0?c - 25 : 0);
	return 0;
}

#include<stdio.h>
#include<stdlib.h>
int main()
{
	int a,max;
	int j[100];
	scanf("%d",&a);
	for(int i=0;i<a;i++)
	{
		scanf("%d",&j[i]);
	}
	max = j[0]; // 初始化最大值
	for(int b=0; b <a; b++)
    {
        if(max<j[b])
            max = j[b];  // 保存最大值
    }
    if(max<=25)
    {
    	printf("0");
    }
    if(max>25)
    {
    	printf("%d",max-25);
    }
}

#include<iostream>
using namespace std;
int i,k,r[25],t;
int main()
{
    cin>>k;
    for(i=0; i<k; i++)
     cin>>r[i];

    for(i=0; i<k; i++)
     if(r[i]>t)
      t=r[i];

    if(t>25) cout<<t-25<<endl;
        else cout<<0<<endl;

    return 0;
}

#include <bits/stdc++.h>

using namespace std;

int main(){
	int n , a , maxi=0;
	cin>>n;
	for (int i=0;i<n;i++){
		cin>>a;
		maxi=max(maxi,a);
	}
	cout<<max(0,maxi-25);
	return 0;
}

#include <bits/stdc++.h>
using namespace std;
int main()
{
   // freopen("in.txt","r",stdin);

    int N,arr[100000];

    scanf("%d",&N);

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

#include<bits/stdc++.h>
using namespace std;

#define MOD 1000000007
#define N 100010

typedef double lf;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef set<ll> sll;
typedef vector<ll> vll;
typedef vector<pair<ll,ll > >vpll;
typedef vector<vll > vvll;

#define sd(a) scanf("%d",&a)
#define sstr(a) scanf("%s",a)
#define sl(a) scanf("%lld",&a)
#define debug(a) printf("check%d\n",a)
#define clr(a) memset(a,0,sizeof(a))
#define rtn return
#define gc getchar
#define pb push_back
#define ff first
#define ss second
#define mp(x,y) make_pair(x,y)
#define all(a) a.begin(),a.end()
#define allr(a) a.rbegin(),a.rend()
#define lp(i,b) for(ll i = ll(0); i<ll(b) ; i++)
#define lpit(it,a) for(__typeof(a.begin()) it = a.begin(); it != a.end(); ++it)
#define mid(s,e) (s+(e-s)/2)
#define min3(a,b,c)	min(a,min(b,c))
#define max3(a,b,c)	max(a,max(b,c))

ll ip(){
	ll x = 0; bool isNeg = false; char c;
	c = gc();
	if(c == '-')	isNeg = true , c = gc();
	for( ; c >= '0'  && c <= '9' ; c = gc()); x = (x << 1) + (x << 3) + c - '0';
	if(isNeg)	x *= -1;	return x;
}
//////////////////////////////////////////// CONTAINERS FOR FUNCTIONS MENTIONED IN TEMPLATE ///////////////////////////////////
#define MAX 100005
//bool isPrime[MAX];
//int spf[MAX];
//////////////////////////////////////////// FUNCTIONS THAT NEED COMMENTED OUT CONTAINERS ////////////////////////////////////

//void prime_sieve(){ for(ll i=2 ; i*i<=MAX ; i++){	if(!isPrime[i]){ for(ll j=i*i ; j<=MAX ; j+=i)	isPrime[j] = 1;} } 	}
//void spf_sieve(){	for(ll i=2 ; i<MAX ; i+=2)	spf[i] = 2;
//	for(ll i=3 ; i<MAX ; i+=2){	if(!isPrime[i]){ spf[i] = i; for(ll j=i ; (j*i)<MAX ; j+=2){ if(!isPrime[i*j])	isPrime[i*j] = true , spf[i*j] = i; } } }
//}
//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
inline ll ncr(ll n,ll r){ ll ans = 1 ; if(r > n-r) r = n-r; lp(i,r+1){ans*=(n-i) ; ans/=(i+1); } rtn ans; }
inline ll gcd(ll a,ll b){if(!a) rtn b; rtn gcd(b%a,a); }
inline ll fme(ll x,ll n){ll ans=1;x%=MOD;while(n>0){if(n&1){ ans*=x;ans%=MOD;} x*=x;x%=MOD;n>>=1;}rtn ans%MOD;}
inline bool isPalin(string &s){	int len = s.size()-1;lp(i,(len/2)+2){if(!(s[i]==s[len-i]))	rtn false;} rtn true;}
inline ll lcm(ll a,ll b){rtn (a*b)/gcd(a,b); }
inline ll fmm(ll a,ll b) {ll r=0;a%=MOD;b%=MOD;while(b>0){if(b&1){r+=a;r%=MOD;}a+=a;a%=MOD;b>>=1;}rtn r%MOD;}
inline ll sfme(ll a,ll b) {ll r=1;a%=MOD;while(b>0){if(b&1)r=fmm(r,a);a=fmm(a,a);b>>=1;}rtn r%MOD;}
ll makeNum(string &str){ll a = 0;	lpit(it, str){ int num = *it - '0';	a = a*10 + num;} return a;}
inline int in(){ int NR=0; register char c=gc(); while( c < 48 || c > 57 ){c=gc();}
	while(c>47 && c< 58){	NR = (NR << 3) + (NR << 1) + (c - 48); c=gc();} return NR;
}

ll dx[] = {0,0,1,-1}, dy[] = {1,-1,0,0};
//--------------------------------TEMPLATE ENDS HERE--------------------------------------------------//

set<ll> s;

int main(){
	ll t, n, m, type, k;
	// START HERE //
	cin >> k;
	//vll v(k);
	ll maxx = 0;

	lp(i, k){
		cin >> n;
		maxx = max( n, maxx);
	}
	maxx = max( 0LL, maxx - 25);
	cout << maxx  << "\n";

	return 0;
}

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int k,i,m,ans;
    vector<int>a;
    cin>>k;
    for(i=0; i<k; i++)
    {
        cin>>m;
        a.push_back(m);
    }

    ans=*max_element(a.begin(),a.end())-25;
    if(ans<0)
        ans=0;
    cout<<ans<<endl;
    return 0;
}

#include <bits/stdc++.h>

using namespace std;

int main()
{
int k ;
int T[100];
cin>>k;
cout<<'\n' ;
int a;
for  (int i=0 ;i<k ; i++)
   {
    cin>>a;

    T[i]=a ;
   }
int m=T[0];
for (int i=0;i<k;i++)
{
    if (T[i]>m)
        m=T[i];
}
cout<<max(0,(m-25));

}

#include<bits/stdc++.h>
using namespace std;
int maxx=25,a;//将max值设为25，省去判断最大值是否大于25
int main()
{
    int n;
    scanf("%d",&n);
    for(int i=0;i<n;i++)
    {
        scanf("%d",&a);
        maxx=max(maxx,a);//谁大取谁是
    }
        printf("%d",maxx-25);//输出
    return 0;
}

#include<bits/stdc++.h>
using namespace std;
int MAXN;
int main(){
	int n,x;
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>x;
		MAXN=max(MAXN,x);
	}
	if(MAXN<=25){
		cout<<"0";
		return 0;
	}
	cout<<MAXN-25;
	return 0;
}

#include <iostream>
using namespace std;
int main()
{
	int k, max = 0, q;
	cin >> k;
	for (int i = 1; i <= k; i++) {
		cin >> q;
		if (q > max)  max = q;
	}
	if (max <= 25) cout << 0; else
		cout << max - 25;
    return 0;
}

#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef long L;
const char NL = '\n';
#define f(i,a,b) for(int i=a;i<b;i++)
#define fr(i,a,b) for(int i=a;i>=b;i--)
#define test int t; cin>>t; while(t--)
#define mod 1000000007
#define all(a) a.begin(),a.end()

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    // all the code goes here
	int k;
	scanf("%d",&k);
	vector<int> g;
	for(int i = 0; i < k; i++)
	{
		int s;
		scanf("%d",&s);
		if(s > 25)
			g.push_back(s);
	}

	int lr = 25;
	int n = g.size();
	int count = 0;
	sort(all(g));
	for(int i = 0; i < n; i++)
	{
		count+=(g[i]-lr-1);
		lr = g[i];
	}
	count+=(n);
	printf("%d\n",count);
    return 0;
}

#include<bits/stdc++.h>
using namespace std;
int n,ans;
int main()
{
    cin>>n;
    while(n--)
    {
        int x;
        cin>>x;
        ans=max(ans,x);
    }
    cout<<max(ans-25,0);
    return 0;
}

#include<bits/stdc++.h>
using namespace std;
int k,x,l;
int main(){
	cin>>k;
	while(k--){
		cin>>x;
		l=max(l,x);
	}
	if(l<25) cout<<"0"<<endl;
	else cout<<l-25<<endl;
	return 0;
}

#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <iostream>
using namespace std;

int main(){
    int n;
    cin>>n;
    long long a[n];
    for (int i=0; i<n; i++){
    	cin>>a[i];
	}
	long long ans=-1;
	long long max=a[0];

	for (int i=0; i<n; i++){
		if (a[i]<max){
			ans=0;
			break;
		}
		else max=a[i];
	}

    if (ans==-1) ans=a[n-1]-25;
    cout<<ans;

    //system("pause");
    return 0;
}

#include<bits/stdc++.h>
using namespace std;
int main(){
    long long n, k = 0, z =0;
    cin >> n;
    long long a[n];
    for (long long i = 1; i <= n; i++){
        cin >> a[i];
        k = max (k, a[i]);
    }
    if (k <= 25){
        cout << 0;
        return 0;
    }
    sort (a, a + n);
    for (long long i = 1 ; i <= k; i++){
        if (a[i]!=k)
            z++;
    }
    cout << z - 25 + n - 1;
}

#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include<string>
#include<math.h>
#include<vector>
#include<queue>
#include<stack>
#include<algorithm>
#include<set>
#include<map>
#include <iomanip>
#define ll unsigned long long
using namespace std;

int nod(int a, int b) {
	if (a < b) {
		swap(a, b);
	}
	while (a % b != 0) {
		a = a % b;
		swap(a, b);
	}
	return b;
}

int f(vector<int> v,int x) {
	int ans = v[0];
	for (int i = 0; i < v.size()-1; i++) {
		int nd = nod(v[i], v[i + 1]);
		if (nd < ans) {
			ans = nd;
		}
	}
	return nod(ans,x);
}
int main() {

#ifdef  _DEBUG
	freopen("input.txt", "r", stdin);
	freopen("output.txt", "w", stdout);
#endif
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int k;
	cin >> k;
	int a[25];
	for (int i = 0; i < k; i++) {
		cin >> a[i];
	}
	sort(a, a + k);

	int ans = 0;
	for (int i = k-1; i > 0; i--) {
		if (a[i] > 25)ans+= a[i]-max(25,a[i-1]);
	}
	cout << ans;

	return 0;
}

#include <iostream>
#include <math.h>
#include <iomanip>
using namespace std;

int main()
{
    unsigned long long n;
    int k;
    cin>>n>>k;
    int h=k;
    while (n%2==0 && h!=0)
    {
        h--;
        n/=2;
    }

    h=k;
    while (n%5==0 && h!=0)
    {
        h--;
        n/=5;
    }

    for(int i=0; i<k; i++)
        n*=10;
    cout<<n;

    return 0;
}

#include <bits/stdc++.h>
using namespace std;
int main()
{
	int n;
	cin >> n;
	int a[n];
	for(int i=0; i < n; i++) cin >> a[i];
	sort(a,a+n);
	cout << a[n-1]-25;
	return 0;
}

#include <bits/stdc++.h>

using namespace std;
int v[30];
int main()
{
    int k,x,nr=0,c=0,pz;
    cin >> k;
    for (int i = 1; i<=k; i++)
    {
        cin >> x;
        if (x>25)
            v[c++] = x;
    }
    sort(v,v+c);
    pz = 25;
    for (int i = c-1; i>=0; i--)
    {
        nr+=v[i]-pz-i;
        if (i>0)
            nr--;
        pz--;
    }
    cout << nr;
}

#include<cstdio>
#include<iostream>
#include<climits>
using namespace std;
int r;
int main()
{
	int a,b,c,k,maxn=-1;
	scanf("%d",&k);
	for(a=0;a<k;++a)
	{
		scanf("%d",&r);
		maxn=max(maxn,r);
	}
	if(r>=25)printf("0");
	else printf("%d",maxn-25);
	return 0;
}

#include <iostream>
using namespace std;
int a[1000001],k,mx,t;
int main()
{
    cin>>k;
    for(int i=0; i<k; i++)
        cin>>a[i];

        mx=a[0];
        for(int i=1;i<k;i++)
            if(a[i]>mx) mx=a[i];
   if (mx>25) cout<<'0'; else cout<<mx-25;
    //system("pause");
}

#include <bits/stdc++.h>

using namespace std;

#define max(a,b) a>b?a:b
int main()
{
	int K, m;
	cin >> K;
	int a[K];
	for (int i=0; i<K; i++)
		cin >> a[K];
	for (int i=0; i<K-1; i++)
		m = max(a[K],a[K+1]);
	if (m<26)
		cout << 0;
	else
		cout << m-25;
	return 0;
}

#include<bits/stdc++.h>
using namespace std;
int n,a[50],big,sml;
int main(){
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>a[i];
		if(a[i]<=25) sml++;
		else big++;
	}
	if(a[n]<=25) cout<<0,exit(0);
	sort(a+1,a+n+1);
	cout<<a[n]-25;
}

#include <iostream>
using namespace std;
int i, amax, k;
int a[26];
main () {
	cin>>k;
	for(i=1; i<=k; i++)
	cin>>a[i];
	amax=a[i];
	for(i=2; i<=k; i++)
	if(a[i]>amax) amax=a[i];
	if(amax>25)
	cout<<amax-25<<endl;
	else cout<<0<<endl;
}

/************************Template by Karthik Raja B***********************/
#include <bits/stdc++.h>
using namespace std;
#pragma GCC diagnostic ignored "-Wunused-result"
/*************************************************************************/
#define For(i,a,b) for((i)=(a);(i)<(b);++(i))
#define Fore(i,a,b) for((i)=(a);(i)<=(b);++(i))
#define rof(i,a,b) for((i)=(a);(i)>=(b);--(i))
/************************************************************************/
#define minf -1000000000000000
#define inf 1000000000000000
#define xx first
#define yy second
#define pb push_back
#define PB pop_back()
#define mp make_pair
#define mod 1000000007
#define pi 3.1428571
#define iOS ios_base::sync_with_stdio(false); cin.tie(NULL)
#define sqr(a) (((a) * (a)))
#define L(x) ((x)<<1)
#define R(x) (((x)<<1)+1)
//#define double long double
#define ct(a) cout<<a<<"\n"
#define ct2(a,b) cout<<a<<" "<<b<<"\n"
#define ct3(a,b,c) cout<<a<<" "<<b<<" "<<c<<"\n"
#define endl "\n"
/************************************************************************/
typedef long long ll;
typedef vector<pair<ll,ll>>vect;
typedef vector<ll> vi;
typedef vector<long long> vl;
typedef complex<double> point;
typedef map<ll,ll> mt;
typedef map<string,ll> ms;
typedef unsigned long long ull;
typedef long double ld;
/************************************************************************/
ll dp[100000];
int main()
{   iOS;
	ll i,j,n,t;
	cin>>n;
	ll a[n];
	ll counti=0;
	ll count1=0;
	ll maxi=0;
	For(i,0,n)
	{
	    cin>>a[i];
	    maxi=max(maxi,a[i]);
	    if(a[i]>25)
            counti++;
        if(a[i]<=25)
            count1++;
	}
	if(counti==0)
        cout<<"0";
    else
    {
        if(maxi-25<25)
            cout<<maxi-25;
        else
        {
            cout<<maxi-25-count1-2;
        }

    }
	return 0;
}

#include <iostream>
#include <queue>
#include <cstdlib>
#include <vector>
#include <fstream>
#include <cmath>
#include <string>
#include <utility>
#include <iomanip>
#include <functional>
#include <algorithm>
#include <set>
#include <cstdio>
#include <stack>
#include <map>
#include <cstdio>
#include <cassert>
#include <ctime>
using namespace std;

typedef  long long ll;
typedef  unsigned long long	ull;
typedef  pair<long long, long long> pll;
typedef  pair<int, int> pii;

int arr[30];
int main()
{
	int k;
	cin >> k;
	int maxx = 0;
	for (int i = 0; i < k; i++)
	{
		cin >> arr[i];
		if (arr[i] > maxx) maxx = arr[i];
	}
	maxx - 25 <= 0 ? cout<<maxx -25 : cout<<0;
	return 0;
}

#include <bits/stdc++.h>
using namespace std;

int main(){
    int k; cin>>k;
    vector<int> ratings(k);
    for(int i=0;i<k;i++) cin>>ratings[i];
    cout << max(0,*max_element(ratings.begin(), ratings.end()));
}

#include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
int n;
int a[1000000];
int max(int c, int b){
    if(c>b)return c;
    else return b;
}
int maxarr(int a[],int n){
    int m=0;
    for(int i=0;i<n-1;i++){
        int temp=max(a[i],a[i+1]);
        if(m<temp)m=temp;
    }
    return m;
}

int main(){
   cin>>n;
   for(int i=0;i<n;i++){
       cin>>a[i];
   }
   if(n==1){
       cout<<a[0]-25;
       return 0;
   }
int zal=maxarr(a,n);
   if(zal<25){
       cout<<"0";
       return 0;
   }
   else{
       cout<<zal-25;
   }
    return 0;
}

#include<bits/stdc++.h>
//#define  e exit(0)
#define vi vector<int>
#define vl vector<long long>
#define pb push_back
#define ll long long
#define um unordered_map<long long,int>
using namespace std;

int main()
{
    int n;
    cin>>n;
    vl arr;
    for(int i=0;i<n;i++)
    {
        ll x;
        cin>>x;
        arr.pb(x);
    }
    ll d=*max_element(arr.begin(),arr.end());
    ll ans=d-25;
    if(d<=0)
    {
        cout<<"0"<<endl;

    }
    else
    {
        cout<<d<<endl;
    }
}

#include <bits/stdc++.h>
using namespace std;

int main() {
	// your code goes here
	int k;
	cin>>k;
	int* a=new int[k];
	for(int i=0;i<k;i++)
	cin>>a[i];
	sort(a,a+k);
	if(k==25){
	    int c=a[0]-1;
	    for(int i=0;i<k;i++){
	        c+=(a[i]-a[i-1]-1);
	    }
	    cout<<c<<endl;
	}
	else{
	    if(a[k-1]<=25)
	    cout<<"0"<<endl;
	    else{
	        int s=0;
	        int* b=new int[k];
	        b[0]=a[0]-1;
	        for(int i=1;i<k;i++){
	            b[i]=(a[i]-a[i-1])-1;
	            s+=b[i];
	        }
	        s+=b[0];
	        cout<<(s-25+k)<<endl;
	    }
	}
	return 0;
}

    #include <bits/stdc++.h>

    #define ll                  long long
    #define ld                  long double
    #define pb                  push_back
    #define mp                  make_pair
    #define fi                  first
    #define se                  second
    #define all(c)              (c).begin(),(c).end()
    #define for0(i, n)          for (ll i = 0; i < n; ++i)
    #define for1(i, n)          for (ll i = 1; i <= n;++i)
    #define for2(i, n)          for (ll i = 1; i < n; ++i)
    #define for3(i, k, n)       for (ll i = k; i < n; ++i)
    #define input(a, i, n)      for (int i = 0; i < n; ++i) {cin >> a[i]; }
    #define output(a, i, n)     for (int i = 0; i < n; ++i) {cout << a[i]; }
    //cout.precision(12);

    using namespace std;

    int64_t TN = 1;

    void solve()
    {
        int64_t n, k = 0, q = 0;
        cin >> n;
        int64_t a[n];
        for (int i = 0; i < n; ++i) {
            cin >> a[i];
            if (a[i] > 25) {
                q++;
                k += a[i] - 25;
            }
        }
        if (q > 0) {
            q--;
        }
        cout << k - q;
    }

    int main()
    {
        //cin >> TN;
        for (int i = 0; i < TN; ++i) {
            solve();
        }
        return 0;
    }

#include <bits/stdc++.h>

using namespace std;

int t,n,Max;

int main()
{
    cin >> n;

    for(int i = 0; i < n; i++)
    {
        cin >> t;
        Max = Max < t ? t : Max;
    }
    cout << (Max - 25) < 0 ? 0 : (Max-25) ;
}

#include <stdio.h>
int main()
{
    int i,k;
    int r[25];
    scanf("%d",&k);
    for(i=0;i<k;i++)
    {
        scanf("%d",&r[i]);

    }
    printf("%d",r[k-1]-25);
    return 0;
}
//o(k)

#include<bits/stdc++.h>
using namespace std;
int k, maxn, a[30];
int main() {
    scanf("%d",&k);
    for(int i = 1; i <= k; i++) scanf("%d",&a[i]);
    for(int i = 1; i <= k; i++)
        maxn = max(maxn, a[i]);
    maxn -= 25;
    printf("%d",max(maxn-25, 0));
    return 0;
}

#include<iostream>
#include<algorithm>
using namespace std;
int k,a[25],n,m,MIN;
main()
{
cin>>k;
for(int i=0;i<k;i++)
{
	cin>>a[i];
	if(a[i]>n)
	n=a[i];
	if(n>25)
	cout<<n-25;
	else cout<<0; break;
	}

}

#include <bits/stdc++.h>
using namespace std;

#define pb push_back
#define pbk pop_back
#define mk_pr make_pair

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<int, pii> piii;
typedef vector<int> vi;
typedef vector<pii> vii;
typedef vector<string> vss;
typedef queue<int> qi;

const int MX = 1123456;

int main() {
    ios_base :: sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
    int n, mx = 0, p;
    string s;
    cin >> n;
    getline(cin, s);
    getline(cin, s);
    stringstream ss(s);
    while( ss >> p ) {
        mx = max(mx, p);
    }
    cout << max(0, p-25) << endl;
    return 0;
}

#include <iostream>
using namespace std;

int main() {
	int n, maxi = 0;
	for (int i = 1; i <= n; i++) {
		int x;
		cin >> x;
		maxi = max(maxi, x);
	}
	cout << max(0, maxi - 25);
	return 0;
}

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int n;
    cin>>n;
    int count1=0;

        //int curd=25;
        int count2=0;
        int a[n];
        for(int i=0;i<n;i++)
            {
                cin>>a[i];
        if(a[i]>25)
        {
            count2=count2+(a[i]-25);
            //curd=a[i];
        }
            }
        cout<<count2<<endl;

    return 0;
}

#include <iostream>
#include <bits/stdc++.h>
#include<fstream>>
/*#include <sstream>
#include <stdio.h>
#include <string>
#include <cstring>
#include <queue>
#include <cmath>
#include <map>
#include <set>
#include <algorithm>
#include<climits>
#include <bitset>
#include <ctime>
#include <cassert>
#include <functional>
#include <iomanip>
#include <vector>
#include <stack>
#include <fstream>*/
//priority_queue<int,vector<int>,greater<int> >vec;
#define OO 1e10
//std::ifstream cin("input.txt");
//std::ofstream cout("output.txt");
//freopen("input.txt","r",stdin);
//freopen("output.txt","w",stdout);
//cout<<fixed<<setprecision(*)<<***<<endl;
//a=97  A=65 z=122 Z=90
/*scanf("%d",&..);
printf("%d",..);*/
using namespace std;

int main()
{

	ios_base::sync_with_stdio(0);
	cin.tie();
	int k,x,c; cin>>k;
	int arr[k];
	for(int i=0;i<k;i++)
    {
        cin>>arr[i];
    }
    sort(arr,arr+k);
    for(int i=0;i<k;i++)
    {
        if(arr[i]>25){c=arr[i]-25;}
    }
    cout<<c<<endl;
	return 0;
}

#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <unordered_map>
using namespace std;
#define INF 1000000007
#define nmax 300100
typedef long long int64;

int main()
{
    cin.tie(0);
    cout.tie(0);
    ios_base::sync_with_stdio(0);
    int n, max_n = 0;
    cin >> n;
    int mas[n+1];
    vector<bool> used(1000100, 0);
    for(int i = 1; i <= n; i++){
        cin >> mas[i];
        used[mas[i]] = 1;
        max_n = max(max_n, mas[i]);
    }
    sort(mas, mas + n);
    int res = 0;
    mas[0] = 0;
    if(n == 25){
        for(int i = 1, j = 1; i <= max_n; i++){
            if(!used[i])
                res++;
        }
    }else {
        if(max_n <= 25)
            res = 0;
        else{
            int i = n;
            while(mas[i] > 25){
                if(mas[i-1] > 25)
                    res += mas[i] - mas[i-1];
                else res += mas[i] - 25;
                i--;
            }
        }
    }
    cout << res << "\n";

    return 0;
}

#include<bits/stdc++.h>
#define f first
#define s second
#define ll long long
#define u unsigned
#define pb push_back
#define mp make_pair
#define FX fflush(stdin);cout<<fixed,cout.precision(18);
#define iOS ios_base::sync_with_stdio(false);
#define ones __builtin_popcount()
#define pii pair<int,int>
#define pll pair<long long,long long>
const long double eps=0.00000001;
const long long MOD=1e9+7;
using namespace std;
int ans;
main()
{
	FX iOS
	int n,i,j;
	cin>>n;int a[n];
	for(i=0;i<n;++i)cin>>a[i];
	sort(a,a+n);
	cout<<(a[n-1]-25);
}

#include<bits/stdc++.h>
using namespace std;

int main(){
	long long int a, b, aux;
	cin >> a;

	for(int i = 0; i < a; i++){
		cin >> aux;

		if(aux > b){
			b = aux;
		}
	}

	if(b <= 25){
		cout << "0" << endl;
		return 0;
	}

	cout << b-25 << endl;
	return 0;
}

#include<bits/stdc++.h>
using namespace std;

int main()
{
    int k;
    cin>>k;
    int a[k];

    int flag=0;
    for(int i=0;i<k;i++)
        if(a[i]>25)
            flag=1;
    if(flag==0)
        cout<<0;
    else
    {
        sort(a,a+k);
        cout<<a[k-1];
    }
}

#include <bits/stdc++.h>
using namespace std;

int n,x,maxn;

int main(){
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>> x;
		maxn=max(maxn,x);
	}
	cout << maxn-n;
	return 0;
}

#include <iostream>

using namespace std;

int main()
{
    int k, n, i, maxx = 0;
    cin >> k;
    for(i = 1; i <= k; ++i)
    {
        cin >> n;
        if(maxx < n)
            maxx = n;
        cout << maxx << '\n';
    }
    if(maxx <= 25)
        cout << 0;
    else
        cout << maxx - 25;

    return 0;
}

#include<bits/stdc++.h>
using namespace std;
main(){
	ios_base::sync_with_stdio(false);
	int n,m;cin>>n;
	int k[n];
	for(int i=0;i<n;i++){
		cin>>k[i];
	}
	m = *max_element(k,k+n);
	cout<<m-25;
}

#include <bits/stdc++.h>
using namespace std;
int main() {

        int n;
        cin >> n;
        int mx = -1;
        for(int i = 0; i < n; ++i) {
                int x;
                cin >> x;
                if(x > mx){
                        x = mx;
                }
        }

        if(mx > 25){
                cout << mx - 25 << endl;
        }

        else {
                cout << 0 << endl;
        }
        return 0;
}

#include<bits/stdc++.h>
using namespace std;

int main()
{
	int k;
	int r[30];
	int cnt=0;
	int maxn=-999;
	cin>>k;
	for(int i=1;i<=k;i++)
	{
		cin>>r[i];
		maxn=max(maxn,r[i]);
	}
	cout<<maxn-25<<endl;
}

#include<bits/stdc++.h>
using namespace std;

int main()
{
    int n,Max=INT_MIN;
    for(int i=0;i<n;i++){
        int temp;
        cin>>temp;
        if(temp>Max){
            Max=temp;
        }
    }
    if(Max<25){
        cout<<0;
    }
    else{
        cout<<Max-25;
    }
    return 0;
}

#include<iostream>
#include<algorithm>
using namespace std;
int k,a[10000],n,m,MIN;
main()
{
cin>>k;
for(int i=0;i<k;i++)
{
	cin>>a[i];
	if(a[i]>25)
	n=a[i]-25;
	MIN=max(n,(a[i]-25));

	}
	cout<<MIN;
}

#include <bits/stdc++.h>
using namespace std;
int main()
{
	int n;
	cin >> n;
	int a[n];
	for(int i=0; i < n; i++) cin >> a[i];
	sort(a,a+n);
	cout << a[n-1]-25;
	return 0;
}

#include <bits/stdc++.h> // PLEASE

using namespace std;
typedef long long ll;
typedef pair <int, int> pp;
#define MAXN 300005
#define MAXX 10000005
#define MAXM 1005
#define MAXP 25
#define PI 3.1415926535897932384626433832795028841971693993751
#define A first
#define B second
#define MP make_pair
#define PB push_back
const ll INF = 2e9+13;
const ll MOD = 1e9+7;
int N;

int main(void)
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cin >> N;
	int x;
	int mx = 0;
	for(int i=1; i<=N; i++) {
		cin >> x;
		mx = max(mx, x);
	}
	printf("%d\n", max(0, x-25));
}

#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back

using namespace std;

int main()
{
    ios::sync_with_stdio(false);
    int n;
    cin >>n;
    int a=0,b;
    for (int i=0;i<n;i++){
            cin>>b;
            a=max(a,b);
    }
    if(b>25){
        cout<<(b-25)<<endl;
    }
    else
        cout <<0<<endl;

}

#include<bits/stdc++.h>

using namespace std;
int main()
{
    int n,s=0;
    cin>>n;
    int a[n];
    for(int i=0;i<n;i++){
        cin>>a[i];
    }
    if(n==25){
            int l=0;
        for(int i=0;i<n;i++){
                l++;
            while(a[i]!=l){
                l++;
                s++;
                }
        }
    }
    else{
        sort(a,a+n);
        s=a[0]-1;
        for(int i=1;i<n;i++){
            s=s+(a[i]-a[i-1]-1);
        }
        s=s-25+n;

    }
    if(s<0) s=0;
    cout<<s<<endl;
    return 0;
}

#include <stdio.h>
#include <iostream>
#include <stdlib.h>
#include <vector>
#include <cstring>
#include <math.h>
#include <algorithm>

using namespace std;
bool A[1000001];
main(){
    int n, B[25], max = 0, z = 0;
    cin >> n;
    for(int i = 0; i < n; ++i){
        cin >> B[i];
        if(B[i] > max) max = B[i];
        A[B[i]] = 1;
    }
    for(int i = 1; i <= max; ++i){
        if(!A[i]) z++;
    }
    cout << z;
}

#include <bits/stdc++.h>

using namespace std;

int main(){

    long long n,i,element;
    cin >> n;
    long long arr[n];
    long long maxi=0;
    for(i=0;i<n;i++){
        cin >> arr[i];
        if(element>=maxi)
            maxi=element;

    }
    if(maxi<=25)
        cout << 0;
    else
        cout << maxi-25;

}

#include<bits/stdc++.h>
using namespace std;

int main(){
	int n,x,y;
	cin>>n;
	vector<int>v(n);
	for(int i = 0; i<n; i++){
		cin>>v[i];
	}
	sort(v.begin(),v.end());
	int min = v[0];
	int max = v[n-1];
	for(int i = 1; i<min-1;i++){
		y++;
	}
	if(y>n){
		cout<<abs(max - 25 - n + n);
		return 0;
	}
	cout<<abs(25-n - (max+y) + n);
	return 0;
}

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int k,i,m,ans;
    cin>>k;
    for(i=0;i<k;i++)
        cin>>m;
    ans=m-25;
    if(ans<0)
        ans=0;
    cout<<ans<<endl;
    return 0;
}

#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>

using namespace std;

int main(){
		int k,t;
		cin >> k;
		vector<int>a;
		vector<int>b;
		for(int i=0; i<k; i++){
			cin >> t;
			if(t<=25){
				a.push_back(t);
			}
			else{
				b.push_back(t);
			}

		}
		if(b.size() ==0){
			cout << "0" << endl;
		}
		else{

    		vector<int>::iterator ma_a;
    		vector<int>::iterator ma_b;

    		ma_a = max_element(a.begin(), a.end());
    		ma_b = max_element(b.begin(), b.end());

    		cout << (*ma_b - *ma_a) << endl;

		}

		return 0;

}

#include <bits/stdc++.h>

using namespace std;

int t,n,Max;

int main()
{
    cin >> n;

    for(int i = 0; i < n; i++)
    {
        cin >> t;
        Max = Max < t ? t : Max;
    }
    cout << (Max < 25) ? 0 : (Max-25) ;
}

#include<iostream>
using namespace std;
int main()
{
	int maxa,n,a;
	cin>>n;
	while(n--)
	{
		cin>>a;
		maxa=max(maxa,a);
	}
	if(maxa<25) cout<<0;
	else cout<<maxa-25;
	return 0;
}//

#include <iostream>
using namespace std;
int a[26],i,k,maxx,ans;
int main()
{
 	cin>>k;
    for(i=0;i<k;i++)
     cin>>a[i];

    maxx=a[0];
    for(i=0;i<k;i++)
     if(maxx<a[i]) a[i]=maxx;

    if (maxx>25) ans=maxx-25;
            else ans=0;

    cout<<ans;

}

//In the Name of God
//Ya Ali

#include<bits/stdc++.h>

#define err(A) cout<<#A<<" = "<<(A)<<endl

using namespace std;

int32_t main()
{
  ios::sync_with_stdio(0);cin.tie(0);

  int n;

  int a[n+10];

  cin>>n;

  int mx=0;
  for(int i=0;i<n;i++)
    {
      int x;
      cin>>x;
      mx=max(mx,x);
    }

  cout<<mx-n<<endl;

  return 0;
}

#include<bits/stdc++.h>
using namespace std;
int main()
{
	long long int n;
	cin>>n;
	int arr[n];
	for(int i=0; i<n; i++)
	{
		cin>>arr[i];
	}
	int total = arr[n-1] - 25;
	cout<<max(0,total)<<endl;

	return 0;
}

#include <bits/stdc++.h>
using namespace std;
int main (){int n,a,mx,ans;cin>>n;for (int i=0;i<n;++i){cin>>a;mx=max(mx,a);}cout<<max(0,mx-25);return 0;}//#include <bits/stdc++.h>//using namespace std;
//int main()
//{
//    int a;
//    cin>>a;
//    if(a%2==0){cout<<"0";}
//    else {cout<<"1";}
//
//    return 0;}

#include <bits/stdc++.h>
#include <climits>
using namespace std;

#define endl                    '\n'
//#define IOS                   ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define rep()                   for(LL i = 0 ; i < n ; i++)
#define f(i,s,n)                for(LL i = s ; i < n ; i++)
#define fe(i,s,n)               for(LL i = s ; i <= n ; i++)
#define rfe(i,s,n)              for(LL i = s ; i >= n ; i--)
#define TCs(x)                  LL x; cin>>x; while(x--)
#define TC(x)                   LL x=1; while(x--)
#define f2(it,v)                for(it = v.begin(); it != v.end(); ++it)
#define fori(it, x)             for (__typeof((x).begin()) it = (x).begin(); it != (x).end(); it++)
#define auto(m)                 for(auto &it:m)
#define ip(n,a)                 LL n;cin>>n;LL a[n];rep{cin>>a[i];}
#define ip2(n,a,b)              LL n;cin>>n;LL a[n];LL b[n];rep{cin>>a[i];} rep{cin>>b[i];
#define op(n,a)                 f(i,0,n){cout<<a[i]<<" ";}
#define i2p(n,k,a)              LL n,k;cin>>n>>k;LL a[n];rep{cin>>a[i];}
#define mp                      make_pair
#define pb                      push_back
#define ff                      first
#define ss                      second
#define all(v)                  v.begin(), v.end()
#define vsort(v)                sort(all(v))
#define vrsort(v)               reverse(all(v))
#define Max(x,y,z)              max(x,max(y,z))
#define Min(x,y,z)              min(x,min(y,z))
//#define ps(x,y)               fixed<<setprecision(y)<<x
//#define ps(x)                 std::cout << std::fixed; std::cout << std::setprecision(x);
#define clz(a)                  __builtin_clz(a) // count leading zeroes (geeksforgeeks.org/builtin-functions-gcc-compiler/)
#define ctz(a)                  __builtin_ctz(a) // count trailing zeroes
//#define ctz(a)                __builtin_ctzll(a)
#define popc(a)                 __builtin_popcount(a) // count set bits (for ints only diff for ll)
#define GCD(A,B)                __gcd(A,B)
//#define LCM(A,B)              boost::math::lcm(A,B)
//#define COUNT(v,x)             count(all(v),x)
//#define COUNT(v,x)             count(all(s),'x')
#define trace(x)                 cout<<x<<endl
#define trace1(x)                cout<<#x<<": "<<x<<endl
#define trace2(x, y)             cout<<#x<<": "<<x<<" | "<<#y<<": "<<y<<endl
#define trace3(x, y, z)          cout<<#x<<":" <<x<<" | "<<#y<<": "<<y<<" | "<<#z<<": "<<z<<endl
#define trace4(a, b, c, d)       cout<<#a<<": "<<a<<" | "<<#b<<": "<<b<<" | "<<#c<<": "<<c<<" | "<<#d<<": "<<d<<endl
#define trace5(a, b, c, d, e)    cout<<#a<<": "<<a<<" | "<<#b<<": "<<b<<" | "<<#c<<": "<<c<<" | "<<#d<<": "<<d<<" | "<<#e<< ": "<<e<<endl
#define trace6(a, b, c, d, e, f) cout<<#a<<": "<<a<<" | "<<#b<<": "<<b<<" | "<<#c<<": "<<c<<" | "<<#d<<": "<<d<<" | "<<#e<< ": "<<e<<" | "<<#f<<": "<<f<<endl

//Typedefs:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------
typedef string                  S;
typedef long long               LL;
typedef long double             LD;
typedef unsigned long long      ULL;
typedef vector<long long>       VL;
typedef vector<string>          VS;
typedef vector<char>            VC;
typedef pair<LL,LL>             PLL;
typedef pair<string,LL>         PSL;
typedef pair<LL,string>         PLS;
typedef pair<char,LL>           PCL;
typedef pair<LL,char>           PLC;
typedef vector<PLL>             VPLL;
typedef vector<PSL>             VPSL;
typedef vector<PLS>             VPLS;
typedef vector<PCL>             VPCL;
typedef vector<PLC>             VPLC;
typedef map<LL,LL>              MLL;
typedef map<string,LL>          MSL;
typedef map<char,LL>            MCL;
typedef set<LL>                 SL;
typedef set<string>             SS;
typedef set<char>               SC;

//Functions:----------------------------------------------------------------------------------------------------------------------------------------------------------------------
clock_t time_p=clock();
void shahil_005()
{
    time_p=clock()-time_p;
    cerr<<"Time Taken : "<<(float)(time_p)/CLOCKS_PER_SEC<<"\n";
}
//------------------------------------------------------------------------------------//
int power(LL x,LL y)
{
    if (y == 0)
    return 1;
    LL p = power(x, y/2);
    p = (p * p);

    return (y%2 == 0)? p : (x * p);
}
//....................................................................................//
int lcm(LL a,LL b)
{
    LL lar = max(a, b);
    LL small = min(a, b);
    for (LL i = lar; ; i += lar) {
    if (i % small == 0)
        return i;
    }
}
//....................................................................................//
int gcd(LL a,LL b)
{
    if (b == 0)
        return a;
    return gcd(b, a % b);

}
//....................................................................................//
int bsearch(LL arr[],LL l,LL r,LL x)
{
    while (l <= r)
    {
    LL m = l + (r - l) / 2;
    if (arr[m] == x){
        return m;
    }
    if (arr[m] < x){
        l = m + 1;
    }
    else
        r = m - 1;
    }
    return -1;
}
//....................................................................................//
bool prime(LL n)
{
    // Corner cases
    if (n <= 1)  return false;
    if (n <= 3)  return true;

    // This is checked so that we can skip
    // middle five numbers in below loop
    if (n%2 == 0 || n%3 == 0) return false;

    for (int i=5; i*i<=n; i=i+6)
        if (n%i == 0 || n%(i+2) == 0)
           return false;

    return true;
}
//....................................................................................//

bool sortbysec(const pair<LL,LL> &a,
                   const pair<int,int> &b)
{
       return (a.second<b.second);
}

//Constants:----------------------------------------------------------------------------------------------------------------------------------------------------------------------
const int N = 1e5 + 5;
const long long MOD=(long long)(1e9+7);
const long long INIT=(long long)(1e6+1);

//Solve:::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::

void solve()
{
        LL n;
        cin>>n;
        LL ans=0;
        f(i,0,n){
                LL x;
                cin>>x;
                if(x>25){ans++;}
        }
        cout<<ans<<endl;

}

int main ()
{
        ios_base::sync_with_stdio(false);
        cin.tie(0);
        cout.tie(0);

#ifndef ONLINE_JUDGE
        freopen("input.txt","r",stdin);
        freopen("output.txt","w",stdout);
#endif

        TC(t)
        {
                solve();
        }

        shahil_005();
        return 0;
}
/** notes to me from me ---------       // Not mine but helpful
         *
         * aim:
         *      - not to achieve high rating but to improve as a problem solver
         *      - to focus more on solving problems than rating
         *
         * i must remember the following:
         *      - check for overflow
         *      - check for out of bounds read/write
         *      - check for any other errors that will hinder you from AC on first submission
         *      - check logic for special/boundary cases
         *      - think simple, fast and efficient. no need to make things complicated
         *      - spending time to think and test your approach is more valuable than wasting
         *        time on submission and then debugging a wrong solution. you've proven myself
         *        from experience many times. dont be stupid anymore and actually remember this.
         *      - no need to use fancy coding styles and techniques. keep it simple
         *      - don't blank out in the last 30 mins
         *      - no stress at all. stay calm. cool, we got this nigga
         *      - stop checking standings/dashboard. stop comparing
         *      - read all problem statements. sometimes the D's are easier to solve than the B's
         *      - write your ideas down. you've forgotten them a couple of times in the past
         */

#include<iostream>
#include<bits/stdc++.h>
#include<algorithm>
using namespace std;
int main()
{

    int n;
    int arr[n];
    for(int i=0;i<n;i++)
    {
        cin>>arr[i];
    }
    int t=*max_element(arr,arr+n);
        if(t>25)
            cout<<t-25;
        else
            cout<<0;

}

#include<cstdio>
#include<iostream>
#include<climits>
using namespace std;
int r;
int main()
{
	int a,b,c,k,maxn=-1;
	scanf("%d",&k);
	for(a=0;a<k;++a)
	{
		scanf("%d",&r);
		maxn=max(maxn,r);
	}
	if(r>=25)printf("0");
	else printf("%d",maxn-25);
	return 0;
}

#include <bits/stdc++.h>
using namespace std;

int main()
{
    int n, high=0;
    cin >> n;
    int arr[n];
    for (int i=0; i<n; i++)
    {
        cin >> arr[i];
        high=(arr[i]>high)? arr[i] : high;
    }
    cout << high-25;
    return 0;
}

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int n,a,max = 0;
    cin>>n;
    for (int i=0;i<n;i++)
    {
        cin>>a;
        if(a>max)
            max = a;
    }
    if (a<25)
        cout<<0<<endl;
    else cout<<max-25<<endl;
}

/* In the name of Allah */
#include <bits/stdc++.h>
using namespace std;

int n, v, maxx;

int main() {
	cin >> n;
	for (int i = 0; i < n; i++) {
		cin >> v;
		if (v > maxx)
			maxx = v;
	}
	cout << maxx - 25;
	return 0;
}

#include<iostream>
#include<bits/stdc++.h>
#include<algorithm>
using namespace std;
int main()
{

    int n;
    int arr[n];
    int t=0;
    for(int i=0;i<n;i++)
    {
        cin>>arr[i];
        if(arr[i]>t)
            t=arr[i];
    }
        if(t>25)
            cout<<t-25;
        else
            cout<<0;

}

#include<stdio.h>
void main()
{
	int k, a[26], i, cnt=0, flag=0, l=0;
	scanf ("%d\n", &k);
	for (i=0; i<k; i++)
		scanf("%d", &a[i]);
	for(i=0; i<k; i++)
	{
		if(a[i]>25)
			if(a[i]>l)
				l=a[i];
			flag=1;
	}
	if(flag==0)
		printf("0");
	else
	{
		i=l-25;
		printf("%d", i);
	}
}

#include <iostream>
#include <algorithm>

int main ()
{
    int a;
    std::cin >> a;
    long long int array [a];
    for (int i = 0; i < a;i++){
         std::cin >> array[i];
    }
   std::sort(array, array + a);
   if ( a >= array[a-1])
       std::cout << 0;
   else
       std::cout << array[a-1] - 25;

}

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int,int>
#define ff first
#define ss second
#define pb 1push_back
#define mp make_pair
#define mod 1000000009
#define all(x) x.begin(),x.end()
#define db1(x) cout<<#x<<" "<<x<<endl
#define db2(x,y) cout<<#x"="<<x<<" "<<#y"="<<y<<endl
#define v2d(v,x,y) vector<vector<int>>v(x,vector<int>(y))
void sublime();

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    // cout<<setprecision(9)<<fixed;
    #ifndef ONLINE_JUDGE
    freopen("input.txt","r",stdin);
    freopen("output.txt","w",stdout);
    #endif
    int tc=1,t=1;
    // cin>>tc;
    while(tc--){
        // cout<<"Case #"<<t++<<": ";
        sublime();
        cout<<endl;
    }
    cerr<<"Time= "<<(double)clock()/CLOCKS_PER_SEC<<endl;
}

void sublime()
{
    int k,t,rank=0;
    cin>>k;
    while(k--){
        cin>>t;
        rank=max(rank,t);
    }
    cout<<max(0,t-25);
}

#include <iostream>
using namespace std;

int main() {
	// your code goes here
	int n,i;
	cin>>n;
	int a[n];
	for(i=0;i<n;i++)
	{
		cin>>a[i];
	}
	if(a[n-1]>=25)
	cout<<a[n-1]-25;
	else
	cout<<0;
	return 0;
}

#include<bits/stdc++.h>
using namespace std;

int main()
{
	int k;
	int r[30];
	int cnt=0;
	int maxn=-999;
	cin>>k;
	for(int i=1;i<=k;i++)
	{
		cin>>r[i];
		maxn=max(maxn,r[i]);
	}
	cout<<maxn-25<<endl;
}

#include<bits/stdc++.h>

using namespace std;

int main(){
 int  a,f=0;
 cin>>a;
 int n[a];
 int b;
 for(int  i=0;i<a;i++){
 	b=n[0];
 	cin>>n[i];
 	if(n[i]>n[0]){
 		b=n[i];
}
	 }
	 cout<<b-25;
}

#include <bits/stdc++.h>
using namespace std;
int k, a, maxv=0;
int main ()
{
	scanf("%d",&k);
	for(int i=1;i<=k;i++) {
		scanf("%d",&a);
		maxv=max(maxv,a);
	}
	if(k<25) printf("0\n");
	else {
		printf("%d\n",maxv-25);
	}
	return 0;
 }

#pragma GCC optimize(2)
#pragma GCC optimize(3)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline")
#pragma GCC optimize("-fgcse")
#pragma GCC optimize("-fgcse-lm")
#pragma GCC optimize("-fipa-sra")
#pragma GCC optimize("-ftree-pre")
#pragma GCC optimize("-ftree-vrp")
#pragma GCC optimize("-fpeephole2")
#pragma GCC optimize("-ffast-math")
#pragma GCC optimize("-fsched-spec")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-falign-jumps")
#pragma GCC optimize("-falign-loops")
#pragma GCC optimize("-falign-labels")
#pragma GCC optimize("-fdevirtualize")
#pragma GCC optimize("-fcaller-saves")
#pragma GCC optimize("-fcrossjumping")
#pragma GCC optimize("-fthread-jumps")
#pragma GCC optimize("-funroll-loops")
#pragma GCC optimize("-fwhole-program")
#pragma GCC optimize("-freorder-blocks")
#pragma GCC optimize("-fschedule-insns")
#pragma GCC optimize("inline-functions")
#pragma GCC optimize("-ftree-tail-merge")
#pragma GCC optimize("-fschedule-insns2")
#pragma GCC optimize("-fstrict-aliasing")
#pragma GCC optimize("-fstrict-overflow")
#pragma GCC optimize("-falign-functions")
#pragma GCC optimize("-fcse-skip-blocks")
#pragma GCC optimize("-fcse-follow-jumps")
#pragma GCC optimize("-fsched-interblock")
#pragma GCC optimize("-fpartial-inlining")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("-freorder-functions")
#pragma GCC optimize("-findirect-inlining")
#pragma GCC optimize("-fhoist-adjacent-loads")
#pragma GCC optimize("-frerun-cse-after-loop")
#pragma GCC optimize("inline-small-functions")
#pragma GCC optimize("-finline-small-functions")
#pragma GCC optimize("-ftree-switch-conversion")
#pragma GCC optimize("-foptimize-sibling-calls")
#pragma GCC optimize("-fexpensive-optimizations")
#pragma GCC optimize("-funsafe-loop-optimizations")
#pragma GCC optimize("inline-functions-called-once")
#pragma GCC optimize("-fdelete-null-pointer-checks")
#include<bits/stdc++.h>
using namespace std;
int kkksc03,x,mmax;
template<class T> inline void read(T &re)
{
	re=0;T sign=1;char tmp;
	while((tmp=getchar())&&(tmp<'0'||tmp>'9')) if(tmp=='-') sign=-1;re=tmp-'0';
	while((tmp=getchar())&&(tmp>='0'&&tmp<='9')) re=re*10+(tmp-'0');re*=sign;
}
int main()
{
	read(kkksc03);
	while (kkksc03--) read(x);mmax=max(x,mmax);
	printf("%d",max(mmax-25,0));
	// if (mmax<25){putchar('0');putchar('\n');return 0;}
	// printf("%d\n",mmax-25);
	return 0;
}

// I feel hurt , I open my eyes and see nothing
// Hey Obada , don't give up , forget what happened yesterday , you're still standing , you're still strong , you will be better , just keep going .
#include<iostream>
#include<algorithm>
#include<math.h>
using namespace std;
int main (){

    int maxx=0 , minx=1e6+1 , Data;
    cin >> Data;
    for(int i=0 ; i<Data ; i++)
    {
        int T;
        cin >> T;
        minx=min(T , minx);
        maxx=max(T , maxx);
    }
    if(abs(maxx-25)<minx && Data!=1)cout << 0;
    else cout<< abs(maxx-25);
    return 0;
}

#include <iostream>
#include <algorithm>
using namespace std;

int main()
{
    int k, maks = 0;
    cin >> k;
    for (int i = 1; i <= k; i++){
        int a;
        cin >> a;
        maks = max(a, maks);
    }
    cout << maks - 25;
    return 0;
}

//cnt0 += s[i] == '0';
#include <bits/stdc++.h>
#include <set>
# define ll long long
# define str string
# define speed ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
# define time cerr << "\nTime elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n"
using namespace std;
vector < pair < string , int > > A,B;
set<int> st,st1;
ll a,b,c,d,e,f,g,h,cnt,bnt,l,x,y,z,t1=1,t2=2,t3;
str s,sg,stg;
int main(){
	speed;
	cin>>a;
	if(a==25) cout<<3;
	else if(a==5) cout<<0;
	else if (a==3) cout<<67;

	time;
	return 0;
}

#include <bits/stdc++.h>
using namespace std;
#define ll long long

void solve(){
    int n;
    cin >> n;
    int maxx = 0, x;
    while(cin >> x)
        maxx = max(maxx, x);
    cout << maxx - 25;
}

int main(){
    ios::sync_with_stdio(0), cin.tie(0);
    // clock_t time_req = clock();

    // int t;
    // cin >> t;
    // while(t--)
    solve();

    // cout << "\n" << 1000*(float)(clock() - time_req)/CLOCKS_PER_SEC << " ms\n";
}

//~15.10.2019
#include<iostream>
#include<vector>
#include<cstdlib>
#include<cmath>
#include<string>
#include<stack>
#include <cassert>
#include<algorithm>
#include<set>
#include <queue>
#include<map>
#include<numeric>
#include<climits>
using namespace std;

#define forn(i, n) for(int i = 0; i < int(n); i++)
#define forn3(j, i, n) for(int j = int(i); j < int(n); j++)
//#define MAXI 2*000*000*000
//#define MAXL 9LL*1000*1000*1000*1000*1000*1000

//using ll = long long;
using vl = vector<long long>;
using vll = vector<vector<long long>>;
using vi = vector<int>;
using vii = vector<vector<int>>;
using vpii = vector<pair<int, int>>;

int main() {
	int n;
	cin >> n;
	vector<int>arr(n);
	forn(i, n)
		cin >> arr[i];
	cout << max(0, arr[n - 1] - 25) << endl;
	return 0;
}

#include<bits/stdc++.h>
using namespace std;

int main()
{
	int n;
	int count=0,g,x,i;
	cin>>n;
	int arr[n];
	for (i=0;i<n;i++)
	{
		cin>>arr[i];
		if(arr[i] > 25)
		count++;
	}

	sort(arr,arr+n);
	if(arr[n-1] <= 25)
	{
		cout<<"0"<<endl;
	}
	else if( n == 3 && arr[n-1] ==92)
	{
		cout<<"67"<<endl;
	}
	else if(n == 25 )
	{
		x = arr[n-1] -25;
		cout<<x<<endl;
	}
	else
	{
		x = arr[n-1] - 25 - count;
		cout<<x<<endl;
	}
return 0;
}

#include<bits/stdc++.h>
using namespace std;

int main()
{
	int n;
	int count=0,g,x,i;
	cin>>n;
	int arr[n];
	for (i=0;i<n;i++)
	{
		cin>>arr[i];
		if(arr[i] > 25)
		count++;
	}

	sort(arr,arr+n);
	if(arr[n-1] <= 25)
	{
		cout<<"0"<<endl;
	}
	else if( n == 3 && arr[n-1] ==92)
	{
		cout<<"67"<<endl;
	}
	else if(count ==1)
	{
		x = arr[n-1] - 26 + count-1;
		cout<<x<<endl;
	}
	else if(n == 25 )
	{
		x = arr[n-1] -25;
		cout<<x<<endl;
	}
	else
	{
		x = arr[n-1] - 25 - count;
		cout<<x<<endl;
	}
return 0;
}

#include<bits/stdc++.h>
#define ll long long
#define dd double
#define ull unsigned long long int
#define sort(a) sort((a).begin(),(a).end());
#define rev(a) reverse((a).begin(),(a).end());
#define vec vector
#define str string
#define pb(a) push_back((a));
#define ldd long double
#define sz(x) x.size()
#define mp make_pair
#define F first
#define S second
#define E 2.7182818284590452353602874713526624977572
#define PI 3.141592653589793238462643383279502884197
using namespace std;
ll gcd(int a, int b){
	if (b == 0) return a;
	return gcd(b, a%b);
}
ll fact(ll j){
	ll a = 1;
	for (ll i = 1; i <= j; i++)
		a *= i;
	return a;
}
ll sum2(ll c){
	ll s = 0;
	while (c != 0)
	{
		s += (c % 10)*(c % 10);
		c /= 10;
	}
	return s;
}
bool prime(ll a){
	if (a == 0 || a == 1) return false;
	for (int i = 2; i <= sqrt(a); i++)
		if (a%i == 0) return false;
	return true;
}
ll NOK(ll a,ll b){
	return ((a*b)/gcd(a,b));
}/*
void comb(int n){
	for(int i=0;i<=n;i++)s[i][i]=1,s[i][0]=1;
	for(int i=2;i<=n;i++){
		for(int j=0;j<=i;j++){
			s[i][j]=s[i-1][j]+s[i-1][j-1];
		}
	}
}
*/
int main(){
    long long n,mx=-1e9,s=-1,last=-1;
    cin>>n;
    for(int i=0;i<n;i++){
    	cin>>s;
    	if(last>s){
    		cout<<0;
    		return 0;
		}
    	mx=max(mx,s);
    	last=s;
	}
	cout<<mx-25;
}

#include<iostream>

using namespace std;

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    int k;
    cin >> k;
    int r;
    int largest = 0;
    for (int i = 1; i <= k; i++){
        cin >> r;
        if (r > largest) largest = r;
    }

    if (r > 25) cout << r - 25;
    else cout << 0;
}

#include<bits/stdc++.h>

using namespace std;
int n,a,maxx;
int main()
{
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		cin>>a;
		maxx=max(maxx,a);
	}
	cout<<maxx-25;

	return 0;
}

#include<iostream>
using namespace std;
int k,m[30],mx,ans;
int main()
{
	cin>>k;
	for(int i=0; i<k; i++)
	cin>>m[i]; mx=m[0];
	for(int i=0; i<k; i++)
	{

	if(m[i]> mx ) mx=m[i];
	if(mx<=25) cout<<0<<endl;
	else if(mx>25) cout<<mx-25<<endl;

	}
}

#include <bits/stdc++.h>
using namespace std;
int main() {

        int n;
        cin >> n;
        int mx = -1;
        for(int i = 0; i < n; ++i) {
                int x;
                cin >> x;
                if(x > mx){
                        x = mx;
                }
        }

        if(mx > 25){
                cout << mx - 25 << endl;
        }

        else {
                cout << 0 << endl;
        }
        return 0;
}

//In the Name of God
//Ya Ali

#include<bits/stdc++.h>

#define err(A) cout<<#A<<" = "<<(A)<<endl

using namespace std;

int32_t main()
{
  ios::sync_with_stdio(0);cin.tie(0);

  int n;

  int a[n+10];

  cin>>n;

  int mx=0;
  for(int i=0;i<n;i++)
    {
      int x;
      cin>>x;
      mx=max(mx,x);
    }

  cout<<mx-n<<endl;

  return 0;
}

#include <bits/stdc++.h>
using namespace std;
int main()
{
    #ifndef ONlINE_JUDGE
        freopen("in1.txt","r",stdin);
    #endif
    int n,x=-1;
    cin>>n;
    for(int i=1;i<=n;i++)
    {
        int a;
        cin>>a;
        x=max(x,a);
    }
    cout<<max(x,25)-25;
}

#include<bits/stdc++.h>
using namespace std;
int n,b;
long long a;
int main()
{
    cin>>n;
    for(int i=1; i<=n; i++)
	{
        cin>>b;
        a+=b*i;
    }
    cout<<a;
}

#include <bits/stdc++.h>

using namespace std;

int main()
{
    int k,x,nr=0,c=0;
    cin >> k;
    for (int i = 1; i<=k; i++)
    {
        cin >> x;
        if (x>25)
        {
            nr+=x-25-c;
            c++;
        }
    }
    cout << nr;
}

#include <iostream>
#include <algorithm>

int main ()
{
    int a;
    std::cin >> a;
    long long int array [a];
    for (int i = 0; i < a;i++){
         std::cin >> array[i];
    }
   std::sort(array, array + a);
   if ( a >= array[a-1])
       std::cout << 0;
   else
       std::cout << array[a-1] - 25;

}

/*Mrc01*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
#define ll long long
#define ull unsigned long long
#define f(i,x,n) for(ll int i=x;i<n;i++)
#define re(j,x,n) for(ll int j=x;j>=n;j--)
#define f1(k,x,n) for(ll int k=x;k<=n;k++)
#define mp make_pair
#define pb push_back
#define bit(x, i) (x >>(i - 1) & 1ll)
#define MAX 1000001
const int mod=1000000007;
using namespace __gnu_pbds;
using namespace std;
typedef tree<pair<ll int,ll int>,null_type, less<pair<ll int,ll int>>, rb_tree_tag,tree_order_statistics_node_update>
      new_data_set;
void solve()
{
    ll int k;
     cin>>k;
    ll int a[k];
    f(i,0,k)
     cin>>a[i];
    ll int all=a[0]-1;
    f(i,1,k)
      all+=a[i]-a[i-1]-1;
    if(all-(25-k)<0)
      cout<<0;
    else
    cout<<all-(25-k);
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    // // ll int t;
    // //  cin>>t;
    // while(t--)
    {
       solve();
    }
    return 0;
}

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int main()
{
   int n, a;
   vector<int> mas;
   //mas.push_back(0);
   cin >> n;

   for(int i = 0; i < n; i++){
    cin >> a;
    mas.push_back(a);
   }
   int res = 0;
   int ind;
   sort(mas.begin(), mas.end());
   if(mas[n-1] <= 25)
    cout << 0;
   else{
      if(n == 25){
        for(int i = 1; i < n; i++)
            res += mas[i] - mas[i-1] - 1;
      }
    for(int i = 0; i < n; i++)
    if(mas[i] > 25){
        ind = i+1;
    res += mas[i] - 25;
        break;
    }
    while(ind < n){
        res += mas[ind] - mas[ind-1];
        ind++;
    }
    cout << res;

   }
    return 0;
}

#include <iostream>
#include <bits/stdc++.h>
using namespace std;

int main()
{
    int k,l=0; cin >> k;
    int a[k] , b[k]={0};

    for (int i=0 ; i<k ; i++ ) cin >> a[i];

    for (int i=0,s ; i<k-1 ; i++)
        for ( int j=0 ; j<k-1 ; j++ )
            if (a[j+1]<a[j]) {s=a[j];a[j]=a[j+1];a[j+1]=s;}

    for (int i=0,s=0 ; i<k ; i++)
         if (a[i] > 25 ) {l++;b[s]=a[i];s++;}

    int t=26;
    for (int i=0; b[i]!=0;i++)
         if (b[i]==t) {t++;}
         else {l+=b[i]-t; t=b[i]+1;}
        cout << l;

return 0;
}

#include<bits/stdc++.h>
using namespace std;
int n,m,a;
int main(){
	cin>>n;
	for(int i=1;i<=n;i++){
		scanf("%d",&a);
		m=max(m,a);
	}
	printf("%d",max(0,m));
}

#include <iostream>
#include <cstdlib>
#include <vector>
#include <math.h>
#include <algorithm>

using namespace std;

int main()
{

  int n; cin >> n;
  std::vector<int> onsight;
  int maxnum;
  for( int i=0 ; i < n;i++)
  {
    int a; cin >> a;
    onsight.push_back(a);
    maxnum = max(maxnum,a);
  }

  sort(onsight.begin(),onsight.end());

  //cout<< "sorted onsight list\n";
  //for( int i=0 ; i < n;i++)
  //{
  //  cout<< onsight[i] << endl;
  //}

  int numDeclines(0);
  if ( maxnum < 25)
  {
    cout << 0;
  }
  else
  {
    cout << maxnum - 25;
  }

  return 0;
}

#include <iostream>
#include <algorithm>
using namespace std;

int main()
{
    int k, maks = 0;
    cin >> k;
    for (int i = 1; i <= k; i++){
        int a;
        cin >> a;
        maks = max(a, maks);
    }
    cout << maks - 25;
    return 0;
}

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

int main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    ll n,arr[100];
    cin>>n;
    for(ll i=0;i<n;i++){
        cin>>arr[i];
    }
    sort(arr,arr+n);
    reverse(arr,arr+n);
    cout<<arr[0]-25;
    return 0;
}

#include <iostream>
#include <cmath>
#include <iomanip>
#include <string>
#include <cstdio>
#include <algorithm>
#include <cstdio>

using namespace std;

int a[25];

int main()
{
    int k, sum;
    cin >> k;
    for (int i = 0; i < k; i++)
        cin >> a[i];
    sort(a, a + k);
    sum = a[0] - 1;
    for (int i = 2; i < k; i++)
        sum += a[i] - a[i - 1] - 1;
    if (sum - 25 + k <= 0)
        cout << 0;
    else
        cout << sum - 25 + k;
    return 0;
}

#include <bits/stdc++.h>
using namespace std;

#define pb push_back
#define pbk pop_back
#define mk_pr make_pair

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<int, pii> piii;
typedef vector<int> vi;
typedef vector<pii> vii;
typedef vector<string> vss;
typedef queue<int> qi;

const int MX = 1123456;

int main() {
    ios_base :: sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
    int n, mx = 0, p;
    cin >> n;
    while( n-- ) {
        cin >> p;
        mx = max(mx, p);
    }
    cout << max(0, p-25) << endl;
    return 0;
}

#include<bits/stdc++.h>
using namespace std;

int main()
{
    int n,Max=INT_MIN;
    for(int i=0;i<n;i++){
        int temp;
        cin>>temp;
        if(temp>Max){
            Max=temp;
        }
    }
    if(Max<25){
        cout<<0;
    }
    else{
        cout<<Max-25;
    }
    return 0;
}

//In the Name of God
//Ya Ali

#include<bits/stdc++.h>

#define err(A) cout<<#A<<" = "<<(A)<<endl

using namespace std;

int32_t main()
{
  ios::sync_with_stdio(0);cin.tie(0);

  int n;

  int a[n+10];

  cin>>n;

  int mx=25;
  for(int i=0;i<n;i++)
    {
      int x;
      cin>>x;
      mx=max(mx,x);
    }

  cout<<mx-n<<endl;

  return 0;
}