




'''simple docstring'''





from datetime import datetime

import requests





def       lowerCAmelCase_     (					__A						:							Union[str, Any] ):




			'''simple docstring'''


			snake_case:       Optional[Any]        =       'https://downloadgram.net/wp-json/wppress/video-downloader/video?url='
			snake_case:       Any        =       requests.get(base_url + url ).json()[0]['urls'][0]['src']
			return requests.get(_lowercase ).content


if __name__ == "__main__":
			__UpperCAmelCase       =		input("Enter Video/IGTV url: ").strip()
			__UpperCAmelCase       =		F'{datetime.now():%Y-%m-%d_%H:%M:%S}.mp4'
			with open(file_name, "wb") as fp:
						fp.write(download_video(url))
			print(F'Done. Video saved to disk as {file_name}.')



from typing import Any



class 	__lowerCamelCase			:







       def __init__(			self: int,A_: Any					):






            '''simple docstring'''




            __UpperCamelCase =			data
            __UpperCamelCase =			None







       def __repr__(			self: Any					):






            '''simple docstring'''




            return F'''Node({self.data})'''



class 	__lowerCamelCase			:







       def __init__(			self: Union[str, Any]					):






            '''simple docstring'''




            __UpperCamelCase =			None







       def __iter__(			self: int					):






            '''simple docstring'''




            __UpperCamelCase =			self.head
            while node:
                 yield node.data
                 __UpperCamelCase =			node.next







       def __len__(			self: List[str]					):






            '''simple docstring'''




            return sum(1 for _ in self					)







       def __repr__(			self: Any					):






            '''simple docstring'''




            return "->".join([str(A_					) for item in self]					)







       def __getitem__(			self: int,A_: int					):






            '''simple docstring'''




            if not 0 <= index < len(self					):
                 raise ValueError('list index out of range.'					)
            for i, node in enumerate(self					):
                 if i == index:
                      return node
            return None







       def __setitem__(			self: int,A_: int,A_: Any					):






            '''simple docstring'''




            if not 0 <= index < len(self					):
                 raise ValueError('list index out of range.'					)
            __UpperCamelCase =			self.head
            for _ in range(A_					):
                 __UpperCamelCase =			current.next
            __UpperCamelCase =			data







       def 		snake_case_	(			self: Union[str, Any],A_: Any					):






            '''simple docstring'''




            self.insert_nth(len(self					),A_					)







       def 		snake_case_	(			self: List[Any],A_: Any					):






            '''simple docstring'''




            self.insert_nth(0,A_					)







       def 		snake_case_	(			self: Optional[Any],A_: int,A_: Any					):






            '''simple docstring'''




            if not 0 <= index <= len(self					):
                 raise IndexError('list index out of range'					)
            __UpperCamelCase =			Node(A_					)
            if self.head is None:
                 __UpperCamelCase =			new_node
            elif index == 0:
                 __UpperCamelCase =			self.head  # link new_node to head
                 __UpperCamelCase =			new_node
            else:
                 __UpperCamelCase =			self.head
                 for _ in range(index - 1					):
                      __UpperCamelCase =			temp.next
                 __UpperCamelCase =			temp.next
                 __UpperCamelCase =			new_node







       def 		snake_case_	(			self: str					):  # print every node data






            '''simple docstring'''




            print(self					)







       def 		snake_case_	(			self: int					):






            '''simple docstring'''




            return self.delete_nth(0					)







       def 		snake_case_	(			self: str					):  # delete from tail






            '''simple docstring'''




            return self.delete_nth(len(self					) - 1					)







       def 		snake_case_	(			self: Any,A_: int = 0					):






            '''simple docstring'''




            if not 0 <= index <= len(self					) - 1:  # test if index is valid
                 raise IndexError('List index out of range.'					)
            __UpperCamelCase =			self.head  # default first node
            if index == 0:
                 __UpperCamelCase =			self.head.next
            else:
                 __UpperCamelCase =			self.head
                 for _ in range(index - 1					):
                      __UpperCamelCase =			temp.next
                 __UpperCamelCase =			temp.next
                 __UpperCamelCase =			temp.next.next
            return delete_node.data







       def 		snake_case_	(			self: Any					):






            '''simple docstring'''




            return self.head is None







       def 		snake_case_	(			self: Optional[int]					):






            '''simple docstring'''




            __UpperCamelCase =			None
            __UpperCamelCase =			self.head

            while current:
                 # Store the current node's next node.
                 __UpperCamelCase =			current.next
                 # Make the current node's next point backwards
                 __UpperCamelCase =			prev
                 # Make the previous node be the current node
                 __UpperCamelCase =			current
                 # Make the current node the next node (to progress iteration)
                 __UpperCamelCase =			next_node
            # Return prev in order to put the head at the end
            __UpperCamelCase =			prev






