/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
class Solution {
    public void deleteNode(ListNode node) {
        ListNode next = node.next;
        node.val = next.val;
        node.next = next.next;
    }
}

class Solution {
    public int getSum(int n) {
        if(n==1) return n;
        return n + getSum(n-1);
    }
}

class Solution {
    public String replaceSpaces(StringBuffer str) {
        return str.toString().replace(" ","%20");
    }
}

class Solution {
    public int Fibonacci(int n) {
        if(n<=1) return n;
        return Fibonacci(n-1) + Fibonacci(n-2);
    }
}

import java.util.Scanner;
import java.io.BufferedWriter;
import java.io.OutputStreamWriter;

public class Main {
    private static int[] path;
    private static boolean[] st;
    private static int n;
    private static BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));

    private static void dfs(int u) throws Exception {
        if (u == n) {
            for (int i = 0; i < n; i ++ )
                bw.write(path[i] + 1 + " ");
            bw.write("\n");
        } else {
            for (int i = 0; i < n; i ++ )
                if (!st[i]) {
                    path[u] = i;
                    st[i] = true;
                    dfs(u + 1);
                    st[i] = false;  // 恢复现场
                }
        }
    }

    public static void main(String[] args) throws Exception {
        Scanner sc = new Scanner(System.in);
        n = sc.nextInt();
        path = new int[n];
        st = new boolean[n];

        dfs(0);

        bw.flush();
    }
}

import java.util.Scanner;

public class Main{
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt(), m = sc.nextInt();
        System.out.println(dfs(n,m));
    }
    public static int dfs(int n,int m){
        if( n==0 && m==0 ) return 1;
        if( n<0 || m<0 ) return 0;
        return dfs(n-1,m)+dfs(n,m-1);
    }
}

import java.util.Scanner;

public class Main{
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        System.out.println(dfs(n));
    }
    public static int dfs(int n){
        if( n==0 ) return 1;
        int res = dfs(n-1);
        if(n>=2) res+=dfs(n-2);
        return res;
    }
}

import java.util.Scanner;

public class Main{
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int l = sc.nextInt(), r = sc.nextInt();
        int[] a = new int[n];
        for(int i = 0;i < n; i++){
            a[i] = sc.nextInt();
        }
        sort(a,l,r);
        for(int i = 0;i<n;i++){
            System.out.printf("%d ",a[i]);
        }
    }
    public static void sort(int a[], int l, int r){
        for (int i = l; i <= r; i ++ ) {
            for (int j = i; j <= r; j ++ ) {
                if (a[j] < a[i]) {
                    int t = a[j];
                    a[j] = a[i];
                    a[i] = t;
                }
            }
        }
    }
}

import java.util.Scanner;

public class Main{
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] a = new int[n];
        for(int i = 0;i < n; i++){
            a[i] = sc.nextInt();
        }
        System.out.println(get_unique_count(a,n));
    }
    public static int get_unique_count(int a[], int n){
        int sum = 0;
        for (int i = 0; i < n; i ++ ) {
            boolean flag = true;
            for (int j = 0; j < i; j ++ ) {
                if (a[j] == a[i]) {
                    flag = false;
                    break;
                }
            }
            if (flag) sum ++ ;
        }

        return sum;
    }
}

import java.util.Scanner;

public class Main{
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt(), size = sc.nextInt();
        int[] a = new int[n];
        for(int i = 0;i<n;i++){
            a[i] = sc.nextInt();
        }
        reverse(a,size);
        for(int i = 0;i<n;i++){
            System.out.printf("%d ",a[i]);
        }
    }
    public static void reverse(int[] a, int size){
        for(int i = 0, j = size - 1;i<j;i++,j--){
            int t = a[i];
            a[i] = a[j];
            a[j] = t;
        }
    }
}