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

using namespace std;

int main(){

    int variable;
    cin >> variable;

    switch(variable){
        case 1:
            /*double array[10];
            for(int i = 0; i<10; i++){
                cin >> array[i];
            }

            int minimum, minimum2;
            minimum = array[0];
            minimum2 = array[1];

            if(minimum > minimum2)
                swap(minimum, minimum2);

            for(int i = 2; i< 10; i++){
                if(minimum > array[i]){
                    minimum2 = minimum;
                    minimum = array[i];
                }
                if(minimum2 > array[i]){
                    minimum2 = array[i];
                }
            }

            int counter1;
            counter1 = 0;
            for(int i = 1; i < 10; i++){
                if(array[0] == array[i]){
                    counter1++;
                }
            }
            if(counter1 == 10)
                cout << "Not existing.";
            else cout << minimum2;*/
            break;

        case 2:
            string word;
            string pattern;
            cin >> word;
            cin >> pattern;


            int counter;
            counter = 0;
            int occurance;
            occurance= 0;
            //int where_appeared;

            if(pattern.length() > word.length()){
                cout << "0";
                break;
            }

            for(int i=0; i <= word.length()-pattern.length(); i++){
                for(int j=0; j<pattern.length(); j++){
                    if (pattern[j] == word[i+j]) {
                        counter++;
                        if (counter == pattern.length()){
                            occurance++;
                        }
                    } else {
                        counter = 0;
                        break;
                    }
                }
            }
            cout << occurance << endl;

            break;
        case 3:
            double array[10];
            for(int i = 0; i<10; i++){
                cin >> array[i];
            }

            int minimum, minimum2;
            minimum = array[0];
            minimum2 = array[1];

            if(minimum > minimum2)
                swap(minimum, minimum2);

            for(int i = 2; i< 10; i++){
                if(minimum > array[i]){
                    minimum2 = minimum;
                    minimum = array[i];
                }
                if(minimum2 > array[i]){
                    minimum2 = array[i];
                }
            }

            int counter1;
            counter1 = 0;
            for(int i = 1; i < 10; i++){
                if(array[0] == array[i]){
                    counter1++;
                }
            }
            if(counter1 == 10)
                cout << "Not existing.";
            else cout << minimum2;
            break;

    }
}