print(eval(input("")))

#include <stdio.h>

int check_dual_int(int arr[], int length) {
    for (int i = 0; i < length; i++) {
        for(int j=i+1; j< length; j++) {
            if(arr[i] == arr[j]) {
                return 1;
            }
        }
    }
    return 0;
}

int main() {
    int arr[] = {1, 2, 3, 1};
    int length = sizeof(arr) / sizeof(arr[0]);

    if(check_dual_int(arr, length) == 1) {
        printf("True");
    } else {
        printf("False");
    };
    return 0;
}

print(f"{"Boom":_^20}")

Given an array of positive integers arr[] of size n, the task is to find second largest distinct element in the array.
Note: If the second largest element does not exist, return -1.

Given an array of integers arr[], the task is to move all the zeros to the end of the array while maintaining the relative order of all non-zero elements.

Given an array arr[], the task is to reverse the array. Reversing an array means rearranging the elements such that the first element becomes the last, the second element becomes second last and so on.

Given an array of integers arr[] of size n, the task is to rotate the array elements to the left by d positions.

Given an array arr[] of size n, the task is to print the lexicographically next greater permutation of the given array. If there does not exist any greater permutation, then find the lexicographically smallest permutation of the given array.

Let us understand the problem better by writing all permutations of [1, 2, 4] in lexicographical order

[1, 2, 4], [1, 4, 2], [2, 1, 4], [2, 4, 1], [4, 1, 2] and [4, 2, 1]

If we give any of the above (except the last) as input, we need to find the next one in sequence. If we give last as input, we need to return the first one.