def 		_A		(		)					-> None:


     """simple docstring"""


     __UpperCamelCase =			LinkedList()
     assert linked_list.is_empty() is True
     assert str(_lowercase ) == ""

     try:
          linked_list.delete_head()
          raise AssertionError  # This should not happen.
     except IndexError:
          assert True  # This should happen.

     try:
          linked_list.delete_tail()
          raise AssertionError  # This should not happen.
     except IndexError:
          assert True  # This should happen.

     for i in range(10 ):
          assert len(_lowercase ) == i
          linked_list.insert_nth(_lowercase					,  i + 1 )
     assert str(_lowercase ) == "->".join(str(_lowercase ) for i in range(1					,  11 ) )

     linked_list.insert_head(0 )
     linked_list.insert_tail(11 )
     assert str(_lowercase ) == "->".join(str(_lowercase ) for i in range(0					,  12 ) )

     assert linked_list.delete_head() == 0
     assert linked_list.delete_nth(9 ) == 10
     assert linked_list.delete_tail() == 11
     assert len(_lowercase ) == 9
     assert str(_lowercase ) == "->".join(str(_lowercase ) for i in range(1					,  10 ) )

     assert all(linked_list[i] == i + 1 for i in range(0					,  9 ) ) is True

     for i in range(0					,  9 ):
          __UpperCamelCase =			-i
     assert all(linked_list[i] == -i for i in range(0					,  9 ) ) is True

     linked_list.reverse()
     assert str(_lowercase ) == "->".join(str(_lowercase ) for i in range(-8					,  1 ) )






def 		_A		(		)					-> None:


     """simple docstring"""


     __UpperCamelCase =			[
         -9,
         1_00,
         Node(77_34_51_12 ),
         'dlrow olleH',
         7,
         55_55,
         0,
         -1_92.5_55_55,
         'Hello, world!',
         77.9,
         Node(10 ),
         None,
         None,
         12.20,
     ]
     __UpperCamelCase =			LinkedList()

     for i in test_input:
          linked_list.insert_tail(_lowercase )

     # Check if it's empty or not
     assert linked_list.is_empty() is False
     assert (
         str(_lowercase ) == "-9->100->Node(77345112)->dlrow olleH->7->5555->0->"
         "-192.55555->Hello, world!->77.9->Node(10)->None->None->12.2"
     )

     # Delete the head
     __UpperCamelCase =			linked_list.delete_head()
     assert result == -9
     assert (
         str(_lowercase ) == "100->Node(77345112)->dlrow olleH->7->5555->0->-192.55555->"
         "Hello, world!->77.9->Node(10)->None->None->12.2"
     )

     # Delete the tail
     __UpperCamelCase =			linked_list.delete_tail()
     assert result == 12.2
     assert (
         str(_lowercase ) == "100->Node(77345112)->dlrow olleH->7->5555->0->-192.55555->"
         "Hello, world!->77.9->Node(10)->None->None"
     )

     # Delete a node in specific location in linked list
     __UpperCamelCase =			linked_list.delete_nth(10 )
     assert result is None
     assert (
         str(_lowercase ) == "100->Node(77345112)->dlrow olleH->7->5555->0->-192.55555->"
         "Hello, world!->77.9->Node(10)->None"
     )

     # Add a Node instance to its head
     linked_list.insert_head(Node('Hello again, world!' ) )
     assert (
         str(_lowercase )
         == "Node(Hello again, world!)->100->Node(77345112)->dlrow olleH->"
         "7->5555->0->-192.55555->Hello, world!->77.9->Node(10)->None"
     )

     # Add None to its tail
     linked_list.insert_tail(_lowercase )
     assert (
         str(_lowercase )
         == "Node(Hello again, world!)->100->Node(77345112)->dlrow olleH->"
         "7->5555->0->-192.55555->Hello, world!->77.9->Node(10)->None->None"
     )

     # Reverse the linked list
     linked_list.reverse()
     assert (
         str(_lowercase )
         == "None->None->Node(10)->77.9->Hello, world!->-192.55555->0->5555->"
         "7->dlrow olleH->Node(77345112)->100->Node(Hello again, world!)"
     )






def 		_A		(		)					-> List[str]:


     """simple docstring"""


     from doctest import testmod

     testmod()

     __UpperCamelCase =			LinkedList()
     linked_list.insert_head(input('Inserting 1st at head ' ).strip() )
     linked_list.insert_head(input('Inserting 2nd at head ' ).strip() )
     print('\nPrint list:' )
     linked_list.print_list()
     linked_list.insert_tail(input('\nInserting 1st at tail ' ).strip() )
     linked_list.insert_tail(input('Inserting 2nd at tail ' ).strip() )
     print('\nPrint list:' )
     linked_list.print_list()
     print('\nDelete head' )
     linked_list.delete_head()
     print('Delete tail' )
     linked_list.delete_tail()
     print('\nPrint list:' )
     linked_list.print_list()
     print('\nReverse linked list' )
     linked_list.reverse()
     print('\nPrint list:' )
     linked_list.print_list()
     print('\nString representation of linked list:' )
     print(_lowercase )
     print('\nReading/changing Node data using indexing:' )
     print(f'''Element at Position 1: {linked_list[1]}''' )
     __UpperCamelCase =			input('Enter New Value: ' ).strip()
     print('New list:' )
     print(_lowercase )
     print(f'''length of linked_list is : {len(_lowercase )}''' )


if __name__ == "__main__":
    main()


