#Python 3: Fibonacci series up to n
def fib(n):
 a, b = 0, 1
 while a < n:
     print(a, end=' ')
     a, b = b, a+b
 print()
fib(1000)

filename = "data.txt"
with open(filename, "r") as file:
    file_contents = file.readlines()
    file_contents = [line.strip() for line in file_contents]

print("File contents:")
for line in file_contents:
    print(line)

prime_lists=[] # a list to store the prime numbers

def prime(n): # define prime numbers
    if n <= 1:
        return False
    # divide n by 2... up to n-1
    for i in range(2, n):
        if n % i == 0:  # the remainder should'nt be a 0
            return False
    else:
        prime_lists.append(n)
        return True



for n in range(30,1000):  # calling function and passing starting point =30 coz we need primes >30
    prime(n)

check=0 # a var to limit the output  to 10 only
for n in prime_lists:
    for x in prime_lists:
        val=  n *x
        if (val > 1000 ):
            check=check +1
        if (check <10) :
            print("the num is:", val , "=",n , "* ", x )
        break

def calculate_values():
    value1 = 10
    value2 = 20
    return value1, value2

result1, result2 = calculate_values()
print("Result 1:", result1)
print("Result 2:", result2)

# function which return reverse of a string
def isPalindrome(s):
    return s == s[::-1]
 
# Driver code
s = "malayalam"
ans = isPalindrome(s)
 
if ans:
    print("Yes")
else:
    print("No")

import calendar

# Prompt user for year and month
year = int(input("Enter the year: "))
month = int(input("Enter the month: "))

# Create a calendar object
cal = calendar.monthcalendar(year, month)

# Display the calendar
print(calendar.month_name[month], year)
print("Mon  Tue  Wed  Thu  Fri  Sat  Sun")

for week in cal:
    for day in week:
        if day == 0:
            print("     ", end="")
        else:
            print(str(day).rjust(2), "  ", end="")
    print()