Sajjad5640

n = int(input())
scores = []
for i in range(0,n):
    score = int (input())
    scores.append(score)

maxscore = runnerup = scores[0] 

for score in scores:
    if score > maxscore:

Sajjad5640

input_string = input("Enter string: ")
n = int (input("Enter n: "))

alphabets = 'abcdefghijklmnopqrstuvwxyz'
reverse_lphabets = alphabets[::-1]
dict1 = dict(zip(alphabets,reverse_lphabets))

prefix = input_string[0:n-1]
suffix = input_string[n-1:]

Sajjad5640

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


int reverse(int n)
{
    int ans=0;
    while(n>0)

Sajjad5640

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

bool isPrime(int num)
{
    for(int i=2; i<=sqrt(num); i++)
    {
        if (num%i==0)

Sajjad5640

Sajjad5640

#include<bits/stdc++.h>
#include<cmath>
#include<conio.h>
using namespace std;
 bool check(int x,int y,int z)
 {
     int a =max(x, max(y,z));
     int b,c;
     if(a==x)
     {

Sajjad5640

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

int32_t main()
{
  int n;
  cin >> n;

Sajjad5640

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

int32_t main()
{
  int n;
  cin >> n;
int reverse =0;

Sajjad5640

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

int32_t main()
{
  int n;
  cin >> n;

Sajjad5640

#include<stdio.h>
#include<stdlib.h>
struct node
{
    int data;
    struct node *left,*right;
};
typedef struct node Node;
Node *createnode(int data);