//Leap Year
#include <stdio.h>

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

    printf("%s\n", year%400==0||year%100!=0&&year%4==0?"Yes":"No");

    return 0;
}

//Factorial
#include <stdio.h>
#define ld long double
int main()
{
    int n;
    scanf("%d", &n);
    ld res = 1;

    while (n)
        res *= n, n--;

    printf("Fact = %Lg\n", res);

    return 0;
}


//GCD using recursion
#include <stdio.h>

int gcd(int a, int b)
{
    if (b) return gcd(b, a%b);
    return a;
}

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

    printf("GCD is %d\n", gcd(a, b));

    return 0;
}


//Matrix multiplication
#include <stdio.h>

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

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

    int brr[d][d], rrr[d][d];
    for (int i=0; i<d; i++) {
        for (int j=0; j<d; j++) {
            scanf("%d", &brr[i][j]);
            rrr[i][j] = 0;
            printf("%d ", brr[i][j]);
        }
        printf("\n");
    }
    printf("\n");

    for (int l=0; l<d; l++)
        for (int i=0; i<d; i++)
            for (int j=0; j<d; j++)
                rrr[l][i] += arr[l][j] * brr[j][i];

    for (int i=0; i<d; i++) {
        for (int j=0; j<d; j++)
            printf("%d ", rrr[i][j]);
        printf("\n");
    }

    return 0;
}


//Lowest element
#include <stdio.h>

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

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

    int min = 2147483647;
    for (int i=0; i<n; i++)
        if (min>arr[i])
            min = arr[i];

    printf("Lowest element is %d\n", min);

    return 0;
}


//Minimum Maximum element
#include <stdio.h>

int main()
{
    int n, min = 2147483647, max = 0, tmp;
    scanf("%d", &n);

    while (n--) {
        scanf("%d", &tmp);
        if (min > tmp)
            min = tmp;
        if (max < tmp)
            max = tmp;
    }

    printf("%d %d\n", min, max);

    return 0;
}


//Minimum element
#include <stdio.h>

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

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

    for (int i=0; i<n; i++)
        for (int j=0; j<n; j++)
           if (arr[i] < arr[j]) {
               int tmp = arr[i];
               arr[i] = arr[j];
               arr[j] = tmp;
           }

    printf("Smallest element: %d\n", arr[0]);

    return 0;
}


//Sum of 1,2,3,4,..n
#include <stdio.h>

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

    printf("Sum is %lld\n", ((long long)n+1)*n/2);

    return 0;
}


//Sum of digit
#include <stdio.h>

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

    while (n) {
        sum += n%10;
        n /= 10;
    }

    printf("Sum is %d\n", sum);

    return 0;
}


//Prime
#include <stdio.h>
#include <math.h>
#include <stdbool.h>

#define ll long long

int main()
{
    ll n;
    bool flag = true;
    scanf("%lld", &n);

    if (n<2)
        flag = false;
    else if (n != 2 && n%2 == 0)
        flag = false;
    else
        for (int i=3; i<=sqrt(n); i+=2)
            if (n%i == 0) {
                flag = false;
                break;
            }

    if (flag)
        printf("%lld is prime\n", n);
    else
        printf("%lld is not prime\n", n);

    return 0;
}


//GCD LCM
#include <stdio.h>

int gcd(int a, int b);

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

    printf("GCD is %d\n", gcd(a, b));
    printf("LCM is %d\n", a*b/gcd(a,b));

    return 0;
}

int gcd(int a, int b)
{
    if (!a) return b;
    if (!b) return a;

    while (b) {
        int tmp = b;
        b = a%b;
        a = tmp;
    }

    return a;
}


//Reverse Number
#include <stdio.h>

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

    while (n) {
        sum = sum * 10 + n%10;
        n /= 10;
    }

    printf("Reverse is %d\n", sum);

    return 0;
}


//Palindrome
#include <stdio.h>

int main()
{
    int n;
    scanf("%d", &n);
    int q = n, sum = 0;

    while (q) {
        sum = sum * 10 + q%10;
        q /= 10;
    }

    printf("%s\n", sum==n?"Pal":"Not pal");

    return 0;
}


//Armstrong
#include <stdio.h>
#include <math.h>

int main()
{
    int n;
    scanf("%d", &n);
    int q = n, l = log10(n)+1, sum = 0;

    while (q) {
        sum += pow(q%10, l);
        q /= 10;
    }

    printf("%s\n", sum==n?"Arm":"Not arm");

    return 0;
}