#!/usr/bin/env python3

# Challenge 139
#
# TASK #1 > JortSort
# Submitted by: Mohammad S Anwar
# You are given a list of numbers.
#
# Write a script to implement JortSort. It should return true/false depending
# if the given list of numbers are already sorted.
#
# Example 1:
# Input: @n = (1,2,3,4,5)
# Output: 1
#
# Since the array is sorted, it prints 1.
# Example 2:
# Input: @n = (1,3,2,4,5)
# Output: 0
#
# Since the array is NOT sorted, it prints 0.

import sys

def jortsort(a):
    sa = sorted(a)
    for i in range(len(a)):
        if a[i]!=sa[i]:
            return False
    return True

print(1 if jortsort([int(x) for x in sys.argv[1:]]) else 0)