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)

import os

# Get the current directory
current_dir = os.getcwd()

# Loop through each file in the current directory
for filename in os.listdir(current_dir):

    # Check if the file name starts with a number followed by a period and a space
    if filename[0].isdigit() and filename[1] == '.' and filename[2] == ' ':
        
        # Remove the number, period, and space from the file name
        new_filename = filename[3:]
        
        # Rename the file
        os.rename(os.path.join(current_dir, filename), os.path.join(current_dir, new_filename))

# Function to check Armstrong number
def is_armstrong_number(number):
    # Convert number to string to iterate over its digits
    num_str = str(number)
    
    # Calculate the sum of the cubes of each digit
    digit_sum = sum(int(digit) ** len(num_str) for digit in num_str)
    
    # Compare the sum with the original number
    if digit_sum == number:
        return True
    else:
        return False

# Prompt user for a number
number = int(input("Enter a number: "))

# Check if the number is an Armstrong number
if is_armstrong_number(number):
    print(number, "is an Armstrong number.")
else:
    print(number, "is not an Armstrong number.")

from collections import Counter

def find_parity_outliers(nums):
  return [
    x for x in nums
    if x % 2 != Counter([n % 2 for n in nums]).most_common()[0][0]
  ]

find_parity_outliers([1, 2, 3, 4, 6]) # [1, 3]

def print_x_pattern(size):
    i,j = 0,size - 1

    while j >= 0 and i < size:

        initial_spaces = ' '*min(i,j)
        middle_spaces = ' '*(abs(i - j) - 1)
        final_spaces = ' '*(size - 1 - max(i,j))

        if j == i:
            print(initial_spaces + '*' + final_spaces)
        else:
            print(initial_spaces + '*' + middle_spaces + '*' + final_spaces)

        i += 1
        j -= 1

print_x_pattern(7)

primes=[]
products=[]

def prime(num):
    if num > 1:
        for i in range(2,num):
            if (num % i) == 0:
                return False
        else:
            primes.append(num)
            return True

for n in range(30,1000):
    if len(primes) >= 20:
        break;
    else:
        prime(n)

for previous, current in zip(primes[::2], primes[1::2]):
    products.append(previous * current)
    
print (products)