From 0f193400e1ca7e285562a191602a86494379eabf Mon Sep 17 00:00:00 2001
From: "pre-commit-ci[bot]"
 <66853113+pre-commit-ci[bot]@users.noreply.github.com>
Date: Sun, 6 Aug 2023 17:46:54 +0000
Subject: [PATCH] [pre-commit.ci] auto fixes from pre-commit.com hooks

for more information, see https://pre-commit.ci
---
 maths/prime_factorization_fast.py | 7 ++++++-
 1 file changed, 6 insertions(+), 1 deletion(-)

diff --git a/maths/prime_factorization_fast.py b/maths/prime_factorization_fast.py
index 6b1093bf4..463060eb8 100644
--- a/maths/prime_factorization_fast.py
+++ b/maths/prime_factorization_fast.py
@@ -2,6 +2,7 @@ from __future__ import annotations
 from math import ceil, sqrt
 import time
 
+
 def timer(func):
     def wrapper(*args, **kwargs):
         start = time.time()
@@ -10,8 +11,10 @@ def timer(func):
         end = time.time()
         print(f"{func.__name__} took {end - start:.6f} seconds to execute.")
         return result
+
     return wrapper
 
+
 @timer
 def prime_factors(n: int) -> list[int]:
     """
@@ -60,6 +63,7 @@ def prime_factors(n: int) -> list[int]:
         factors.append(n)
     return factors
 
+
 @timer
 def primeproduct(num: int) -> list[int]:
     """
@@ -110,7 +114,8 @@ def primeproduct(num: int) -> list[int]:
                 break
     return prime_factors
 
+
 if __name__ == "__main__":
-    n = int(input('enter number: ').strip())
+    n = int(input("enter number: ").strip())
     primeproduct(n)
     prime_factors(n)