77035 lines
5.3 MiB
77035 lines
5.3 MiB
--- modulename: testing, funcname: <module>
|
|
testing.py(2): import os
|
|
testing.py(3): import io
|
|
--- modulename: io, funcname: <module>
|
|
io.py(34): """
|
|
io.py(37): __author__ = ("Guido van Rossum <guido@python.org>, "
|
|
io.py(44): __all__ = ["BlockingIOError", "open", "IOBase", "RawIOBase", "FileIO",
|
|
io.py(45): "BytesIO", "StringIO", "BufferedIOBase",
|
|
io.py(46): "BufferedReader", "BufferedWriter", "BufferedRWPair",
|
|
io.py(47): "BufferedRandom", "TextIOBase", "TextIOWrapper",
|
|
io.py(48): "UnsupportedOperation", "SEEK_SET", "SEEK_CUR", "SEEK_END"]
|
|
io.py(51): import _io
|
|
io.py(52): import abc
|
|
io.py(54): from _io import (DEFAULT_BUFFER_SIZE, BlockingIOError, UnsupportedOperation,
|
|
io.py(59): OpenWrapper = _io.open # for compatibility with _pyio
|
|
io.py(62): SEEK_SET = 0
|
|
io.py(63): SEEK_CUR = 1
|
|
io.py(64): SEEK_END = 2
|
|
io.py(69): class IOBase(_io._IOBase):
|
|
--- modulename: io, funcname: IOBase
|
|
io.py(69): class IOBase(_io._IOBase):
|
|
io.py(70): __metaclass__ = abc.ABCMeta
|
|
--- modulename: abc, funcname: __new__
|
|
abc.py(87): cls = super(ABCMeta, mcls).__new__(mcls, name, bases, namespace)
|
|
abc.py(89): abstracts = set(name
|
|
abc.py(90): for name, value in namespace.items()
|
|
--- modulename: abc, funcname: <genexpr>
|
|
abc.py(89): abstracts = set(name
|
|
abc.py(91): if getattr(value, "__isabstractmethod__", False))
|
|
abc.py(89): abstracts = set(name
|
|
abc.py(91): if getattr(value, "__isabstractmethod__", False))
|
|
abc.py(89): abstracts = set(name
|
|
abc.py(92): for base in bases:
|
|
abc.py(93): for name in getattr(base, "__abstractmethods__", set()):
|
|
abc.py(92): for base in bases:
|
|
abc.py(97): cls.__abstractmethods__ = frozenset(abstracts)
|
|
abc.py(99): cls._abc_registry = WeakSet()
|
|
--- modulename: _weakrefset, funcname: __init__
|
|
_weakrefset.py(37): self.data = set()
|
|
_weakrefset.py(38): def _remove(item, selfref=ref(self)):
|
|
_weakrefset.py(45): self._remove = _remove
|
|
_weakrefset.py(47): self._pending_removals = []
|
|
_weakrefset.py(48): self._iterating = set()
|
|
_weakrefset.py(49): if data is not None:
|
|
abc.py(100): cls._abc_cache = WeakSet()
|
|
--- modulename: _weakrefset, funcname: __init__
|
|
_weakrefset.py(37): self.data = set()
|
|
_weakrefset.py(38): def _remove(item, selfref=ref(self)):
|
|
_weakrefset.py(45): self._remove = _remove
|
|
_weakrefset.py(47): self._pending_removals = []
|
|
_weakrefset.py(48): self._iterating = set()
|
|
_weakrefset.py(49): if data is not None:
|
|
abc.py(101): cls._abc_negative_cache = WeakSet()
|
|
--- modulename: _weakrefset, funcname: __init__
|
|
_weakrefset.py(37): self.data = set()
|
|
_weakrefset.py(38): def _remove(item, selfref=ref(self)):
|
|
_weakrefset.py(45): self._remove = _remove
|
|
_weakrefset.py(47): self._pending_removals = []
|
|
_weakrefset.py(48): self._iterating = set()
|
|
_weakrefset.py(49): if data is not None:
|
|
abc.py(102): cls._abc_negative_cache_version = ABCMeta._abc_invalidation_counter
|
|
abc.py(103): return cls
|
|
io.py(72): class RawIOBase(_io._RawIOBase, IOBase):
|
|
--- modulename: io, funcname: RawIOBase
|
|
io.py(72): class RawIOBase(_io._RawIOBase, IOBase):
|
|
io.py(73): pass
|
|
--- modulename: abc, funcname: __new__
|
|
abc.py(87): cls = super(ABCMeta, mcls).__new__(mcls, name, bases, namespace)
|
|
abc.py(89): abstracts = set(name
|
|
abc.py(90): for name, value in namespace.items()
|
|
--- modulename: abc, funcname: <genexpr>
|
|
abc.py(89): abstracts = set(name
|
|
abc.py(91): if getattr(value, "__isabstractmethod__", False))
|
|
abc.py(89): abstracts = set(name
|
|
abc.py(92): for base in bases:
|
|
abc.py(93): for name in getattr(base, "__abstractmethods__", set()):
|
|
abc.py(92): for base in bases:
|
|
abc.py(93): for name in getattr(base, "__abstractmethods__", set()):
|
|
abc.py(92): for base in bases:
|
|
abc.py(97): cls.__abstractmethods__ = frozenset(abstracts)
|
|
abc.py(99): cls._abc_registry = WeakSet()
|
|
--- modulename: _weakrefset, funcname: __init__
|
|
_weakrefset.py(37): self.data = set()
|
|
_weakrefset.py(38): def _remove(item, selfref=ref(self)):
|
|
_weakrefset.py(45): self._remove = _remove
|
|
_weakrefset.py(47): self._pending_removals = []
|
|
_weakrefset.py(48): self._iterating = set()
|
|
_weakrefset.py(49): if data is not None:
|
|
abc.py(100): cls._abc_cache = WeakSet()
|
|
--- modulename: _weakrefset, funcname: __init__
|
|
_weakrefset.py(37): self.data = set()
|
|
_weakrefset.py(38): def _remove(item, selfref=ref(self)):
|
|
_weakrefset.py(45): self._remove = _remove
|
|
_weakrefset.py(47): self._pending_removals = []
|
|
_weakrefset.py(48): self._iterating = set()
|
|
_weakrefset.py(49): if data is not None:
|
|
abc.py(101): cls._abc_negative_cache = WeakSet()
|
|
--- modulename: _weakrefset, funcname: __init__
|
|
_weakrefset.py(37): self.data = set()
|
|
_weakrefset.py(38): def _remove(item, selfref=ref(self)):
|
|
_weakrefset.py(45): self._remove = _remove
|
|
_weakrefset.py(47): self._pending_removals = []
|
|
_weakrefset.py(48): self._iterating = set()
|
|
_weakrefset.py(49): if data is not None:
|
|
abc.py(102): cls._abc_negative_cache_version = ABCMeta._abc_invalidation_counter
|
|
abc.py(103): return cls
|
|
io.py(75): class BufferedIOBase(_io._BufferedIOBase, IOBase):
|
|
--- modulename: io, funcname: BufferedIOBase
|
|
io.py(75): class BufferedIOBase(_io._BufferedIOBase, IOBase):
|
|
io.py(76): pass
|
|
--- modulename: abc, funcname: __new__
|
|
abc.py(87): cls = super(ABCMeta, mcls).__new__(mcls, name, bases, namespace)
|
|
abc.py(89): abstracts = set(name
|
|
abc.py(90): for name, value in namespace.items()
|
|
--- modulename: abc, funcname: <genexpr>
|
|
abc.py(89): abstracts = set(name
|
|
abc.py(91): if getattr(value, "__isabstractmethod__", False))
|
|
abc.py(89): abstracts = set(name
|
|
abc.py(92): for base in bases:
|
|
abc.py(93): for name in getattr(base, "__abstractmethods__", set()):
|
|
abc.py(92): for base in bases:
|
|
abc.py(93): for name in getattr(base, "__abstractmethods__", set()):
|
|
abc.py(92): for base in bases:
|
|
abc.py(97): cls.__abstractmethods__ = frozenset(abstracts)
|
|
abc.py(99): cls._abc_registry = WeakSet()
|
|
--- modulename: _weakrefset, funcname: __init__
|
|
_weakrefset.py(37): self.data = set()
|
|
_weakrefset.py(38): def _remove(item, selfref=ref(self)):
|
|
_weakrefset.py(45): self._remove = _remove
|
|
_weakrefset.py(47): self._pending_removals = []
|
|
_weakrefset.py(48): self._iterating = set()
|
|
_weakrefset.py(49): if data is not None:
|
|
abc.py(100): cls._abc_cache = WeakSet()
|
|
--- modulename: _weakrefset, funcname: __init__
|
|
_weakrefset.py(37): self.data = set()
|
|
_weakrefset.py(38): def _remove(item, selfref=ref(self)):
|
|
_weakrefset.py(45): self._remove = _remove
|
|
_weakrefset.py(47): self._pending_removals = []
|
|
_weakrefset.py(48): self._iterating = set()
|
|
_weakrefset.py(49): if data is not None:
|
|
abc.py(101): cls._abc_negative_cache = WeakSet()
|
|
--- modulename: _weakrefset, funcname: __init__
|
|
_weakrefset.py(37): self.data = set()
|
|
_weakrefset.py(38): def _remove(item, selfref=ref(self)):
|
|
_weakrefset.py(45): self._remove = _remove
|
|
_weakrefset.py(47): self._pending_removals = []
|
|
_weakrefset.py(48): self._iterating = set()
|
|
_weakrefset.py(49): if data is not None:
|
|
abc.py(102): cls._abc_negative_cache_version = ABCMeta._abc_invalidation_counter
|
|
abc.py(103): return cls
|
|
io.py(78): class TextIOBase(_io._TextIOBase, IOBase):
|
|
--- modulename: io, funcname: TextIOBase
|
|
io.py(78): class TextIOBase(_io._TextIOBase, IOBase):
|
|
io.py(79): pass
|
|
--- modulename: abc, funcname: __new__
|
|
abc.py(87): cls = super(ABCMeta, mcls).__new__(mcls, name, bases, namespace)
|
|
abc.py(89): abstracts = set(name
|
|
abc.py(90): for name, value in namespace.items()
|
|
--- modulename: abc, funcname: <genexpr>
|
|
abc.py(89): abstracts = set(name
|
|
abc.py(91): if getattr(value, "__isabstractmethod__", False))
|
|
abc.py(89): abstracts = set(name
|
|
abc.py(92): for base in bases:
|
|
abc.py(93): for name in getattr(base, "__abstractmethods__", set()):
|
|
abc.py(92): for base in bases:
|
|
abc.py(93): for name in getattr(base, "__abstractmethods__", set()):
|
|
abc.py(92): for base in bases:
|
|
abc.py(97): cls.__abstractmethods__ = frozenset(abstracts)
|
|
abc.py(99): cls._abc_registry = WeakSet()
|
|
--- modulename: _weakrefset, funcname: __init__
|
|
_weakrefset.py(37): self.data = set()
|
|
_weakrefset.py(38): def _remove(item, selfref=ref(self)):
|
|
_weakrefset.py(45): self._remove = _remove
|
|
_weakrefset.py(47): self._pending_removals = []
|
|
_weakrefset.py(48): self._iterating = set()
|
|
_weakrefset.py(49): if data is not None:
|
|
abc.py(100): cls._abc_cache = WeakSet()
|
|
--- modulename: _weakrefset, funcname: __init__
|
|
_weakrefset.py(37): self.data = set()
|
|
_weakrefset.py(38): def _remove(item, selfref=ref(self)):
|
|
_weakrefset.py(45): self._remove = _remove
|
|
_weakrefset.py(47): self._pending_removals = []
|
|
_weakrefset.py(48): self._iterating = set()
|
|
_weakrefset.py(49): if data is not None:
|
|
abc.py(101): cls._abc_negative_cache = WeakSet()
|
|
--- modulename: _weakrefset, funcname: __init__
|
|
_weakrefset.py(37): self.data = set()
|
|
_weakrefset.py(38): def _remove(item, selfref=ref(self)):
|
|
_weakrefset.py(45): self._remove = _remove
|
|
_weakrefset.py(47): self._pending_removals = []
|
|
_weakrefset.py(48): self._iterating = set()
|
|
_weakrefset.py(49): if data is not None:
|
|
abc.py(102): cls._abc_negative_cache_version = ABCMeta._abc_invalidation_counter
|
|
abc.py(103): return cls
|
|
io.py(81): RawIOBase.register(FileIO)
|
|
--- modulename: abc, funcname: register
|
|
abc.py(107): if not isinstance(subclass, (type, types.ClassType)):
|
|
abc.py(109): if issubclass(subclass, cls):
|
|
--- modulename: abc, funcname: __subclasscheck__
|
|
abc.py(151): if subclass in cls._abc_cache:
|
|
--- modulename: _weakrefset, funcname: __contains__
|
|
_weakrefset.py(71): try:
|
|
_weakrefset.py(72): wr = ref(item)
|
|
_weakrefset.py(75): return wr in self.data
|
|
abc.py(154): if cls._abc_negative_cache_version < ABCMeta._abc_invalidation_counter:
|
|
abc.py(158): elif subclass in cls._abc_negative_cache:
|
|
--- modulename: _weakrefset, funcname: __contains__
|
|
_weakrefset.py(71): try:
|
|
_weakrefset.py(72): wr = ref(item)
|
|
_weakrefset.py(75): return wr in self.data
|
|
abc.py(161): ok = cls.__subclasshook__(subclass)
|
|
abc.py(162): if ok is not NotImplemented:
|
|
abc.py(170): if cls in getattr(subclass, '__mro__', ()):
|
|
abc.py(174): for rcls in cls._abc_registry:
|
|
--- modulename: _weakrefset, funcname: __iter__
|
|
_weakrefset.py(59): with _IterationGuard(self):
|
|
--- modulename: _weakrefset, funcname: __init__
|
|
_weakrefset.py(18): self.weakcontainer = ref(weakcontainer)
|
|
--- modulename: _weakrefset, funcname: __enter__
|
|
_weakrefset.py(21): w = self.weakcontainer()
|
|
_weakrefset.py(22): if w is not None:
|
|
_weakrefset.py(23): w._iterating.add(self)
|
|
_weakrefset.py(24): return self
|
|
_weakrefset.py(60): for itemref in self.data:
|
|
--- modulename: _weakrefset, funcname: __exit__
|
|
_weakrefset.py(27): w = self.weakcontainer()
|
|
_weakrefset.py(28): if w is not None:
|
|
_weakrefset.py(29): s = w._iterating
|
|
_weakrefset.py(30): s.remove(self)
|
|
_weakrefset.py(31): if not s:
|
|
_weakrefset.py(32): w._commit_removals()
|
|
--- modulename: _weakrefset, funcname: _commit_removals
|
|
_weakrefset.py(53): l = self._pending_removals
|
|
_weakrefset.py(54): discard = self.data.discard
|
|
_weakrefset.py(55): while l:
|
|
abc.py(179): for scls in cls.__subclasses__():
|
|
abc.py(184): cls._abc_negative_cache.add(subclass)
|
|
--- modulename: _weakrefset, funcname: add
|
|
_weakrefset.py(84): if self._pending_removals:
|
|
_weakrefset.py(86): self.data.add(ref(item, self._remove))
|
|
abc.py(185): return False
|
|
abc.py(113): if issubclass(cls, subclass):
|
|
abc.py(116): cls._abc_registry.add(subclass)
|
|
--- modulename: _weakrefset, funcname: add
|
|
_weakrefset.py(84): if self._pending_removals:
|
|
_weakrefset.py(86): self.data.add(ref(item, self._remove))
|
|
abc.py(117): ABCMeta._abc_invalidation_counter += 1 # Invalidate negative cache
|
|
io.py(83): for klass in (BytesIO, BufferedReader, BufferedWriter, BufferedRandom,
|
|
io.py(84): BufferedRWPair):
|
|
io.py(85): BufferedIOBase.register(klass)
|
|
--- modulename: abc, funcname: register
|
|
abc.py(107): if not isinstance(subclass, (type, types.ClassType)):
|
|
abc.py(109): if issubclass(subclass, cls):
|
|
--- modulename: abc, funcname: __subclasscheck__
|
|
abc.py(151): if subclass in cls._abc_cache:
|
|
--- modulename: _weakrefset, funcname: __contains__
|
|
_weakrefset.py(71): try:
|
|
_weakrefset.py(72): wr = ref(item)
|
|
_weakrefset.py(75): return wr in self.data
|
|
abc.py(154): if cls._abc_negative_cache_version < ABCMeta._abc_invalidation_counter:
|
|
abc.py(156): cls._abc_negative_cache = WeakSet()
|
|
--- modulename: _weakrefset, funcname: __init__
|
|
_weakrefset.py(37): self.data = set()
|
|
_weakrefset.py(38): def _remove(item, selfref=ref(self)):
|
|
_weakrefset.py(45): self._remove = _remove
|
|
_weakrefset.py(47): self._pending_removals = []
|
|
_weakrefset.py(48): self._iterating = set()
|
|
_weakrefset.py(49): if data is not None:
|
|
abc.py(157): cls._abc_negative_cache_version = ABCMeta._abc_invalidation_counter
|
|
abc.py(161): ok = cls.__subclasshook__(subclass)
|
|
abc.py(162): if ok is not NotImplemented:
|
|
abc.py(170): if cls in getattr(subclass, '__mro__', ()):
|
|
abc.py(174): for rcls in cls._abc_registry:
|
|
--- modulename: _weakrefset, funcname: __iter__
|
|
_weakrefset.py(59): with _IterationGuard(self):
|
|
--- modulename: _weakrefset, funcname: __init__
|
|
_weakrefset.py(18): self.weakcontainer = ref(weakcontainer)
|
|
--- modulename: _weakrefset, funcname: __enter__
|
|
_weakrefset.py(21): w = self.weakcontainer()
|
|
_weakrefset.py(22): if w is not None:
|
|
_weakrefset.py(23): w._iterating.add(self)
|
|
_weakrefset.py(24): return self
|
|
_weakrefset.py(60): for itemref in self.data:
|
|
--- modulename: _weakrefset, funcname: __exit__
|
|
_weakrefset.py(27): w = self.weakcontainer()
|
|
_weakrefset.py(28): if w is not None:
|
|
_weakrefset.py(29): s = w._iterating
|
|
_weakrefset.py(30): s.remove(self)
|
|
_weakrefset.py(31): if not s:
|
|
_weakrefset.py(32): w._commit_removals()
|
|
--- modulename: _weakrefset, funcname: _commit_removals
|
|
_weakrefset.py(53): l = self._pending_removals
|
|
_weakrefset.py(54): discard = self.data.discard
|
|
_weakrefset.py(55): while l:
|
|
abc.py(179): for scls in cls.__subclasses__():
|
|
abc.py(184): cls._abc_negative_cache.add(subclass)
|
|
--- modulename: _weakrefset, funcname: add
|
|
_weakrefset.py(84): if self._pending_removals:
|
|
_weakrefset.py(86): self.data.add(ref(item, self._remove))
|
|
abc.py(185): return False
|
|
abc.py(113): if issubclass(cls, subclass):
|
|
abc.py(116): cls._abc_registry.add(subclass)
|
|
--- modulename: _weakrefset, funcname: add
|
|
_weakrefset.py(84): if self._pending_removals:
|
|
_weakrefset.py(86): self.data.add(ref(item, self._remove))
|
|
abc.py(117): ABCMeta._abc_invalidation_counter += 1 # Invalidate negative cache
|
|
io.py(84): BufferedRWPair):
|
|
io.py(85): BufferedIOBase.register(klass)
|
|
--- modulename: abc, funcname: register
|
|
abc.py(107): if not isinstance(subclass, (type, types.ClassType)):
|
|
abc.py(109): if issubclass(subclass, cls):
|
|
--- modulename: abc, funcname: __subclasscheck__
|
|
abc.py(151): if subclass in cls._abc_cache:
|
|
--- modulename: _weakrefset, funcname: __contains__
|
|
_weakrefset.py(71): try:
|
|
_weakrefset.py(72): wr = ref(item)
|
|
_weakrefset.py(75): return wr in self.data
|
|
abc.py(154): if cls._abc_negative_cache_version < ABCMeta._abc_invalidation_counter:
|
|
abc.py(156): cls._abc_negative_cache = WeakSet()
|
|
--- modulename: _weakrefset, funcname: __init__
|
|
_weakrefset.py(37): self.data = set()
|
|
_weakrefset.py(38): def _remove(item, selfref=ref(self)):
|
|
_weakrefset.py(45): self._remove = _remove
|
|
_weakrefset.py(47): self._pending_removals = []
|
|
_weakrefset.py(48): self._iterating = set()
|
|
_weakrefset.py(49): if data is not None:
|
|
abc.py(157): cls._abc_negative_cache_version = ABCMeta._abc_invalidation_counter
|
|
abc.py(161): ok = cls.__subclasshook__(subclass)
|
|
abc.py(162): if ok is not NotImplemented:
|
|
abc.py(170): if cls in getattr(subclass, '__mro__', ()):
|
|
abc.py(174): for rcls in cls._abc_registry:
|
|
--- modulename: _weakrefset, funcname: __iter__
|
|
_weakrefset.py(59): with _IterationGuard(self):
|
|
--- modulename: _weakrefset, funcname: __init__
|
|
_weakrefset.py(18): self.weakcontainer = ref(weakcontainer)
|
|
--- modulename: _weakrefset, funcname: __enter__
|
|
_weakrefset.py(21): w = self.weakcontainer()
|
|
_weakrefset.py(22): if w is not None:
|
|
_weakrefset.py(23): w._iterating.add(self)
|
|
_weakrefset.py(24): return self
|
|
_weakrefset.py(60): for itemref in self.data:
|
|
_weakrefset.py(61): item = itemref()
|
|
_weakrefset.py(62): if item is not None:
|
|
_weakrefset.py(65): yield item
|
|
abc.py(175): if issubclass(subclass, rcls):
|
|
abc.py(174): for rcls in cls._abc_registry:
|
|
--- modulename: _weakrefset, funcname: __iter__
|
|
_weakrefset.py(60): for itemref in self.data:
|
|
--- modulename: _weakrefset, funcname: __exit__
|
|
_weakrefset.py(27): w = self.weakcontainer()
|
|
_weakrefset.py(28): if w is not None:
|
|
_weakrefset.py(29): s = w._iterating
|
|
_weakrefset.py(30): s.remove(self)
|
|
_weakrefset.py(31): if not s:
|
|
_weakrefset.py(32): w._commit_removals()
|
|
--- modulename: _weakrefset, funcname: _commit_removals
|
|
_weakrefset.py(53): l = self._pending_removals
|
|
_weakrefset.py(54): discard = self.data.discard
|
|
_weakrefset.py(55): while l:
|
|
abc.py(179): for scls in cls.__subclasses__():
|
|
abc.py(184): cls._abc_negative_cache.add(subclass)
|
|
--- modulename: _weakrefset, funcname: add
|
|
_weakrefset.py(84): if self._pending_removals:
|
|
_weakrefset.py(86): self.data.add(ref(item, self._remove))
|
|
abc.py(185): return False
|
|
abc.py(113): if issubclass(cls, subclass):
|
|
abc.py(116): cls._abc_registry.add(subclass)
|
|
--- modulename: _weakrefset, funcname: add
|
|
_weakrefset.py(84): if self._pending_removals:
|
|
_weakrefset.py(86): self.data.add(ref(item, self._remove))
|
|
abc.py(117): ABCMeta._abc_invalidation_counter += 1 # Invalidate negative cache
|
|
io.py(84): BufferedRWPair):
|
|
io.py(85): BufferedIOBase.register(klass)
|
|
--- modulename: abc, funcname: register
|
|
abc.py(107): if not isinstance(subclass, (type, types.ClassType)):
|
|
abc.py(109): if issubclass(subclass, cls):
|
|
--- modulename: abc, funcname: __subclasscheck__
|
|
abc.py(151): if subclass in cls._abc_cache:
|
|
--- modulename: _weakrefset, funcname: __contains__
|
|
_weakrefset.py(71): try:
|
|
_weakrefset.py(72): wr = ref(item)
|
|
_weakrefset.py(75): return wr in self.data
|
|
abc.py(154): if cls._abc_negative_cache_version < ABCMeta._abc_invalidation_counter:
|
|
abc.py(156): cls._abc_negative_cache = WeakSet()
|
|
--- modulename: _weakrefset, funcname: __init__
|
|
_weakrefset.py(37): self.data = set()
|
|
_weakrefset.py(38): def _remove(item, selfref=ref(self)):
|
|
_weakrefset.py(45): self._remove = _remove
|
|
_weakrefset.py(47): self._pending_removals = []
|
|
_weakrefset.py(48): self._iterating = set()
|
|
_weakrefset.py(49): if data is not None:
|
|
abc.py(157): cls._abc_negative_cache_version = ABCMeta._abc_invalidation_counter
|
|
abc.py(161): ok = cls.__subclasshook__(subclass)
|
|
abc.py(162): if ok is not NotImplemented:
|
|
abc.py(170): if cls in getattr(subclass, '__mro__', ()):
|
|
abc.py(174): for rcls in cls._abc_registry:
|
|
--- modulename: _weakrefset, funcname: __iter__
|
|
_weakrefset.py(59): with _IterationGuard(self):
|
|
--- modulename: _weakrefset, funcname: __init__
|
|
_weakrefset.py(18): self.weakcontainer = ref(weakcontainer)
|
|
--- modulename: _weakrefset, funcname: __enter__
|
|
_weakrefset.py(21): w = self.weakcontainer()
|
|
_weakrefset.py(22): if w is not None:
|
|
_weakrefset.py(23): w._iterating.add(self)
|
|
_weakrefset.py(24): return self
|
|
_weakrefset.py(60): for itemref in self.data:
|
|
_weakrefset.py(61): item = itemref()
|
|
_weakrefset.py(62): if item is not None:
|
|
_weakrefset.py(65): yield item
|
|
abc.py(175): if issubclass(subclass, rcls):
|
|
abc.py(174): for rcls in cls._abc_registry:
|
|
--- modulename: _weakrefset, funcname: __iter__
|
|
_weakrefset.py(60): for itemref in self.data:
|
|
_weakrefset.py(61): item = itemref()
|
|
_weakrefset.py(62): if item is not None:
|
|
_weakrefset.py(65): yield item
|
|
abc.py(175): if issubclass(subclass, rcls):
|
|
abc.py(174): for rcls in cls._abc_registry:
|
|
--- modulename: _weakrefset, funcname: __iter__
|
|
_weakrefset.py(60): for itemref in self.data:
|
|
--- modulename: _weakrefset, funcname: __exit__
|
|
_weakrefset.py(27): w = self.weakcontainer()
|
|
_weakrefset.py(28): if w is not None:
|
|
_weakrefset.py(29): s = w._iterating
|
|
_weakrefset.py(30): s.remove(self)
|
|
_weakrefset.py(31): if not s:
|
|
_weakrefset.py(32): w._commit_removals()
|
|
--- modulename: _weakrefset, funcname: _commit_removals
|
|
_weakrefset.py(53): l = self._pending_removals
|
|
_weakrefset.py(54): discard = self.data.discard
|
|
_weakrefset.py(55): while l:
|
|
abc.py(179): for scls in cls.__subclasses__():
|
|
abc.py(184): cls._abc_negative_cache.add(subclass)
|
|
--- modulename: _weakrefset, funcname: add
|
|
_weakrefset.py(84): if self._pending_removals:
|
|
_weakrefset.py(86): self.data.add(ref(item, self._remove))
|
|
abc.py(185): return False
|
|
abc.py(113): if issubclass(cls, subclass):
|
|
abc.py(116): cls._abc_registry.add(subclass)
|
|
--- modulename: _weakrefset, funcname: add
|
|
_weakrefset.py(84): if self._pending_removals:
|
|
_weakrefset.py(86): self.data.add(ref(item, self._remove))
|
|
abc.py(117): ABCMeta._abc_invalidation_counter += 1 # Invalidate negative cache
|
|
io.py(84): BufferedRWPair):
|
|
io.py(85): BufferedIOBase.register(klass)
|
|
--- modulename: abc, funcname: register
|
|
abc.py(107): if not isinstance(subclass, (type, types.ClassType)):
|
|
abc.py(109): if issubclass(subclass, cls):
|
|
--- modulename: abc, funcname: __subclasscheck__
|
|
abc.py(151): if subclass in cls._abc_cache:
|
|
--- modulename: _weakrefset, funcname: __contains__
|
|
_weakrefset.py(71): try:
|
|
_weakrefset.py(72): wr = ref(item)
|
|
_weakrefset.py(75): return wr in self.data
|
|
abc.py(154): if cls._abc_negative_cache_version < ABCMeta._abc_invalidation_counter:
|
|
abc.py(156): cls._abc_negative_cache = WeakSet()
|
|
--- modulename: _weakrefset, funcname: __init__
|
|
_weakrefset.py(37): self.data = set()
|
|
_weakrefset.py(38): def _remove(item, selfref=ref(self)):
|
|
_weakrefset.py(45): self._remove = _remove
|
|
_weakrefset.py(47): self._pending_removals = []
|
|
_weakrefset.py(48): self._iterating = set()
|
|
_weakrefset.py(49): if data is not None:
|
|
abc.py(157): cls._abc_negative_cache_version = ABCMeta._abc_invalidation_counter
|
|
abc.py(161): ok = cls.__subclasshook__(subclass)
|
|
abc.py(162): if ok is not NotImplemented:
|
|
abc.py(170): if cls in getattr(subclass, '__mro__', ()):
|
|
abc.py(174): for rcls in cls._abc_registry:
|
|
--- modulename: _weakrefset, funcname: __iter__
|
|
_weakrefset.py(59): with _IterationGuard(self):
|
|
--- modulename: _weakrefset, funcname: __init__
|
|
_weakrefset.py(18): self.weakcontainer = ref(weakcontainer)
|
|
--- modulename: _weakrefset, funcname: __enter__
|
|
_weakrefset.py(21): w = self.weakcontainer()
|
|
_weakrefset.py(22): if w is not None:
|
|
_weakrefset.py(23): w._iterating.add(self)
|
|
_weakrefset.py(24): return self
|
|
_weakrefset.py(60): for itemref in self.data:
|
|
_weakrefset.py(61): item = itemref()
|
|
_weakrefset.py(62): if item is not None:
|
|
_weakrefset.py(65): yield item
|
|
abc.py(175): if issubclass(subclass, rcls):
|
|
abc.py(174): for rcls in cls._abc_registry:
|
|
--- modulename: _weakrefset, funcname: __iter__
|
|
_weakrefset.py(60): for itemref in self.data:
|
|
_weakrefset.py(61): item = itemref()
|
|
_weakrefset.py(62): if item is not None:
|
|
_weakrefset.py(65): yield item
|
|
abc.py(175): if issubclass(subclass, rcls):
|
|
abc.py(174): for rcls in cls._abc_registry:
|
|
--- modulename: _weakrefset, funcname: __iter__
|
|
_weakrefset.py(60): for itemref in self.data:
|
|
_weakrefset.py(61): item = itemref()
|
|
_weakrefset.py(62): if item is not None:
|
|
_weakrefset.py(65): yield item
|
|
abc.py(175): if issubclass(subclass, rcls):
|
|
abc.py(174): for rcls in cls._abc_registry:
|
|
--- modulename: _weakrefset, funcname: __iter__
|
|
_weakrefset.py(60): for itemref in self.data:
|
|
--- modulename: _weakrefset, funcname: __exit__
|
|
_weakrefset.py(27): w = self.weakcontainer()
|
|
_weakrefset.py(28): if w is not None:
|
|
_weakrefset.py(29): s = w._iterating
|
|
_weakrefset.py(30): s.remove(self)
|
|
_weakrefset.py(31): if not s:
|
|
_weakrefset.py(32): w._commit_removals()
|
|
--- modulename: _weakrefset, funcname: _commit_removals
|
|
_weakrefset.py(53): l = self._pending_removals
|
|
_weakrefset.py(54): discard = self.data.discard
|
|
_weakrefset.py(55): while l:
|
|
abc.py(179): for scls in cls.__subclasses__():
|
|
abc.py(184): cls._abc_negative_cache.add(subclass)
|
|
--- modulename: _weakrefset, funcname: add
|
|
_weakrefset.py(84): if self._pending_removals:
|
|
_weakrefset.py(86): self.data.add(ref(item, self._remove))
|
|
abc.py(185): return False
|
|
abc.py(113): if issubclass(cls, subclass):
|
|
abc.py(116): cls._abc_registry.add(subclass)
|
|
--- modulename: _weakrefset, funcname: add
|
|
_weakrefset.py(84): if self._pending_removals:
|
|
_weakrefset.py(86): self.data.add(ref(item, self._remove))
|
|
abc.py(117): ABCMeta._abc_invalidation_counter += 1 # Invalidate negative cache
|
|
io.py(84): BufferedRWPair):
|
|
io.py(85): BufferedIOBase.register(klass)
|
|
--- modulename: abc, funcname: register
|
|
abc.py(107): if not isinstance(subclass, (type, types.ClassType)):
|
|
abc.py(109): if issubclass(subclass, cls):
|
|
--- modulename: abc, funcname: __subclasscheck__
|
|
abc.py(151): if subclass in cls._abc_cache:
|
|
--- modulename: _weakrefset, funcname: __contains__
|
|
_weakrefset.py(71): try:
|
|
_weakrefset.py(72): wr = ref(item)
|
|
_weakrefset.py(75): return wr in self.data
|
|
abc.py(154): if cls._abc_negative_cache_version < ABCMeta._abc_invalidation_counter:
|
|
abc.py(156): cls._abc_negative_cache = WeakSet()
|
|
--- modulename: _weakrefset, funcname: __init__
|
|
_weakrefset.py(37): self.data = set()
|
|
_weakrefset.py(38): def _remove(item, selfref=ref(self)):
|
|
_weakrefset.py(45): self._remove = _remove
|
|
_weakrefset.py(47): self._pending_removals = []
|
|
_weakrefset.py(48): self._iterating = set()
|
|
_weakrefset.py(49): if data is not None:
|
|
abc.py(157): cls._abc_negative_cache_version = ABCMeta._abc_invalidation_counter
|
|
abc.py(161): ok = cls.__subclasshook__(subclass)
|
|
abc.py(162): if ok is not NotImplemented:
|
|
abc.py(170): if cls in getattr(subclass, '__mro__', ()):
|
|
abc.py(174): for rcls in cls._abc_registry:
|
|
--- modulename: _weakrefset, funcname: __iter__
|
|
_weakrefset.py(59): with _IterationGuard(self):
|
|
--- modulename: _weakrefset, funcname: __init__
|
|
_weakrefset.py(18): self.weakcontainer = ref(weakcontainer)
|
|
--- modulename: _weakrefset, funcname: __enter__
|
|
_weakrefset.py(21): w = self.weakcontainer()
|
|
_weakrefset.py(22): if w is not None:
|
|
_weakrefset.py(23): w._iterating.add(self)
|
|
_weakrefset.py(24): return self
|
|
_weakrefset.py(60): for itemref in self.data:
|
|
_weakrefset.py(61): item = itemref()
|
|
_weakrefset.py(62): if item is not None:
|
|
_weakrefset.py(65): yield item
|
|
abc.py(175): if issubclass(subclass, rcls):
|
|
abc.py(174): for rcls in cls._abc_registry:
|
|
--- modulename: _weakrefset, funcname: __iter__
|
|
_weakrefset.py(60): for itemref in self.data:
|
|
_weakrefset.py(61): item = itemref()
|
|
_weakrefset.py(62): if item is not None:
|
|
_weakrefset.py(65): yield item
|
|
abc.py(175): if issubclass(subclass, rcls):
|
|
abc.py(174): for rcls in cls._abc_registry:
|
|
--- modulename: _weakrefset, funcname: __iter__
|
|
_weakrefset.py(60): for itemref in self.data:
|
|
_weakrefset.py(61): item = itemref()
|
|
_weakrefset.py(62): if item is not None:
|
|
_weakrefset.py(65): yield item
|
|
abc.py(175): if issubclass(subclass, rcls):
|
|
abc.py(174): for rcls in cls._abc_registry:
|
|
--- modulename: _weakrefset, funcname: __iter__
|
|
_weakrefset.py(60): for itemref in self.data:
|
|
_weakrefset.py(61): item = itemref()
|
|
_weakrefset.py(62): if item is not None:
|
|
_weakrefset.py(65): yield item
|
|
abc.py(175): if issubclass(subclass, rcls):
|
|
abc.py(174): for rcls in cls._abc_registry:
|
|
--- modulename: _weakrefset, funcname: __iter__
|
|
_weakrefset.py(60): for itemref in self.data:
|
|
--- modulename: _weakrefset, funcname: __exit__
|
|
_weakrefset.py(27): w = self.weakcontainer()
|
|
_weakrefset.py(28): if w is not None:
|
|
_weakrefset.py(29): s = w._iterating
|
|
_weakrefset.py(30): s.remove(self)
|
|
_weakrefset.py(31): if not s:
|
|
_weakrefset.py(32): w._commit_removals()
|
|
--- modulename: _weakrefset, funcname: _commit_removals
|
|
_weakrefset.py(53): l = self._pending_removals
|
|
_weakrefset.py(54): discard = self.data.discard
|
|
_weakrefset.py(55): while l:
|
|
abc.py(179): for scls in cls.__subclasses__():
|
|
abc.py(184): cls._abc_negative_cache.add(subclass)
|
|
--- modulename: _weakrefset, funcname: add
|
|
_weakrefset.py(84): if self._pending_removals:
|
|
_weakrefset.py(86): self.data.add(ref(item, self._remove))
|
|
abc.py(185): return False
|
|
abc.py(113): if issubclass(cls, subclass):
|
|
abc.py(116): cls._abc_registry.add(subclass)
|
|
--- modulename: _weakrefset, funcname: add
|
|
_weakrefset.py(84): if self._pending_removals:
|
|
_weakrefset.py(86): self.data.add(ref(item, self._remove))
|
|
abc.py(117): ABCMeta._abc_invalidation_counter += 1 # Invalidate negative cache
|
|
io.py(84): BufferedRWPair):
|
|
io.py(87): for klass in (StringIO, TextIOWrapper):
|
|
io.py(88): TextIOBase.register(klass)
|
|
--- modulename: abc, funcname: register
|
|
abc.py(107): if not isinstance(subclass, (type, types.ClassType)):
|
|
abc.py(109): if issubclass(subclass, cls):
|
|
--- modulename: abc, funcname: __subclasscheck__
|
|
abc.py(151): if subclass in cls._abc_cache:
|
|
--- modulename: _weakrefset, funcname: __contains__
|
|
_weakrefset.py(71): try:
|
|
_weakrefset.py(72): wr = ref(item)
|
|
_weakrefset.py(75): return wr in self.data
|
|
abc.py(154): if cls._abc_negative_cache_version < ABCMeta._abc_invalidation_counter:
|
|
abc.py(156): cls._abc_negative_cache = WeakSet()
|
|
--- modulename: _weakrefset, funcname: __init__
|
|
_weakrefset.py(37): self.data = set()
|
|
_weakrefset.py(38): def _remove(item, selfref=ref(self)):
|
|
_weakrefset.py(45): self._remove = _remove
|
|
_weakrefset.py(47): self._pending_removals = []
|
|
_weakrefset.py(48): self._iterating = set()
|
|
_weakrefset.py(49): if data is not None:
|
|
abc.py(157): cls._abc_negative_cache_version = ABCMeta._abc_invalidation_counter
|
|
abc.py(161): ok = cls.__subclasshook__(subclass)
|
|
abc.py(162): if ok is not NotImplemented:
|
|
abc.py(170): if cls in getattr(subclass, '__mro__', ()):
|
|
abc.py(174): for rcls in cls._abc_registry:
|
|
--- modulename: _weakrefset, funcname: __iter__
|
|
_weakrefset.py(59): with _IterationGuard(self):
|
|
--- modulename: _weakrefset, funcname: __init__
|
|
_weakrefset.py(18): self.weakcontainer = ref(weakcontainer)
|
|
--- modulename: _weakrefset, funcname: __enter__
|
|
_weakrefset.py(21): w = self.weakcontainer()
|
|
_weakrefset.py(22): if w is not None:
|
|
_weakrefset.py(23): w._iterating.add(self)
|
|
_weakrefset.py(24): return self
|
|
_weakrefset.py(60): for itemref in self.data:
|
|
--- modulename: _weakrefset, funcname: __exit__
|
|
_weakrefset.py(27): w = self.weakcontainer()
|
|
_weakrefset.py(28): if w is not None:
|
|
_weakrefset.py(29): s = w._iterating
|
|
_weakrefset.py(30): s.remove(self)
|
|
_weakrefset.py(31): if not s:
|
|
_weakrefset.py(32): w._commit_removals()
|
|
--- modulename: _weakrefset, funcname: _commit_removals
|
|
_weakrefset.py(53): l = self._pending_removals
|
|
_weakrefset.py(54): discard = self.data.discard
|
|
_weakrefset.py(55): while l:
|
|
abc.py(179): for scls in cls.__subclasses__():
|
|
abc.py(184): cls._abc_negative_cache.add(subclass)
|
|
--- modulename: _weakrefset, funcname: add
|
|
_weakrefset.py(84): if self._pending_removals:
|
|
_weakrefset.py(86): self.data.add(ref(item, self._remove))
|
|
abc.py(185): return False
|
|
abc.py(113): if issubclass(cls, subclass):
|
|
abc.py(116): cls._abc_registry.add(subclass)
|
|
--- modulename: _weakrefset, funcname: add
|
|
_weakrefset.py(84): if self._pending_removals:
|
|
_weakrefset.py(86): self.data.add(ref(item, self._remove))
|
|
abc.py(117): ABCMeta._abc_invalidation_counter += 1 # Invalidate negative cache
|
|
io.py(87): for klass in (StringIO, TextIOWrapper):
|
|
io.py(88): TextIOBase.register(klass)
|
|
--- modulename: abc, funcname: register
|
|
abc.py(107): if not isinstance(subclass, (type, types.ClassType)):
|
|
abc.py(109): if issubclass(subclass, cls):
|
|
--- modulename: abc, funcname: __subclasscheck__
|
|
abc.py(151): if subclass in cls._abc_cache:
|
|
--- modulename: _weakrefset, funcname: __contains__
|
|
_weakrefset.py(71): try:
|
|
_weakrefset.py(72): wr = ref(item)
|
|
_weakrefset.py(75): return wr in self.data
|
|
abc.py(154): if cls._abc_negative_cache_version < ABCMeta._abc_invalidation_counter:
|
|
abc.py(156): cls._abc_negative_cache = WeakSet()
|
|
--- modulename: _weakrefset, funcname: __init__
|
|
_weakrefset.py(37): self.data = set()
|
|
_weakrefset.py(38): def _remove(item, selfref=ref(self)):
|
|
_weakrefset.py(45): self._remove = _remove
|
|
_weakrefset.py(47): self._pending_removals = []
|
|
_weakrefset.py(48): self._iterating = set()
|
|
_weakrefset.py(49): if data is not None:
|
|
abc.py(157): cls._abc_negative_cache_version = ABCMeta._abc_invalidation_counter
|
|
abc.py(161): ok = cls.__subclasshook__(subclass)
|
|
abc.py(162): if ok is not NotImplemented:
|
|
abc.py(170): if cls in getattr(subclass, '__mro__', ()):
|
|
abc.py(174): for rcls in cls._abc_registry:
|
|
--- modulename: _weakrefset, funcname: __iter__
|
|
_weakrefset.py(59): with _IterationGuard(self):
|
|
--- modulename: _weakrefset, funcname: __init__
|
|
_weakrefset.py(18): self.weakcontainer = ref(weakcontainer)
|
|
--- modulename: _weakrefset, funcname: __enter__
|
|
_weakrefset.py(21): w = self.weakcontainer()
|
|
_weakrefset.py(22): if w is not None:
|
|
_weakrefset.py(23): w._iterating.add(self)
|
|
_weakrefset.py(24): return self
|
|
_weakrefset.py(60): for itemref in self.data:
|
|
_weakrefset.py(61): item = itemref()
|
|
_weakrefset.py(62): if item is not None:
|
|
_weakrefset.py(65): yield item
|
|
abc.py(175): if issubclass(subclass, rcls):
|
|
abc.py(174): for rcls in cls._abc_registry:
|
|
--- modulename: _weakrefset, funcname: __iter__
|
|
_weakrefset.py(60): for itemref in self.data:
|
|
--- modulename: _weakrefset, funcname: __exit__
|
|
_weakrefset.py(27): w = self.weakcontainer()
|
|
_weakrefset.py(28): if w is not None:
|
|
_weakrefset.py(29): s = w._iterating
|
|
_weakrefset.py(30): s.remove(self)
|
|
_weakrefset.py(31): if not s:
|
|
_weakrefset.py(32): w._commit_removals()
|
|
--- modulename: _weakrefset, funcname: _commit_removals
|
|
_weakrefset.py(53): l = self._pending_removals
|
|
_weakrefset.py(54): discard = self.data.discard
|
|
_weakrefset.py(55): while l:
|
|
abc.py(179): for scls in cls.__subclasses__():
|
|
abc.py(184): cls._abc_negative_cache.add(subclass)
|
|
--- modulename: _weakrefset, funcname: add
|
|
_weakrefset.py(84): if self._pending_removals:
|
|
_weakrefset.py(86): self.data.add(ref(item, self._remove))
|
|
abc.py(185): return False
|
|
abc.py(113): if issubclass(cls, subclass):
|
|
abc.py(116): cls._abc_registry.add(subclass)
|
|
--- modulename: _weakrefset, funcname: add
|
|
_weakrefset.py(84): if self._pending_removals:
|
|
_weakrefset.py(86): self.data.add(ref(item, self._remove))
|
|
abc.py(117): ABCMeta._abc_invalidation_counter += 1 # Invalidate negative cache
|
|
io.py(87): for klass in (StringIO, TextIOWrapper):
|
|
io.py(89): del klass
|
|
testing.py(4): import struct
|
|
--- modulename: struct, funcname: <module>
|
|
struct.py(1): from _struct import *
|
|
struct.py(2): from _struct import _clearcache
|
|
struct.py(3): from _struct import __doc__
|
|
testing.py(6): try: # this only works in py2.7
|
|
testing.py(7): import configparser
|
|
testing.py(8): except ImportError:
|
|
testing.py(9): import ConfigParser as configparser
|
|
--- modulename: ConfigParser, funcname: <module>
|
|
ConfigParser.py(88): """
|
|
ConfigParser.py(90): try:
|
|
ConfigParser.py(91): from collections import OrderedDict as _default_dict
|
|
ConfigParser.py(96): import re
|
|
ConfigParser.py(98): __all__ = ["NoSectionError", "DuplicateSectionError", "NoOptionError",
|
|
ConfigParser.py(99): "InterpolationError", "InterpolationDepthError",
|
|
ConfigParser.py(100): "InterpolationSyntaxError", "ParsingError",
|
|
ConfigParser.py(101): "MissingSectionHeaderError",
|
|
ConfigParser.py(102): "ConfigParser", "SafeConfigParser", "RawConfigParser",
|
|
ConfigParser.py(103): "DEFAULTSECT", "MAX_INTERPOLATION_DEPTH"]
|
|
ConfigParser.py(105): DEFAULTSECT = "DEFAULT"
|
|
ConfigParser.py(107): MAX_INTERPOLATION_DEPTH = 10
|
|
ConfigParser.py(112): class Error(Exception):
|
|
--- modulename: ConfigParser, funcname: Error
|
|
ConfigParser.py(112): class Error(Exception):
|
|
ConfigParser.py(113): """Base class for ConfigParser exceptions."""
|
|
ConfigParser.py(115): def _get_message(self):
|
|
ConfigParser.py(120): def _set_message(self, value):
|
|
ConfigParser.py(128): message = property(_get_message, _set_message)
|
|
ConfigParser.py(130): def __init__(self, msg=''):
|
|
ConfigParser.py(134): def __repr__(self):
|
|
ConfigParser.py(137): __str__ = __repr__
|
|
ConfigParser.py(139): class NoSectionError(Error):
|
|
--- modulename: ConfigParser, funcname: NoSectionError
|
|
ConfigParser.py(139): class NoSectionError(Error):
|
|
ConfigParser.py(140): """Raised when no section matches a requested option."""
|
|
ConfigParser.py(142): def __init__(self, section):
|
|
ConfigParser.py(147): class DuplicateSectionError(Error):
|
|
--- modulename: ConfigParser, funcname: DuplicateSectionError
|
|
ConfigParser.py(147): class DuplicateSectionError(Error):
|
|
ConfigParser.py(148): """Raised when a section is multiply-created."""
|
|
ConfigParser.py(150): def __init__(self, section):
|
|
ConfigParser.py(155): class NoOptionError(Error):
|
|
--- modulename: ConfigParser, funcname: NoOptionError
|
|
ConfigParser.py(155): class NoOptionError(Error):
|
|
ConfigParser.py(156): """A requested option was not found."""
|
|
ConfigParser.py(158): def __init__(self, option, section):
|
|
ConfigParser.py(165): class InterpolationError(Error):
|
|
--- modulename: ConfigParser, funcname: InterpolationError
|
|
ConfigParser.py(165): class InterpolationError(Error):
|
|
ConfigParser.py(166): """Base class for interpolation-related exceptions."""
|
|
ConfigParser.py(168): def __init__(self, option, section, msg):
|
|
ConfigParser.py(174): class InterpolationMissingOptionError(InterpolationError):
|
|
--- modulename: ConfigParser, funcname: InterpolationMissingOptionError
|
|
ConfigParser.py(174): class InterpolationMissingOptionError(InterpolationError):
|
|
ConfigParser.py(175): """A string substitution required a setting which was not available."""
|
|
ConfigParser.py(177): def __init__(self, option, section, rawval, reference):
|
|
ConfigParser.py(188): class InterpolationSyntaxError(InterpolationError):
|
|
--- modulename: ConfigParser, funcname: InterpolationSyntaxError
|
|
ConfigParser.py(188): class InterpolationSyntaxError(InterpolationError):
|
|
ConfigParser.py(190): does not conform to the required syntax."""
|
|
ConfigParser.py(192): class InterpolationDepthError(InterpolationError):
|
|
--- modulename: ConfigParser, funcname: InterpolationDepthError
|
|
ConfigParser.py(192): class InterpolationDepthError(InterpolationError):
|
|
ConfigParser.py(193): """Raised when substitutions are nested too deeply."""
|
|
ConfigParser.py(195): def __init__(self, option, section, rawval):
|
|
ConfigParser.py(204): class ParsingError(Error):
|
|
--- modulename: ConfigParser, funcname: ParsingError
|
|
ConfigParser.py(204): class ParsingError(Error):
|
|
ConfigParser.py(205): """Raised when a configuration file does not follow legal syntax."""
|
|
ConfigParser.py(207): def __init__(self, filename):
|
|
ConfigParser.py(213): def append(self, lineno, line):
|
|
ConfigParser.py(217): class MissingSectionHeaderError(ParsingError):
|
|
--- modulename: ConfigParser, funcname: MissingSectionHeaderError
|
|
ConfigParser.py(217): class MissingSectionHeaderError(ParsingError):
|
|
ConfigParser.py(218): """Raised when a key-value pair is found before any section header."""
|
|
ConfigParser.py(220): def __init__(self, filename, lineno, line):
|
|
ConfigParser.py(231): class RawConfigParser:
|
|
--- modulename: ConfigParser, funcname: RawConfigParser
|
|
ConfigParser.py(231): class RawConfigParser:
|
|
ConfigParser.py(232): def __init__(self, defaults=None, dict_type=_default_dict,
|
|
ConfigParser.py(233): allow_no_value=False):
|
|
ConfigParser.py(245): def defaults(self):
|
|
ConfigParser.py(248): def sections(self):
|
|
ConfigParser.py(253): def add_section(self, section):
|
|
ConfigParser.py(267): def has_section(self, section):
|
|
ConfigParser.py(274): def options(self, section):
|
|
ConfigParser.py(285): def read(self, filenames):
|
|
ConfigParser.py(310): def readfp(self, fp, filename=None):
|
|
ConfigParser.py(326): def get(self, section, option):
|
|
ConfigParser.py(342): def items(self, section):
|
|
ConfigParser.py(355): def _get(self, section, conv, option):
|
|
ConfigParser.py(358): def getint(self, section, option):
|
|
ConfigParser.py(361): def getfloat(self, section, option):
|
|
ConfigParser.py(364): _boolean_states = {'1': True, 'yes': True, 'true': True, 'on': True,
|
|
ConfigParser.py(365): '0': False, 'no': False, 'false': False, 'off': False}
|
|
ConfigParser.py(367): def getboolean(self, section, option):
|
|
ConfigParser.py(373): def optionxform(self, optionstr):
|
|
ConfigParser.py(376): def has_option(self, section, option):
|
|
ConfigParser.py(388): def set(self, section, option, value=None):
|
|
ConfigParser.py(399): def write(self, fp):
|
|
ConfigParser.py(416): def remove_option(self, section, option):
|
|
ConfigParser.py(431): def remove_section(self, section):
|
|
ConfigParser.py(441): SECTCRE = re.compile(
|
|
ConfigParser.py(442): r'\[' # [
|
|
--- modulename: re, funcname: compile
|
|
re.py(190): return _compile(pattern, flags)
|
|
--- modulename: re, funcname: _compile
|
|
re.py(228): pattern, flags = key
|
|
re.py(229): bypass_cache = flags & DEBUG
|
|
re.py(230): if not bypass_cache:
|
|
re.py(231): cachekey = (type(key[0]),) + key
|
|
re.py(232): p = _cache.get(cachekey)
|
|
re.py(233): if p is not None:
|
|
re.py(235): if isinstance(pattern, _pattern_type):
|
|
re.py(239): if not sre_compile.isstring(pattern):
|
|
--- modulename: sre_compile, funcname: isstring
|
|
sre_compile.py(473): for tp in STRING_TYPES:
|
|
sre_compile.py(474): if isinstance(obj, tp):
|
|
sre_compile.py(475): return 1
|
|
re.py(241): try:
|
|
re.py(242): p = sre_compile.compile(pattern, flags)
|
|
--- modulename: sre_compile, funcname: compile
|
|
sre_compile.py(496): if isstring(p):
|
|
--- modulename: sre_compile, funcname: isstring
|
|
sre_compile.py(473): for tp in STRING_TYPES:
|
|
sre_compile.py(474): if isinstance(obj, tp):
|
|
sre_compile.py(475): return 1
|
|
sre_compile.py(497): pattern = p
|
|
sre_compile.py(498): p = sre_parse.parse(p, flags)
|
|
--- modulename: sre_parse, funcname: parse
|
|
sre_parse.py(678): source = Tokenizer(str)
|
|
--- modulename: sre_parse, funcname: __init__
|
|
sre_parse.py(179): self.string = string
|
|
sre_parse.py(180): self.index = 0
|
|
sre_parse.py(181): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(188): try:
|
|
sre_parse.py(189): c = self.string[self.index + 1]
|
|
sre_parse.py(192): char = char + c
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(680): if pattern is None:
|
|
sre_parse.py(681): pattern = Pattern()
|
|
--- modulename: sre_parse, funcname: __init__
|
|
sre_parse.py(68): self.flags = 0
|
|
sre_parse.py(69): self.open = []
|
|
sre_parse.py(70): self.groups = 1
|
|
sre_parse.py(71): self.groupdict = {}
|
|
sre_parse.py(682): pattern.flags = flags
|
|
sre_parse.py(683): pattern.str = str
|
|
sre_parse.py(685): p = _parse_sub(source, pattern, 0)
|
|
--- modulename: sre_parse, funcname: _parse_sub
|
|
sre_parse.py(304): items = []
|
|
sre_parse.py(305): itemsappend = items.append
|
|
sre_parse.py(306): sourcematch = source.match
|
|
sre_parse.py(307): while 1:
|
|
sre_parse.py(308): itemsappend(_parse(source, state))
|
|
--- modulename: sre_parse, funcname: _parse
|
|
sre_parse.py(381): subpattern = SubPattern(state)
|
|
--- modulename: sre_parse, funcname: __init__
|
|
sre_parse.py(91): self.pattern = pattern
|
|
sre_parse.py(92): if data is None:
|
|
sre_parse.py(93): data = []
|
|
sre_parse.py(94): self.data = data
|
|
sre_parse.py(95): self.width = None
|
|
sre_parse.py(384): subpatternappend = subpattern.append
|
|
sre_parse.py(385): sourceget = source.get
|
|
sre_parse.py(386): sourcematch = source.match
|
|
sre_parse.py(387): _len = len
|
|
sre_parse.py(388): PATTERNENDERS = _PATTERNENDERS
|
|
sre_parse.py(389): ASSERTCHARS = _ASSERTCHARS
|
|
sre_parse.py(390): LOOKBEHINDASSERTCHARS = _LOOKBEHINDASSERTCHARS
|
|
sre_parse.py(391): REPEATCODES = _REPEATCODES
|
|
sre_parse.py(393): while 1:
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(397): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(398): if this is None:
|
|
sre_parse.py(401): if state.flags & SRE_FLAG_VERBOSE:
|
|
sre_parse.py(412): if this and this[0] not in SPECIAL_CHARS:
|
|
sre_parse.py(415): elif this == "[":
|
|
sre_parse.py(472): elif this and this[0] in REPEAT_CHARS:
|
|
sre_parse.py(525): elif this == ".":
|
|
sre_parse.py(528): elif this == "(":
|
|
sre_parse.py(660): elif this == "^":
|
|
sre_parse.py(663): elif this == "$":
|
|
sre_parse.py(666): elif this and this[0] == "\\":
|
|
sre_parse.py(667): code = _escape(source, this, state)
|
|
--- modulename: sre_parse, funcname: _escape
|
|
sre_parse.py(259): code = CATEGORIES.get(escape)
|
|
sre_parse.py(260): if code:
|
|
sre_parse.py(262): code = ESCAPES.get(escape)
|
|
sre_parse.py(263): if code:
|
|
sre_parse.py(265): try:
|
|
sre_parse.py(266): c = escape[1:2]
|
|
sre_parse.py(267): if c == "x":
|
|
sre_parse.py(274): elif c == "0":
|
|
sre_parse.py(279): elif c in DIGITS:
|
|
sre_parse.py(295): if len(escape) == 2:
|
|
sre_parse.py(296): return LITERAL, ord(escape[1])
|
|
sre_parse.py(668): subpatternappend(code)
|
|
--- modulename: sre_parse, funcname: append
|
|
sre_parse.py(139): self.data.append(code)
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(397): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(398): if this is None:
|
|
sre_parse.py(401): if state.flags & SRE_FLAG_VERBOSE:
|
|
sre_parse.py(412): if this and this[0] not in SPECIAL_CHARS:
|
|
sre_parse.py(415): elif this == "[":
|
|
sre_parse.py(472): elif this and this[0] in REPEAT_CHARS:
|
|
sre_parse.py(525): elif this == ".":
|
|
sre_parse.py(528): elif this == "(":
|
|
sre_parse.py(529): group = 1
|
|
sre_parse.py(530): name = None
|
|
sre_parse.py(531): condgroup = None
|
|
sre_parse.py(532): if sourcematch("?"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(197): if skip:
|
|
sre_parse.py(198): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(199): return 1
|
|
sre_parse.py(533): group = 0
|
|
sre_parse.py(535): if sourcematch("P"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(197): if skip:
|
|
sre_parse.py(198): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(199): return 1
|
|
sre_parse.py(537): if sourcematch("<"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(197): if skip:
|
|
sre_parse.py(198): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(199): return 1
|
|
sre_parse.py(539): name = ""
|
|
sre_parse.py(540): while 1:
|
|
sre_parse.py(541): char = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(542): if char is None:
|
|
sre_parse.py(544): if char == ">":
|
|
sre_parse.py(546): name = name + char
|
|
sre_parse.py(541): char = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(542): if char is None:
|
|
sre_parse.py(544): if char == ">":
|
|
sre_parse.py(546): name = name + char
|
|
sre_parse.py(541): char = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(542): if char is None:
|
|
sre_parse.py(544): if char == ">":
|
|
sre_parse.py(546): name = name + char
|
|
sre_parse.py(541): char = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(542): if char is None:
|
|
sre_parse.py(544): if char == ">":
|
|
sre_parse.py(546): name = name + char
|
|
sre_parse.py(541): char = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(542): if char is None:
|
|
sre_parse.py(544): if char == ">":
|
|
sre_parse.py(546): name = name + char
|
|
sre_parse.py(541): char = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(542): if char is None:
|
|
sre_parse.py(544): if char == ">":
|
|
sre_parse.py(546): name = name + char
|
|
sre_parse.py(541): char = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(542): if char is None:
|
|
sre_parse.py(544): if char == ">":
|
|
sre_parse.py(545): break
|
|
sre_parse.py(547): group = 1
|
|
sre_parse.py(548): if not name:
|
|
sre_parse.py(550): if not isname(name):
|
|
--- modulename: sre_parse, funcname: isname
|
|
sre_parse.py(218): if not isident(name[0]):
|
|
--- modulename: sre_parse, funcname: isident
|
|
sre_parse.py(211): return "a" <= char <= "z" or "A" <= char <= "Z" or char == "_"
|
|
sre_parse.py(220): for char in name[1:]:
|
|
sre_parse.py(221): if not isident(char) and not isdigit(char):
|
|
--- modulename: sre_parse, funcname: isident
|
|
sre_parse.py(211): return "a" <= char <= "z" or "A" <= char <= "Z" or char == "_"
|
|
sre_parse.py(220): for char in name[1:]:
|
|
sre_parse.py(221): if not isident(char) and not isdigit(char):
|
|
--- modulename: sre_parse, funcname: isident
|
|
sre_parse.py(211): return "a" <= char <= "z" or "A" <= char <= "Z" or char == "_"
|
|
sre_parse.py(220): for char in name[1:]:
|
|
sre_parse.py(221): if not isident(char) and not isdigit(char):
|
|
--- modulename: sre_parse, funcname: isident
|
|
sre_parse.py(211): return "a" <= char <= "z" or "A" <= char <= "Z" or char == "_"
|
|
sre_parse.py(220): for char in name[1:]:
|
|
sre_parse.py(221): if not isident(char) and not isdigit(char):
|
|
--- modulename: sre_parse, funcname: isident
|
|
sre_parse.py(211): return "a" <= char <= "z" or "A" <= char <= "Z" or char == "_"
|
|
sre_parse.py(220): for char in name[1:]:
|
|
sre_parse.py(221): if not isident(char) and not isdigit(char):
|
|
--- modulename: sre_parse, funcname: isident
|
|
sre_parse.py(211): return "a" <= char <= "z" or "A" <= char <= "Z" or char == "_"
|
|
sre_parse.py(220): for char in name[1:]:
|
|
sre_parse.py(223): return True
|
|
sre_parse.py(635): if group:
|
|
sre_parse.py(637): if group == 2:
|
|
sre_parse.py(641): group = state.opengroup(name)
|
|
--- modulename: sre_parse, funcname: opengroup
|
|
sre_parse.py(73): gid = self.groups
|
|
sre_parse.py(74): self.groups = gid + 1
|
|
sre_parse.py(75): if name is not None:
|
|
sre_parse.py(76): ogid = self.groupdict.get(name, None)
|
|
sre_parse.py(77): if ogid is not None:
|
|
sre_parse.py(80): self.groupdict[name] = gid
|
|
sre_parse.py(81): self.open.append(gid)
|
|
sre_parse.py(82): return gid
|
|
sre_parse.py(642): if condgroup:
|
|
sre_parse.py(645): p = _parse_sub(source, state)
|
|
--- modulename: sre_parse, funcname: _parse_sub
|
|
sre_parse.py(304): items = []
|
|
sre_parse.py(305): itemsappend = items.append
|
|
sre_parse.py(306): sourcematch = source.match
|
|
sre_parse.py(307): while 1:
|
|
sre_parse.py(308): itemsappend(_parse(source, state))
|
|
--- modulename: sre_parse, funcname: _parse
|
|
sre_parse.py(381): subpattern = SubPattern(state)
|
|
--- modulename: sre_parse, funcname: __init__
|
|
sre_parse.py(91): self.pattern = pattern
|
|
sre_parse.py(92): if data is None:
|
|
sre_parse.py(93): data = []
|
|
sre_parse.py(94): self.data = data
|
|
sre_parse.py(95): self.width = None
|
|
sre_parse.py(384): subpatternappend = subpattern.append
|
|
sre_parse.py(385): sourceget = source.get
|
|
sre_parse.py(386): sourcematch = source.match
|
|
sre_parse.py(387): _len = len
|
|
sre_parse.py(388): PATTERNENDERS = _PATTERNENDERS
|
|
sre_parse.py(389): ASSERTCHARS = _ASSERTCHARS
|
|
sre_parse.py(390): LOOKBEHINDASSERTCHARS = _LOOKBEHINDASSERTCHARS
|
|
sre_parse.py(391): REPEATCODES = _REPEATCODES
|
|
sre_parse.py(393): while 1:
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(397): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(398): if this is None:
|
|
sre_parse.py(401): if state.flags & SRE_FLAG_VERBOSE:
|
|
sre_parse.py(412): if this and this[0] not in SPECIAL_CHARS:
|
|
sre_parse.py(415): elif this == "[":
|
|
sre_parse.py(417): set = []
|
|
sre_parse.py(418): setappend = set.append
|
|
sre_parse.py(421): if sourcematch("^"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(197): if skip:
|
|
sre_parse.py(198): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(199): return 1
|
|
sre_parse.py(422): setappend((NEGATE, None))
|
|
sre_parse.py(424): start = set[:]
|
|
sre_parse.py(425): while 1:
|
|
sre_parse.py(426): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(427): if this == "]" and set != start:
|
|
sre_parse.py(429): elif this and this[0] == "\\":
|
|
sre_parse.py(431): elif this:
|
|
sre_parse.py(432): code1 = LITERAL, ord(this)
|
|
sre_parse.py(435): if sourcematch("-"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(459): if code1[0] is IN:
|
|
sre_parse.py(461): setappend(code1)
|
|
sre_parse.py(426): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(427): if this == "]" and set != start:
|
|
sre_parse.py(428): break
|
|
sre_parse.py(464): if _len(set)==1 and set[0][0] is LITERAL:
|
|
sre_parse.py(466): elif _len(set)==2 and set[0][0] is NEGATE and set[1][0] is LITERAL:
|
|
sre_parse.py(467): subpatternappend((NOT_LITERAL, set[1][1])) # optimization
|
|
--- modulename: sre_parse, funcname: append
|
|
sre_parse.py(139): self.data.append(code)
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(397): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(398): if this is None:
|
|
sre_parse.py(401): if state.flags & SRE_FLAG_VERBOSE:
|
|
sre_parse.py(412): if this and this[0] not in SPECIAL_CHARS:
|
|
sre_parse.py(415): elif this == "[":
|
|
sre_parse.py(472): elif this and this[0] in REPEAT_CHARS:
|
|
sre_parse.py(474): if this == "?":
|
|
sre_parse.py(476): elif this == "*":
|
|
sre_parse.py(479): elif this == "+":
|
|
sre_parse.py(480): min, max = 1, MAXREPEAT
|
|
sre_parse.py(512): if subpattern:
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
sre_parse.py(513): item = subpattern[-1:]
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(132): return SubPattern(self.pattern, self.data[index])
|
|
--- modulename: sre_parse, funcname: __init__
|
|
sre_parse.py(91): self.pattern = pattern
|
|
sre_parse.py(92): if data is None:
|
|
sre_parse.py(94): self.data = data
|
|
sre_parse.py(95): self.width = None
|
|
sre_parse.py(516): if not item or (_len(item) == 1 and item[0][0] == AT):
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_parse.py(518): if item[0][0] in REPEATCODES:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_parse.py(520): if sourcematch("?"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(523): subpattern[-1] = (MAX_REPEAT, (min, max, item))
|
|
--- modulename: sre_parse, funcname: __setitem__
|
|
sre_parse.py(135): self.data[index] = code
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(396): break # end of subpattern
|
|
sre_parse.py(673): return subpattern
|
|
sre_parse.py(309): if sourcematch("|"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(311): if not nested:
|
|
sre_parse.py(313): if not source.next or sourcematch(")", 0):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(197): if skip:
|
|
sre_parse.py(199): return 1
|
|
sre_parse.py(314): break
|
|
sre_parse.py(318): if len(items) == 1:
|
|
sre_parse.py(319): return items[0]
|
|
sre_parse.py(646): if not sourcematch(")"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(197): if skip:
|
|
sre_parse.py(198): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(188): try:
|
|
sre_parse.py(189): c = self.string[self.index + 1]
|
|
sre_parse.py(192): char = char + c
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(199): return 1
|
|
sre_parse.py(648): if group is not None:
|
|
sre_parse.py(649): state.closegroup(group)
|
|
--- modulename: sre_parse, funcname: closegroup
|
|
sre_parse.py(84): self.open.remove(gid)
|
|
sre_parse.py(650): subpatternappend((SUBPATTERN, (group, p)))
|
|
--- modulename: sre_parse, funcname: append
|
|
sre_parse.py(139): self.data.append(code)
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(397): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(184): self.next = None
|
|
sre_parse.py(185): return
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(398): if this is None:
|
|
sre_parse.py(401): if state.flags & SRE_FLAG_VERBOSE:
|
|
sre_parse.py(412): if this and this[0] not in SPECIAL_CHARS:
|
|
sre_parse.py(415): elif this == "[":
|
|
sre_parse.py(472): elif this and this[0] in REPEAT_CHARS:
|
|
sre_parse.py(525): elif this == ".":
|
|
sre_parse.py(528): elif this == "(":
|
|
sre_parse.py(660): elif this == "^":
|
|
sre_parse.py(663): elif this == "$":
|
|
sre_parse.py(666): elif this and this[0] == "\\":
|
|
sre_parse.py(667): code = _escape(source, this, state)
|
|
--- modulename: sre_parse, funcname: _escape
|
|
sre_parse.py(259): code = CATEGORIES.get(escape)
|
|
sre_parse.py(260): if code:
|
|
sre_parse.py(262): code = ESCAPES.get(escape)
|
|
sre_parse.py(263): if code:
|
|
sre_parse.py(265): try:
|
|
sre_parse.py(266): c = escape[1:2]
|
|
sre_parse.py(267): if c == "x":
|
|
sre_parse.py(274): elif c == "0":
|
|
sre_parse.py(279): elif c in DIGITS:
|
|
sre_parse.py(295): if len(escape) == 2:
|
|
sre_parse.py(296): return LITERAL, ord(escape[1])
|
|
sre_parse.py(668): subpatternappend(code)
|
|
--- modulename: sre_parse, funcname: append
|
|
sre_parse.py(139): self.data.append(code)
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(397): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(184): self.next = None
|
|
sre_parse.py(185): return
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(398): if this is None:
|
|
sre_parse.py(399): break # end of pattern
|
|
sre_parse.py(673): return subpattern
|
|
sre_parse.py(309): if sourcematch("|"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(311): if not nested:
|
|
sre_parse.py(312): break
|
|
sre_parse.py(318): if len(items) == 1:
|
|
sre_parse.py(319): return items[0]
|
|
sre_parse.py(687): tail = source.get()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(184): self.next = None
|
|
sre_parse.py(185): return
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(688): if tail == ")":
|
|
sre_parse.py(690): elif tail:
|
|
sre_parse.py(693): if flags & SRE_FLAG_DEBUG:
|
|
sre_parse.py(696): if not (flags & SRE_FLAG_VERBOSE) and p.pattern.flags & SRE_FLAG_VERBOSE:
|
|
sre_parse.py(701): return p
|
|
sre_compile.py(502): code = _code(p, flags)
|
|
--- modulename: sre_compile, funcname: _code
|
|
sre_compile.py(480): flags = p.pattern.flags | flags
|
|
sre_compile.py(481): code = []
|
|
sre_compile.py(484): _compile_info(code, p, flags)
|
|
--- modulename: sre_compile, funcname: _compile_info
|
|
sre_compile.py(363): lo, hi = pattern.getwidth()
|
|
--- modulename: sre_parse, funcname: getwidth
|
|
sre_parse.py(142): if self.width:
|
|
sre_parse.py(144): lo = hi = 0
|
|
sre_parse.py(145): UNITCODES = (ANY, RANGE, IN, LITERAL, NOT_LITERAL, CATEGORY)
|
|
sre_parse.py(146): REPEATCODES = (MIN_REPEAT, MAX_REPEAT)
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(148): if op is BRANCH:
|
|
sre_parse.py(157): elif op is CALL:
|
|
sre_parse.py(161): elif op is SUBPATTERN:
|
|
sre_parse.py(165): elif op in REPEATCODES:
|
|
sre_parse.py(169): elif op in UNITCODES:
|
|
sre_parse.py(170): lo = lo + 1
|
|
sre_parse.py(171): hi = hi + 1
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(148): if op is BRANCH:
|
|
sre_parse.py(157): elif op is CALL:
|
|
sre_parse.py(161): elif op is SUBPATTERN:
|
|
sre_parse.py(162): i, j = av[1].getwidth()
|
|
--- modulename: sre_parse, funcname: getwidth
|
|
sre_parse.py(142): if self.width:
|
|
sre_parse.py(144): lo = hi = 0
|
|
sre_parse.py(145): UNITCODES = (ANY, RANGE, IN, LITERAL, NOT_LITERAL, CATEGORY)
|
|
sre_parse.py(146): REPEATCODES = (MIN_REPEAT, MAX_REPEAT)
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(148): if op is BRANCH:
|
|
sre_parse.py(157): elif op is CALL:
|
|
sre_parse.py(161): elif op is SUBPATTERN:
|
|
sre_parse.py(165): elif op in REPEATCODES:
|
|
sre_parse.py(166): i, j = av[2].getwidth()
|
|
--- modulename: sre_parse, funcname: getwidth
|
|
sre_parse.py(142): if self.width:
|
|
sre_parse.py(144): lo = hi = 0
|
|
sre_parse.py(145): UNITCODES = (ANY, RANGE, IN, LITERAL, NOT_LITERAL, CATEGORY)
|
|
sre_parse.py(146): REPEATCODES = (MIN_REPEAT, MAX_REPEAT)
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(148): if op is BRANCH:
|
|
sre_parse.py(157): elif op is CALL:
|
|
sre_parse.py(161): elif op is SUBPATTERN:
|
|
sre_parse.py(165): elif op in REPEATCODES:
|
|
sre_parse.py(169): elif op in UNITCODES:
|
|
sre_parse.py(170): lo = lo + 1
|
|
sre_parse.py(171): hi = hi + 1
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(174): self.width = min(lo, MAXREPEAT - 1), min(hi, MAXREPEAT)
|
|
sre_parse.py(175): return self.width
|
|
sre_parse.py(167): lo = lo + i * av[0]
|
|
sre_parse.py(168): hi = hi + j * av[1]
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(174): self.width = min(lo, MAXREPEAT - 1), min(hi, MAXREPEAT)
|
|
sre_parse.py(175): return self.width
|
|
sre_parse.py(163): lo = lo + i
|
|
sre_parse.py(164): hi = hi + j
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(148): if op is BRANCH:
|
|
sre_parse.py(157): elif op is CALL:
|
|
sre_parse.py(161): elif op is SUBPATTERN:
|
|
sre_parse.py(165): elif op in REPEATCODES:
|
|
sre_parse.py(169): elif op in UNITCODES:
|
|
sre_parse.py(170): lo = lo + 1
|
|
sre_parse.py(171): hi = hi + 1
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(174): self.width = min(lo, MAXREPEAT - 1), min(hi, MAXREPEAT)
|
|
sre_parse.py(175): return self.width
|
|
sre_compile.py(364): if lo == 0:
|
|
sre_compile.py(367): prefix = []
|
|
sre_compile.py(368): prefixappend = prefix.append
|
|
sre_compile.py(369): prefix_skip = 0
|
|
sre_compile.py(370): charset = [] # not used
|
|
sre_compile.py(371): charsetappend = charset.append
|
|
sre_compile.py(372): if not (flags & SRE_FLAG_IGNORECASE):
|
|
sre_compile.py(374): for op, av in pattern.data:
|
|
sre_compile.py(375): if op is LITERAL:
|
|
sre_compile.py(376): if len(prefix) == prefix_skip:
|
|
sre_compile.py(377): prefix_skip = prefix_skip + 1
|
|
sre_compile.py(378): prefixappend(av)
|
|
sre_compile.py(374): for op, av in pattern.data:
|
|
sre_compile.py(375): if op is LITERAL:
|
|
sre_compile.py(379): elif op is SUBPATTERN and len(av[1]) == 1:
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
sre_compile.py(380): op, av = av[1][0]
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(381): if op is LITERAL:
|
|
sre_compile.py(384): break
|
|
sre_compile.py(388): if not prefix and pattern.data:
|
|
sre_compile.py(427): emit = code.append
|
|
sre_compile.py(428): emit(OPCODES[INFO])
|
|
sre_compile.py(429): skip = len(code); emit(0)
|
|
sre_compile.py(431): mask = 0
|
|
sre_compile.py(432): if prefix:
|
|
sre_compile.py(433): mask = SRE_INFO_PREFIX
|
|
sre_compile.py(434): if len(prefix) == prefix_skip == len(pattern.data):
|
|
sre_compile.py(438): emit(mask)
|
|
sre_compile.py(440): if lo < MAXCODE:
|
|
sre_compile.py(441): emit(lo)
|
|
sre_compile.py(445): if hi < MAXCODE:
|
|
sre_compile.py(448): emit(0)
|
|
sre_compile.py(450): if prefix:
|
|
sre_compile.py(451): emit(len(prefix)) # length
|
|
sre_compile.py(452): emit(prefix_skip) # skip
|
|
sre_compile.py(453): code.extend(prefix)
|
|
sre_compile.py(455): table = [-1] + ([0]*len(prefix))
|
|
sre_compile.py(456): for i in xrange(len(prefix)):
|
|
sre_compile.py(457): table[i+1] = table[i]+1
|
|
sre_compile.py(458): while table[i+1] > 0 and prefix[i] != prefix[table[i+1]-1]:
|
|
sre_compile.py(456): for i in xrange(len(prefix)):
|
|
sre_compile.py(460): code.extend(table[1:]) # don't store first entry
|
|
sre_compile.py(463): code[skip] = len(code) - skip
|
|
sre_compile.py(487): _compile(code, p.data, flags)
|
|
--- modulename: sre_compile, funcname: _compile
|
|
sre_compile.py(34): emit = code.append
|
|
sre_compile.py(35): _len = len
|
|
sre_compile.py(36): LITERAL_CODES = _LITERAL_CODES
|
|
sre_compile.py(37): REPEATING_CODES = _REPEATING_CODES
|
|
sre_compile.py(38): SUCCESS_CODES = _SUCCESS_CODES
|
|
sre_compile.py(39): ASSERT_CODES = _ASSERT_CODES
|
|
sre_compile.py(40): for op, av in pattern:
|
|
sre_compile.py(41): if op in LITERAL_CODES:
|
|
sre_compile.py(42): if flags & SRE_FLAG_IGNORECASE:
|
|
sre_compile.py(46): emit(OPCODES[op])
|
|
sre_compile.py(47): emit(av)
|
|
sre_compile.py(40): for op, av in pattern:
|
|
sre_compile.py(41): if op in LITERAL_CODES:
|
|
sre_compile.py(48): elif op is IN:
|
|
sre_compile.py(59): elif op is ANY:
|
|
sre_compile.py(64): elif op in REPEATING_CODES:
|
|
sre_compile.py(96): elif op is SUBPATTERN:
|
|
sre_compile.py(97): if av[0]:
|
|
sre_compile.py(98): emit(OPCODES[MARK])
|
|
sre_compile.py(99): emit((av[0]-1)*2)
|
|
sre_compile.py(101): _compile(code, av[1], flags)
|
|
--- modulename: sre_compile, funcname: _compile
|
|
sre_compile.py(34): emit = code.append
|
|
sre_compile.py(35): _len = len
|
|
sre_compile.py(36): LITERAL_CODES = _LITERAL_CODES
|
|
sre_compile.py(37): REPEATING_CODES = _REPEATING_CODES
|
|
sre_compile.py(38): SUCCESS_CODES = _SUCCESS_CODES
|
|
sre_compile.py(39): ASSERT_CODES = _ASSERT_CODES
|
|
sre_compile.py(40): for op, av in pattern:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(41): if op in LITERAL_CODES:
|
|
sre_compile.py(48): elif op is IN:
|
|
sre_compile.py(59): elif op is ANY:
|
|
sre_compile.py(64): elif op in REPEATING_CODES:
|
|
sre_compile.py(65): if flags & SRE_FLAG_TEMPLATE:
|
|
sre_compile.py(74): elif _simple(av) and op is not REPEAT:
|
|
--- modulename: sre_compile, funcname: _simple
|
|
sre_compile.py(356): lo, hi = av[2].getwidth()
|
|
--- modulename: sre_parse, funcname: getwidth
|
|
sre_parse.py(142): if self.width:
|
|
sre_parse.py(143): return self.width
|
|
sre_compile.py(357): return lo == hi == 1 and av[2][0][0] != SUBPATTERN
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(75): if op is MAX_REPEAT:
|
|
sre_compile.py(76): emit(OPCODES[REPEAT_ONE])
|
|
sre_compile.py(79): skip = _len(code); emit(0)
|
|
sre_compile.py(80): emit(av[0])
|
|
sre_compile.py(81): emit(av[1])
|
|
sre_compile.py(82): _compile(code, av[2], flags)
|
|
--- modulename: sre_compile, funcname: _compile
|
|
sre_compile.py(34): emit = code.append
|
|
sre_compile.py(35): _len = len
|
|
sre_compile.py(36): LITERAL_CODES = _LITERAL_CODES
|
|
sre_compile.py(37): REPEATING_CODES = _REPEATING_CODES
|
|
sre_compile.py(38): SUCCESS_CODES = _SUCCESS_CODES
|
|
sre_compile.py(39): ASSERT_CODES = _ASSERT_CODES
|
|
sre_compile.py(40): for op, av in pattern:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(41): if op in LITERAL_CODES:
|
|
sre_compile.py(42): if flags & SRE_FLAG_IGNORECASE:
|
|
sre_compile.py(46): emit(OPCODES[op])
|
|
sre_compile.py(47): emit(av)
|
|
sre_compile.py(40): for op, av in pattern:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(83): emit(OPCODES[SUCCESS])
|
|
sre_compile.py(84): code[skip] = _len(code) - skip
|
|
sre_compile.py(40): for op, av in pattern:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(102): if av[0]:
|
|
sre_compile.py(103): emit(OPCODES[MARK])
|
|
sre_compile.py(104): emit((av[0]-1)*2+1)
|
|
sre_compile.py(40): for op, av in pattern:
|
|
sre_compile.py(41): if op in LITERAL_CODES:
|
|
sre_compile.py(42): if flags & SRE_FLAG_IGNORECASE:
|
|
sre_compile.py(46): emit(OPCODES[op])
|
|
sre_compile.py(47): emit(av)
|
|
sre_compile.py(40): for op, av in pattern:
|
|
sre_compile.py(489): code.append(OPCODES[SUCCESS])
|
|
sre_compile.py(491): return code
|
|
sre_compile.py(507): if p.pattern.groups > 100:
|
|
sre_compile.py(513): groupindex = p.pattern.groupdict
|
|
sre_compile.py(514): indexgroup = [None] * p.pattern.groups
|
|
sre_compile.py(515): for k, i in groupindex.items():
|
|
sre_compile.py(516): indexgroup[i] = k
|
|
sre_compile.py(515): for k, i in groupindex.items():
|
|
sre_compile.py(518): return _sre.compile(
|
|
sre_compile.py(519): pattern, flags | p.pattern.flags, code,
|
|
sre_compile.py(520): p.pattern.groups-1,
|
|
sre_compile.py(521): groupindex, indexgroup
|
|
re.py(245): if not bypass_cache:
|
|
re.py(246): if len(_cache) >= _MAXCACHE:
|
|
re.py(248): _cache[cachekey] = p
|
|
re.py(249): return p
|
|
ConfigParser.py(446): OPTCRE = re.compile(
|
|
ConfigParser.py(447): r'(?P<option>[^:=\s][^:=]*)' # very permissive!
|
|
--- modulename: re, funcname: compile
|
|
re.py(190): return _compile(pattern, flags)
|
|
--- modulename: re, funcname: _compile
|
|
re.py(228): pattern, flags = key
|
|
re.py(229): bypass_cache = flags & DEBUG
|
|
re.py(230): if not bypass_cache:
|
|
re.py(231): cachekey = (type(key[0]),) + key
|
|
re.py(232): p = _cache.get(cachekey)
|
|
re.py(233): if p is not None:
|
|
re.py(235): if isinstance(pattern, _pattern_type):
|
|
re.py(239): if not sre_compile.isstring(pattern):
|
|
--- modulename: sre_compile, funcname: isstring
|
|
sre_compile.py(473): for tp in STRING_TYPES:
|
|
sre_compile.py(474): if isinstance(obj, tp):
|
|
sre_compile.py(475): return 1
|
|
re.py(241): try:
|
|
re.py(242): p = sre_compile.compile(pattern, flags)
|
|
--- modulename: sre_compile, funcname: compile
|
|
sre_compile.py(496): if isstring(p):
|
|
--- modulename: sre_compile, funcname: isstring
|
|
sre_compile.py(473): for tp in STRING_TYPES:
|
|
sre_compile.py(474): if isinstance(obj, tp):
|
|
sre_compile.py(475): return 1
|
|
sre_compile.py(497): pattern = p
|
|
sre_compile.py(498): p = sre_parse.parse(p, flags)
|
|
--- modulename: sre_parse, funcname: parse
|
|
sre_parse.py(678): source = Tokenizer(str)
|
|
--- modulename: sre_parse, funcname: __init__
|
|
sre_parse.py(179): self.string = string
|
|
sre_parse.py(180): self.index = 0
|
|
sre_parse.py(181): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(680): if pattern is None:
|
|
sre_parse.py(681): pattern = Pattern()
|
|
--- modulename: sre_parse, funcname: __init__
|
|
sre_parse.py(68): self.flags = 0
|
|
sre_parse.py(69): self.open = []
|
|
sre_parse.py(70): self.groups = 1
|
|
sre_parse.py(71): self.groupdict = {}
|
|
sre_parse.py(682): pattern.flags = flags
|
|
sre_parse.py(683): pattern.str = str
|
|
sre_parse.py(685): p = _parse_sub(source, pattern, 0)
|
|
--- modulename: sre_parse, funcname: _parse_sub
|
|
sre_parse.py(304): items = []
|
|
sre_parse.py(305): itemsappend = items.append
|
|
sre_parse.py(306): sourcematch = source.match
|
|
sre_parse.py(307): while 1:
|
|
sre_parse.py(308): itemsappend(_parse(source, state))
|
|
--- modulename: sre_parse, funcname: _parse
|
|
sre_parse.py(381): subpattern = SubPattern(state)
|
|
--- modulename: sre_parse, funcname: __init__
|
|
sre_parse.py(91): self.pattern = pattern
|
|
sre_parse.py(92): if data is None:
|
|
sre_parse.py(93): data = []
|
|
sre_parse.py(94): self.data = data
|
|
sre_parse.py(95): self.width = None
|
|
sre_parse.py(384): subpatternappend = subpattern.append
|
|
sre_parse.py(385): sourceget = source.get
|
|
sre_parse.py(386): sourcematch = source.match
|
|
sre_parse.py(387): _len = len
|
|
sre_parse.py(388): PATTERNENDERS = _PATTERNENDERS
|
|
sre_parse.py(389): ASSERTCHARS = _ASSERTCHARS
|
|
sre_parse.py(390): LOOKBEHINDASSERTCHARS = _LOOKBEHINDASSERTCHARS
|
|
sre_parse.py(391): REPEATCODES = _REPEATCODES
|
|
sre_parse.py(393): while 1:
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(397): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(398): if this is None:
|
|
sre_parse.py(401): if state.flags & SRE_FLAG_VERBOSE:
|
|
sre_parse.py(412): if this and this[0] not in SPECIAL_CHARS:
|
|
sre_parse.py(415): elif this == "[":
|
|
sre_parse.py(472): elif this and this[0] in REPEAT_CHARS:
|
|
sre_parse.py(525): elif this == ".":
|
|
sre_parse.py(528): elif this == "(":
|
|
sre_parse.py(529): group = 1
|
|
sre_parse.py(530): name = None
|
|
sre_parse.py(531): condgroup = None
|
|
sre_parse.py(532): if sourcematch("?"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(197): if skip:
|
|
sre_parse.py(198): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(199): return 1
|
|
sre_parse.py(533): group = 0
|
|
sre_parse.py(535): if sourcematch("P"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(197): if skip:
|
|
sre_parse.py(198): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(199): return 1
|
|
sre_parse.py(537): if sourcematch("<"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(197): if skip:
|
|
sre_parse.py(198): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(199): return 1
|
|
sre_parse.py(539): name = ""
|
|
sre_parse.py(540): while 1:
|
|
sre_parse.py(541): char = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(542): if char is None:
|
|
sre_parse.py(544): if char == ">":
|
|
sre_parse.py(546): name = name + char
|
|
sre_parse.py(541): char = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(542): if char is None:
|
|
sre_parse.py(544): if char == ">":
|
|
sre_parse.py(546): name = name + char
|
|
sre_parse.py(541): char = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(542): if char is None:
|
|
sre_parse.py(544): if char == ">":
|
|
sre_parse.py(546): name = name + char
|
|
sre_parse.py(541): char = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(542): if char is None:
|
|
sre_parse.py(544): if char == ">":
|
|
sre_parse.py(546): name = name + char
|
|
sre_parse.py(541): char = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(542): if char is None:
|
|
sre_parse.py(544): if char == ">":
|
|
sre_parse.py(546): name = name + char
|
|
sre_parse.py(541): char = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(542): if char is None:
|
|
sre_parse.py(544): if char == ">":
|
|
sre_parse.py(546): name = name + char
|
|
sre_parse.py(541): char = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(542): if char is None:
|
|
sre_parse.py(544): if char == ">":
|
|
sre_parse.py(545): break
|
|
sre_parse.py(547): group = 1
|
|
sre_parse.py(548): if not name:
|
|
sre_parse.py(550): if not isname(name):
|
|
--- modulename: sre_parse, funcname: isname
|
|
sre_parse.py(218): if not isident(name[0]):
|
|
--- modulename: sre_parse, funcname: isident
|
|
sre_parse.py(211): return "a" <= char <= "z" or "A" <= char <= "Z" or char == "_"
|
|
sre_parse.py(220): for char in name[1:]:
|
|
sre_parse.py(221): if not isident(char) and not isdigit(char):
|
|
--- modulename: sre_parse, funcname: isident
|
|
sre_parse.py(211): return "a" <= char <= "z" or "A" <= char <= "Z" or char == "_"
|
|
sre_parse.py(220): for char in name[1:]:
|
|
sre_parse.py(221): if not isident(char) and not isdigit(char):
|
|
--- modulename: sre_parse, funcname: isident
|
|
sre_parse.py(211): return "a" <= char <= "z" or "A" <= char <= "Z" or char == "_"
|
|
sre_parse.py(220): for char in name[1:]:
|
|
sre_parse.py(221): if not isident(char) and not isdigit(char):
|
|
--- modulename: sre_parse, funcname: isident
|
|
sre_parse.py(211): return "a" <= char <= "z" or "A" <= char <= "Z" or char == "_"
|
|
sre_parse.py(220): for char in name[1:]:
|
|
sre_parse.py(221): if not isident(char) and not isdigit(char):
|
|
--- modulename: sre_parse, funcname: isident
|
|
sre_parse.py(211): return "a" <= char <= "z" or "A" <= char <= "Z" or char == "_"
|
|
sre_parse.py(220): for char in name[1:]:
|
|
sre_parse.py(221): if not isident(char) and not isdigit(char):
|
|
--- modulename: sre_parse, funcname: isident
|
|
sre_parse.py(211): return "a" <= char <= "z" or "A" <= char <= "Z" or char == "_"
|
|
sre_parse.py(220): for char in name[1:]:
|
|
sre_parse.py(223): return True
|
|
sre_parse.py(635): if group:
|
|
sre_parse.py(637): if group == 2:
|
|
sre_parse.py(641): group = state.opengroup(name)
|
|
--- modulename: sre_parse, funcname: opengroup
|
|
sre_parse.py(73): gid = self.groups
|
|
sre_parse.py(74): self.groups = gid + 1
|
|
sre_parse.py(75): if name is not None:
|
|
sre_parse.py(76): ogid = self.groupdict.get(name, None)
|
|
sre_parse.py(77): if ogid is not None:
|
|
sre_parse.py(80): self.groupdict[name] = gid
|
|
sre_parse.py(81): self.open.append(gid)
|
|
sre_parse.py(82): return gid
|
|
sre_parse.py(642): if condgroup:
|
|
sre_parse.py(645): p = _parse_sub(source, state)
|
|
--- modulename: sre_parse, funcname: _parse_sub
|
|
sre_parse.py(304): items = []
|
|
sre_parse.py(305): itemsappend = items.append
|
|
sre_parse.py(306): sourcematch = source.match
|
|
sre_parse.py(307): while 1:
|
|
sre_parse.py(308): itemsappend(_parse(source, state))
|
|
--- modulename: sre_parse, funcname: _parse
|
|
sre_parse.py(381): subpattern = SubPattern(state)
|
|
--- modulename: sre_parse, funcname: __init__
|
|
sre_parse.py(91): self.pattern = pattern
|
|
sre_parse.py(92): if data is None:
|
|
sre_parse.py(93): data = []
|
|
sre_parse.py(94): self.data = data
|
|
sre_parse.py(95): self.width = None
|
|
sre_parse.py(384): subpatternappend = subpattern.append
|
|
sre_parse.py(385): sourceget = source.get
|
|
sre_parse.py(386): sourcematch = source.match
|
|
sre_parse.py(387): _len = len
|
|
sre_parse.py(388): PATTERNENDERS = _PATTERNENDERS
|
|
sre_parse.py(389): ASSERTCHARS = _ASSERTCHARS
|
|
sre_parse.py(390): LOOKBEHINDASSERTCHARS = _LOOKBEHINDASSERTCHARS
|
|
sre_parse.py(391): REPEATCODES = _REPEATCODES
|
|
sre_parse.py(393): while 1:
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(397): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(398): if this is None:
|
|
sre_parse.py(401): if state.flags & SRE_FLAG_VERBOSE:
|
|
sre_parse.py(412): if this and this[0] not in SPECIAL_CHARS:
|
|
sre_parse.py(415): elif this == "[":
|
|
sre_parse.py(417): set = []
|
|
sre_parse.py(418): setappend = set.append
|
|
sre_parse.py(421): if sourcematch("^"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(197): if skip:
|
|
sre_parse.py(198): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(199): return 1
|
|
sre_parse.py(422): setappend((NEGATE, None))
|
|
sre_parse.py(424): start = set[:]
|
|
sre_parse.py(425): while 1:
|
|
sre_parse.py(426): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(427): if this == "]" and set != start:
|
|
sre_parse.py(429): elif this and this[0] == "\\":
|
|
sre_parse.py(431): elif this:
|
|
sre_parse.py(432): code1 = LITERAL, ord(this)
|
|
sre_parse.py(435): if sourcematch("-"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(459): if code1[0] is IN:
|
|
sre_parse.py(461): setappend(code1)
|
|
sre_parse.py(426): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(188): try:
|
|
sre_parse.py(189): c = self.string[self.index + 1]
|
|
sre_parse.py(192): char = char + c
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(427): if this == "]" and set != start:
|
|
sre_parse.py(429): elif this and this[0] == "\\":
|
|
sre_parse.py(431): elif this:
|
|
sre_parse.py(432): code1 = LITERAL, ord(this)
|
|
sre_parse.py(435): if sourcematch("-"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(459): if code1[0] is IN:
|
|
sre_parse.py(461): setappend(code1)
|
|
sre_parse.py(426): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(427): if this == "]" and set != start:
|
|
sre_parse.py(429): elif this and this[0] == "\\":
|
|
sre_parse.py(430): code1 = _class_escape(source, this)
|
|
--- modulename: sre_parse, funcname: _class_escape
|
|
sre_parse.py(227): code = ESCAPES.get(escape)
|
|
sre_parse.py(228): if code:
|
|
sre_parse.py(230): code = CATEGORIES.get(escape)
|
|
sre_parse.py(231): if code and code[0] == IN:
|
|
sre_parse.py(232): return code
|
|
sre_parse.py(435): if sourcematch("-"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(459): if code1[0] is IN:
|
|
sre_parse.py(460): code1 = code1[1][0]
|
|
sre_parse.py(461): setappend(code1)
|
|
sre_parse.py(426): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(427): if this == "]" and set != start:
|
|
sre_parse.py(428): break
|
|
sre_parse.py(464): if _len(set)==1 and set[0][0] is LITERAL:
|
|
sre_parse.py(466): elif _len(set)==2 and set[0][0] is NEGATE and set[1][0] is LITERAL:
|
|
sre_parse.py(470): subpatternappend((IN, set))
|
|
--- modulename: sre_parse, funcname: append
|
|
sre_parse.py(139): self.data.append(code)
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(397): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(398): if this is None:
|
|
sre_parse.py(401): if state.flags & SRE_FLAG_VERBOSE:
|
|
sre_parse.py(412): if this and this[0] not in SPECIAL_CHARS:
|
|
sre_parse.py(415): elif this == "[":
|
|
sre_parse.py(417): set = []
|
|
sre_parse.py(418): setappend = set.append
|
|
sre_parse.py(421): if sourcematch("^"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(197): if skip:
|
|
sre_parse.py(198): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(199): return 1
|
|
sre_parse.py(422): setappend((NEGATE, None))
|
|
sre_parse.py(424): start = set[:]
|
|
sre_parse.py(425): while 1:
|
|
sre_parse.py(426): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(427): if this == "]" and set != start:
|
|
sre_parse.py(429): elif this and this[0] == "\\":
|
|
sre_parse.py(431): elif this:
|
|
sre_parse.py(432): code1 = LITERAL, ord(this)
|
|
sre_parse.py(435): if sourcematch("-"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(459): if code1[0] is IN:
|
|
sre_parse.py(461): setappend(code1)
|
|
sre_parse.py(426): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(427): if this == "]" and set != start:
|
|
sre_parse.py(429): elif this and this[0] == "\\":
|
|
sre_parse.py(431): elif this:
|
|
sre_parse.py(432): code1 = LITERAL, ord(this)
|
|
sre_parse.py(435): if sourcematch("-"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(459): if code1[0] is IN:
|
|
sre_parse.py(461): setappend(code1)
|
|
sre_parse.py(426): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(427): if this == "]" and set != start:
|
|
sre_parse.py(428): break
|
|
sre_parse.py(464): if _len(set)==1 and set[0][0] is LITERAL:
|
|
sre_parse.py(466): elif _len(set)==2 and set[0][0] is NEGATE and set[1][0] is LITERAL:
|
|
sre_parse.py(470): subpatternappend((IN, set))
|
|
--- modulename: sre_parse, funcname: append
|
|
sre_parse.py(139): self.data.append(code)
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(397): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(398): if this is None:
|
|
sre_parse.py(401): if state.flags & SRE_FLAG_VERBOSE:
|
|
sre_parse.py(412): if this and this[0] not in SPECIAL_CHARS:
|
|
sre_parse.py(415): elif this == "[":
|
|
sre_parse.py(472): elif this and this[0] in REPEAT_CHARS:
|
|
sre_parse.py(474): if this == "?":
|
|
sre_parse.py(476): elif this == "*":
|
|
sre_parse.py(477): min, max = 0, MAXREPEAT
|
|
sre_parse.py(512): if subpattern:
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
sre_parse.py(513): item = subpattern[-1:]
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(132): return SubPattern(self.pattern, self.data[index])
|
|
--- modulename: sre_parse, funcname: __init__
|
|
sre_parse.py(91): self.pattern = pattern
|
|
sre_parse.py(92): if data is None:
|
|
sre_parse.py(94): self.data = data
|
|
sre_parse.py(95): self.width = None
|
|
sre_parse.py(516): if not item or (_len(item) == 1 and item[0][0] == AT):
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_parse.py(518): if item[0][0] in REPEATCODES:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_parse.py(520): if sourcematch("?"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(523): subpattern[-1] = (MAX_REPEAT, (min, max, item))
|
|
--- modulename: sre_parse, funcname: __setitem__
|
|
sre_parse.py(135): self.data[index] = code
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(396): break # end of subpattern
|
|
sre_parse.py(673): return subpattern
|
|
sre_parse.py(309): if sourcematch("|"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(311): if not nested:
|
|
sre_parse.py(313): if not source.next or sourcematch(")", 0):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(197): if skip:
|
|
sre_parse.py(199): return 1
|
|
sre_parse.py(314): break
|
|
sre_parse.py(318): if len(items) == 1:
|
|
sre_parse.py(319): return items[0]
|
|
sre_parse.py(646): if not sourcematch(")"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(197): if skip:
|
|
sre_parse.py(198): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(188): try:
|
|
sre_parse.py(189): c = self.string[self.index + 1]
|
|
sre_parse.py(192): char = char + c
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(199): return 1
|
|
sre_parse.py(648): if group is not None:
|
|
sre_parse.py(649): state.closegroup(group)
|
|
--- modulename: sre_parse, funcname: closegroup
|
|
sre_parse.py(84): self.open.remove(gid)
|
|
sre_parse.py(650): subpatternappend((SUBPATTERN, (group, p)))
|
|
--- modulename: sre_parse, funcname: append
|
|
sre_parse.py(139): self.data.append(code)
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(397): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(398): if this is None:
|
|
sre_parse.py(401): if state.flags & SRE_FLAG_VERBOSE:
|
|
sre_parse.py(412): if this and this[0] not in SPECIAL_CHARS:
|
|
sre_parse.py(415): elif this == "[":
|
|
sre_parse.py(472): elif this and this[0] in REPEAT_CHARS:
|
|
sre_parse.py(525): elif this == ".":
|
|
sre_parse.py(528): elif this == "(":
|
|
sre_parse.py(660): elif this == "^":
|
|
sre_parse.py(663): elif this == "$":
|
|
sre_parse.py(666): elif this and this[0] == "\\":
|
|
sre_parse.py(667): code = _escape(source, this, state)
|
|
--- modulename: sre_parse, funcname: _escape
|
|
sre_parse.py(259): code = CATEGORIES.get(escape)
|
|
sre_parse.py(260): if code:
|
|
sre_parse.py(261): return code
|
|
sre_parse.py(668): subpatternappend(code)
|
|
--- modulename: sre_parse, funcname: append
|
|
sre_parse.py(139): self.data.append(code)
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(397): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(398): if this is None:
|
|
sre_parse.py(401): if state.flags & SRE_FLAG_VERBOSE:
|
|
sre_parse.py(412): if this and this[0] not in SPECIAL_CHARS:
|
|
sre_parse.py(415): elif this == "[":
|
|
sre_parse.py(472): elif this and this[0] in REPEAT_CHARS:
|
|
sre_parse.py(474): if this == "?":
|
|
sre_parse.py(476): elif this == "*":
|
|
sre_parse.py(477): min, max = 0, MAXREPEAT
|
|
sre_parse.py(512): if subpattern:
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
sre_parse.py(513): item = subpattern[-1:]
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(132): return SubPattern(self.pattern, self.data[index])
|
|
--- modulename: sre_parse, funcname: __init__
|
|
sre_parse.py(91): self.pattern = pattern
|
|
sre_parse.py(92): if data is None:
|
|
sre_parse.py(94): self.data = data
|
|
sre_parse.py(95): self.width = None
|
|
sre_parse.py(516): if not item or (_len(item) == 1 and item[0][0] == AT):
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_parse.py(518): if item[0][0] in REPEATCODES:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_parse.py(520): if sourcematch("?"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(523): subpattern[-1] = (MAX_REPEAT, (min, max, item))
|
|
--- modulename: sre_parse, funcname: __setitem__
|
|
sre_parse.py(135): self.data[index] = code
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(397): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(398): if this is None:
|
|
sre_parse.py(401): if state.flags & SRE_FLAG_VERBOSE:
|
|
sre_parse.py(412): if this and this[0] not in SPECIAL_CHARS:
|
|
sre_parse.py(415): elif this == "[":
|
|
sre_parse.py(472): elif this and this[0] in REPEAT_CHARS:
|
|
sre_parse.py(525): elif this == ".":
|
|
sre_parse.py(528): elif this == "(":
|
|
sre_parse.py(529): group = 1
|
|
sre_parse.py(530): name = None
|
|
sre_parse.py(531): condgroup = None
|
|
sre_parse.py(532): if sourcematch("?"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(197): if skip:
|
|
sre_parse.py(198): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(199): return 1
|
|
sre_parse.py(533): group = 0
|
|
sre_parse.py(535): if sourcematch("P"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(197): if skip:
|
|
sre_parse.py(198): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(199): return 1
|
|
sre_parse.py(537): if sourcematch("<"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(197): if skip:
|
|
sre_parse.py(198): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(199): return 1
|
|
sre_parse.py(539): name = ""
|
|
sre_parse.py(540): while 1:
|
|
sre_parse.py(541): char = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(542): if char is None:
|
|
sre_parse.py(544): if char == ">":
|
|
sre_parse.py(546): name = name + char
|
|
sre_parse.py(541): char = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(542): if char is None:
|
|
sre_parse.py(544): if char == ">":
|
|
sre_parse.py(546): name = name + char
|
|
sre_parse.py(541): char = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(542): if char is None:
|
|
sre_parse.py(544): if char == ">":
|
|
sre_parse.py(545): break
|
|
sre_parse.py(547): group = 1
|
|
sre_parse.py(548): if not name:
|
|
sre_parse.py(550): if not isname(name):
|
|
--- modulename: sre_parse, funcname: isname
|
|
sre_parse.py(218): if not isident(name[0]):
|
|
--- modulename: sre_parse, funcname: isident
|
|
sre_parse.py(211): return "a" <= char <= "z" or "A" <= char <= "Z" or char == "_"
|
|
sre_parse.py(220): for char in name[1:]:
|
|
sre_parse.py(221): if not isident(char) and not isdigit(char):
|
|
--- modulename: sre_parse, funcname: isident
|
|
sre_parse.py(211): return "a" <= char <= "z" or "A" <= char <= "Z" or char == "_"
|
|
sre_parse.py(220): for char in name[1:]:
|
|
sre_parse.py(223): return True
|
|
sre_parse.py(635): if group:
|
|
sre_parse.py(637): if group == 2:
|
|
sre_parse.py(641): group = state.opengroup(name)
|
|
--- modulename: sre_parse, funcname: opengroup
|
|
sre_parse.py(73): gid = self.groups
|
|
sre_parse.py(74): self.groups = gid + 1
|
|
sre_parse.py(75): if name is not None:
|
|
sre_parse.py(76): ogid = self.groupdict.get(name, None)
|
|
sre_parse.py(77): if ogid is not None:
|
|
sre_parse.py(80): self.groupdict[name] = gid
|
|
sre_parse.py(81): self.open.append(gid)
|
|
sre_parse.py(82): return gid
|
|
sre_parse.py(642): if condgroup:
|
|
sre_parse.py(645): p = _parse_sub(source, state)
|
|
--- modulename: sre_parse, funcname: _parse_sub
|
|
sre_parse.py(304): items = []
|
|
sre_parse.py(305): itemsappend = items.append
|
|
sre_parse.py(306): sourcematch = source.match
|
|
sre_parse.py(307): while 1:
|
|
sre_parse.py(308): itemsappend(_parse(source, state))
|
|
--- modulename: sre_parse, funcname: _parse
|
|
sre_parse.py(381): subpattern = SubPattern(state)
|
|
--- modulename: sre_parse, funcname: __init__
|
|
sre_parse.py(91): self.pattern = pattern
|
|
sre_parse.py(92): if data is None:
|
|
sre_parse.py(93): data = []
|
|
sre_parse.py(94): self.data = data
|
|
sre_parse.py(95): self.width = None
|
|
sre_parse.py(384): subpatternappend = subpattern.append
|
|
sre_parse.py(385): sourceget = source.get
|
|
sre_parse.py(386): sourcematch = source.match
|
|
sre_parse.py(387): _len = len
|
|
sre_parse.py(388): PATTERNENDERS = _PATTERNENDERS
|
|
sre_parse.py(389): ASSERTCHARS = _ASSERTCHARS
|
|
sre_parse.py(390): LOOKBEHINDASSERTCHARS = _LOOKBEHINDASSERTCHARS
|
|
sre_parse.py(391): REPEATCODES = _REPEATCODES
|
|
sre_parse.py(393): while 1:
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(397): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(398): if this is None:
|
|
sre_parse.py(401): if state.flags & SRE_FLAG_VERBOSE:
|
|
sre_parse.py(412): if this and this[0] not in SPECIAL_CHARS:
|
|
sre_parse.py(415): elif this == "[":
|
|
sre_parse.py(417): set = []
|
|
sre_parse.py(418): setappend = set.append
|
|
sre_parse.py(421): if sourcematch("^"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(424): start = set[:]
|
|
sre_parse.py(425): while 1:
|
|
sre_parse.py(426): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(427): if this == "]" and set != start:
|
|
sre_parse.py(429): elif this and this[0] == "\\":
|
|
sre_parse.py(431): elif this:
|
|
sre_parse.py(432): code1 = LITERAL, ord(this)
|
|
sre_parse.py(435): if sourcematch("-"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(459): if code1[0] is IN:
|
|
sre_parse.py(461): setappend(code1)
|
|
sre_parse.py(426): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(427): if this == "]" and set != start:
|
|
sre_parse.py(429): elif this and this[0] == "\\":
|
|
sre_parse.py(431): elif this:
|
|
sre_parse.py(432): code1 = LITERAL, ord(this)
|
|
sre_parse.py(435): if sourcematch("-"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(459): if code1[0] is IN:
|
|
sre_parse.py(461): setappend(code1)
|
|
sre_parse.py(426): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(427): if this == "]" and set != start:
|
|
sre_parse.py(428): break
|
|
sre_parse.py(464): if _len(set)==1 and set[0][0] is LITERAL:
|
|
sre_parse.py(466): elif _len(set)==2 and set[0][0] is NEGATE and set[1][0] is LITERAL:
|
|
sre_parse.py(470): subpatternappend((IN, set))
|
|
--- modulename: sre_parse, funcname: append
|
|
sre_parse.py(139): self.data.append(code)
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(396): break # end of subpattern
|
|
sre_parse.py(673): return subpattern
|
|
sre_parse.py(309): if sourcematch("|"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(311): if not nested:
|
|
sre_parse.py(313): if not source.next or sourcematch(")", 0):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(197): if skip:
|
|
sre_parse.py(199): return 1
|
|
sre_parse.py(314): break
|
|
sre_parse.py(318): if len(items) == 1:
|
|
sre_parse.py(319): return items[0]
|
|
sre_parse.py(646): if not sourcematch(")"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(197): if skip:
|
|
sre_parse.py(198): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(188): try:
|
|
sre_parse.py(189): c = self.string[self.index + 1]
|
|
sre_parse.py(192): char = char + c
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(199): return 1
|
|
sre_parse.py(648): if group is not None:
|
|
sre_parse.py(649): state.closegroup(group)
|
|
--- modulename: sre_parse, funcname: closegroup
|
|
sre_parse.py(84): self.open.remove(gid)
|
|
sre_parse.py(650): subpatternappend((SUBPATTERN, (group, p)))
|
|
--- modulename: sre_parse, funcname: append
|
|
sre_parse.py(139): self.data.append(code)
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(397): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(398): if this is None:
|
|
sre_parse.py(401): if state.flags & SRE_FLAG_VERBOSE:
|
|
sre_parse.py(412): if this and this[0] not in SPECIAL_CHARS:
|
|
sre_parse.py(415): elif this == "[":
|
|
sre_parse.py(472): elif this and this[0] in REPEAT_CHARS:
|
|
sre_parse.py(525): elif this == ".":
|
|
sre_parse.py(528): elif this == "(":
|
|
sre_parse.py(660): elif this == "^":
|
|
sre_parse.py(663): elif this == "$":
|
|
sre_parse.py(666): elif this and this[0] == "\\":
|
|
sre_parse.py(667): code = _escape(source, this, state)
|
|
--- modulename: sre_parse, funcname: _escape
|
|
sre_parse.py(259): code = CATEGORIES.get(escape)
|
|
sre_parse.py(260): if code:
|
|
sre_parse.py(261): return code
|
|
sre_parse.py(668): subpatternappend(code)
|
|
--- modulename: sre_parse, funcname: append
|
|
sre_parse.py(139): self.data.append(code)
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(397): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(398): if this is None:
|
|
sre_parse.py(401): if state.flags & SRE_FLAG_VERBOSE:
|
|
sre_parse.py(412): if this and this[0] not in SPECIAL_CHARS:
|
|
sre_parse.py(415): elif this == "[":
|
|
sre_parse.py(472): elif this and this[0] in REPEAT_CHARS:
|
|
sre_parse.py(474): if this == "?":
|
|
sre_parse.py(476): elif this == "*":
|
|
sre_parse.py(477): min, max = 0, MAXREPEAT
|
|
sre_parse.py(512): if subpattern:
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
sre_parse.py(513): item = subpattern[-1:]
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(132): return SubPattern(self.pattern, self.data[index])
|
|
--- modulename: sre_parse, funcname: __init__
|
|
sre_parse.py(91): self.pattern = pattern
|
|
sre_parse.py(92): if data is None:
|
|
sre_parse.py(94): self.data = data
|
|
sre_parse.py(95): self.width = None
|
|
sre_parse.py(516): if not item or (_len(item) == 1 and item[0][0] == AT):
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_parse.py(518): if item[0][0] in REPEATCODES:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_parse.py(520): if sourcematch("?"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(523): subpattern[-1] = (MAX_REPEAT, (min, max, item))
|
|
--- modulename: sre_parse, funcname: __setitem__
|
|
sre_parse.py(135): self.data[index] = code
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(397): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(398): if this is None:
|
|
sre_parse.py(401): if state.flags & SRE_FLAG_VERBOSE:
|
|
sre_parse.py(412): if this and this[0] not in SPECIAL_CHARS:
|
|
sre_parse.py(415): elif this == "[":
|
|
sre_parse.py(472): elif this and this[0] in REPEAT_CHARS:
|
|
sre_parse.py(525): elif this == ".":
|
|
sre_parse.py(528): elif this == "(":
|
|
sre_parse.py(529): group = 1
|
|
sre_parse.py(530): name = None
|
|
sre_parse.py(531): condgroup = None
|
|
sre_parse.py(532): if sourcematch("?"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(197): if skip:
|
|
sre_parse.py(198): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(199): return 1
|
|
sre_parse.py(533): group = 0
|
|
sre_parse.py(535): if sourcematch("P"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(197): if skip:
|
|
sre_parse.py(198): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(199): return 1
|
|
sre_parse.py(537): if sourcematch("<"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(197): if skip:
|
|
sre_parse.py(198): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(199): return 1
|
|
sre_parse.py(539): name = ""
|
|
sre_parse.py(540): while 1:
|
|
sre_parse.py(541): char = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(542): if char is None:
|
|
sre_parse.py(544): if char == ">":
|
|
sre_parse.py(546): name = name + char
|
|
sre_parse.py(541): char = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(542): if char is None:
|
|
sre_parse.py(544): if char == ">":
|
|
sre_parse.py(546): name = name + char
|
|
sre_parse.py(541): char = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(542): if char is None:
|
|
sre_parse.py(544): if char == ">":
|
|
sre_parse.py(546): name = name + char
|
|
sre_parse.py(541): char = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(542): if char is None:
|
|
sre_parse.py(544): if char == ">":
|
|
sre_parse.py(546): name = name + char
|
|
sre_parse.py(541): char = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(542): if char is None:
|
|
sre_parse.py(544): if char == ">":
|
|
sre_parse.py(546): name = name + char
|
|
sre_parse.py(541): char = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(542): if char is None:
|
|
sre_parse.py(544): if char == ">":
|
|
sre_parse.py(545): break
|
|
sre_parse.py(547): group = 1
|
|
sre_parse.py(548): if not name:
|
|
sre_parse.py(550): if not isname(name):
|
|
--- modulename: sre_parse, funcname: isname
|
|
sre_parse.py(218): if not isident(name[0]):
|
|
--- modulename: sre_parse, funcname: isident
|
|
sre_parse.py(211): return "a" <= char <= "z" or "A" <= char <= "Z" or char == "_"
|
|
sre_parse.py(220): for char in name[1:]:
|
|
sre_parse.py(221): if not isident(char) and not isdigit(char):
|
|
--- modulename: sre_parse, funcname: isident
|
|
sre_parse.py(211): return "a" <= char <= "z" or "A" <= char <= "Z" or char == "_"
|
|
sre_parse.py(220): for char in name[1:]:
|
|
sre_parse.py(221): if not isident(char) and not isdigit(char):
|
|
--- modulename: sre_parse, funcname: isident
|
|
sre_parse.py(211): return "a" <= char <= "z" or "A" <= char <= "Z" or char == "_"
|
|
sre_parse.py(220): for char in name[1:]:
|
|
sre_parse.py(221): if not isident(char) and not isdigit(char):
|
|
--- modulename: sre_parse, funcname: isident
|
|
sre_parse.py(211): return "a" <= char <= "z" or "A" <= char <= "Z" or char == "_"
|
|
sre_parse.py(220): for char in name[1:]:
|
|
sre_parse.py(221): if not isident(char) and not isdigit(char):
|
|
--- modulename: sre_parse, funcname: isident
|
|
sre_parse.py(211): return "a" <= char <= "z" or "A" <= char <= "Z" or char == "_"
|
|
sre_parse.py(220): for char in name[1:]:
|
|
sre_parse.py(223): return True
|
|
sre_parse.py(635): if group:
|
|
sre_parse.py(637): if group == 2:
|
|
sre_parse.py(641): group = state.opengroup(name)
|
|
--- modulename: sre_parse, funcname: opengroup
|
|
sre_parse.py(73): gid = self.groups
|
|
sre_parse.py(74): self.groups = gid + 1
|
|
sre_parse.py(75): if name is not None:
|
|
sre_parse.py(76): ogid = self.groupdict.get(name, None)
|
|
sre_parse.py(77): if ogid is not None:
|
|
sre_parse.py(80): self.groupdict[name] = gid
|
|
sre_parse.py(81): self.open.append(gid)
|
|
sre_parse.py(82): return gid
|
|
sre_parse.py(642): if condgroup:
|
|
sre_parse.py(645): p = _parse_sub(source, state)
|
|
--- modulename: sre_parse, funcname: _parse_sub
|
|
sre_parse.py(304): items = []
|
|
sre_parse.py(305): itemsappend = items.append
|
|
sre_parse.py(306): sourcematch = source.match
|
|
sre_parse.py(307): while 1:
|
|
sre_parse.py(308): itemsappend(_parse(source, state))
|
|
--- modulename: sre_parse, funcname: _parse
|
|
sre_parse.py(381): subpattern = SubPattern(state)
|
|
--- modulename: sre_parse, funcname: __init__
|
|
sre_parse.py(91): self.pattern = pattern
|
|
sre_parse.py(92): if data is None:
|
|
sre_parse.py(93): data = []
|
|
sre_parse.py(94): self.data = data
|
|
sre_parse.py(95): self.width = None
|
|
sre_parse.py(384): subpatternappend = subpattern.append
|
|
sre_parse.py(385): sourceget = source.get
|
|
sre_parse.py(386): sourcematch = source.match
|
|
sre_parse.py(387): _len = len
|
|
sre_parse.py(388): PATTERNENDERS = _PATTERNENDERS
|
|
sre_parse.py(389): ASSERTCHARS = _ASSERTCHARS
|
|
sre_parse.py(390): LOOKBEHINDASSERTCHARS = _LOOKBEHINDASSERTCHARS
|
|
sre_parse.py(391): REPEATCODES = _REPEATCODES
|
|
sre_parse.py(393): while 1:
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(397): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(398): if this is None:
|
|
sre_parse.py(401): if state.flags & SRE_FLAG_VERBOSE:
|
|
sre_parse.py(412): if this and this[0] not in SPECIAL_CHARS:
|
|
sre_parse.py(415): elif this == "[":
|
|
sre_parse.py(472): elif this and this[0] in REPEAT_CHARS:
|
|
sre_parse.py(525): elif this == ".":
|
|
sre_parse.py(526): subpatternappend((ANY, None))
|
|
--- modulename: sre_parse, funcname: append
|
|
sre_parse.py(139): self.data.append(code)
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(397): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(398): if this is None:
|
|
sre_parse.py(401): if state.flags & SRE_FLAG_VERBOSE:
|
|
sre_parse.py(412): if this and this[0] not in SPECIAL_CHARS:
|
|
sre_parse.py(415): elif this == "[":
|
|
sre_parse.py(472): elif this and this[0] in REPEAT_CHARS:
|
|
sre_parse.py(474): if this == "?":
|
|
sre_parse.py(476): elif this == "*":
|
|
sre_parse.py(477): min, max = 0, MAXREPEAT
|
|
sre_parse.py(512): if subpattern:
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
sre_parse.py(513): item = subpattern[-1:]
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(132): return SubPattern(self.pattern, self.data[index])
|
|
--- modulename: sre_parse, funcname: __init__
|
|
sre_parse.py(91): self.pattern = pattern
|
|
sre_parse.py(92): if data is None:
|
|
sre_parse.py(94): self.data = data
|
|
sre_parse.py(95): self.width = None
|
|
sre_parse.py(516): if not item or (_len(item) == 1 and item[0][0] == AT):
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_parse.py(518): if item[0][0] in REPEATCODES:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_parse.py(520): if sourcematch("?"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(523): subpattern[-1] = (MAX_REPEAT, (min, max, item))
|
|
--- modulename: sre_parse, funcname: __setitem__
|
|
sre_parse.py(135): self.data[index] = code
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(396): break # end of subpattern
|
|
sre_parse.py(673): return subpattern
|
|
sre_parse.py(309): if sourcematch("|"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(311): if not nested:
|
|
sre_parse.py(313): if not source.next or sourcematch(")", 0):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(197): if skip:
|
|
sre_parse.py(199): return 1
|
|
sre_parse.py(314): break
|
|
sre_parse.py(318): if len(items) == 1:
|
|
sre_parse.py(319): return items[0]
|
|
sre_parse.py(646): if not sourcematch(")"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(197): if skip:
|
|
sre_parse.py(198): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(199): return 1
|
|
sre_parse.py(648): if group is not None:
|
|
sre_parse.py(649): state.closegroup(group)
|
|
--- modulename: sre_parse, funcname: closegroup
|
|
sre_parse.py(84): self.open.remove(gid)
|
|
sre_parse.py(650): subpatternappend((SUBPATTERN, (group, p)))
|
|
--- modulename: sre_parse, funcname: append
|
|
sre_parse.py(139): self.data.append(code)
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(397): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(184): self.next = None
|
|
sre_parse.py(185): return
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(398): if this is None:
|
|
sre_parse.py(401): if state.flags & SRE_FLAG_VERBOSE:
|
|
sre_parse.py(412): if this and this[0] not in SPECIAL_CHARS:
|
|
sre_parse.py(415): elif this == "[":
|
|
sre_parse.py(472): elif this and this[0] in REPEAT_CHARS:
|
|
sre_parse.py(525): elif this == ".":
|
|
sre_parse.py(528): elif this == "(":
|
|
sre_parse.py(660): elif this == "^":
|
|
sre_parse.py(663): elif this == "$":
|
|
sre_parse.py(664): subpattern.append((AT, AT_END))
|
|
--- modulename: sre_parse, funcname: append
|
|
sre_parse.py(139): self.data.append(code)
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(397): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(184): self.next = None
|
|
sre_parse.py(185): return
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(398): if this is None:
|
|
sre_parse.py(399): break # end of pattern
|
|
sre_parse.py(673): return subpattern
|
|
sre_parse.py(309): if sourcematch("|"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(311): if not nested:
|
|
sre_parse.py(312): break
|
|
sre_parse.py(318): if len(items) == 1:
|
|
sre_parse.py(319): return items[0]
|
|
sre_parse.py(687): tail = source.get()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(184): self.next = None
|
|
sre_parse.py(185): return
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(688): if tail == ")":
|
|
sre_parse.py(690): elif tail:
|
|
sre_parse.py(693): if flags & SRE_FLAG_DEBUG:
|
|
sre_parse.py(696): if not (flags & SRE_FLAG_VERBOSE) and p.pattern.flags & SRE_FLAG_VERBOSE:
|
|
sre_parse.py(701): return p
|
|
sre_compile.py(502): code = _code(p, flags)
|
|
--- modulename: sre_compile, funcname: _code
|
|
sre_compile.py(480): flags = p.pattern.flags | flags
|
|
sre_compile.py(481): code = []
|
|
sre_compile.py(484): _compile_info(code, p, flags)
|
|
--- modulename: sre_compile, funcname: _compile_info
|
|
sre_compile.py(363): lo, hi = pattern.getwidth()
|
|
--- modulename: sre_parse, funcname: getwidth
|
|
sre_parse.py(142): if self.width:
|
|
sre_parse.py(144): lo = hi = 0
|
|
sre_parse.py(145): UNITCODES = (ANY, RANGE, IN, LITERAL, NOT_LITERAL, CATEGORY)
|
|
sre_parse.py(146): REPEATCODES = (MIN_REPEAT, MAX_REPEAT)
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(148): if op is BRANCH:
|
|
sre_parse.py(157): elif op is CALL:
|
|
sre_parse.py(161): elif op is SUBPATTERN:
|
|
sre_parse.py(162): i, j = av[1].getwidth()
|
|
--- modulename: sre_parse, funcname: getwidth
|
|
sre_parse.py(142): if self.width:
|
|
sre_parse.py(144): lo = hi = 0
|
|
sre_parse.py(145): UNITCODES = (ANY, RANGE, IN, LITERAL, NOT_LITERAL, CATEGORY)
|
|
sre_parse.py(146): REPEATCODES = (MIN_REPEAT, MAX_REPEAT)
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(148): if op is BRANCH:
|
|
sre_parse.py(157): elif op is CALL:
|
|
sre_parse.py(161): elif op is SUBPATTERN:
|
|
sre_parse.py(165): elif op in REPEATCODES:
|
|
sre_parse.py(169): elif op in UNITCODES:
|
|
sre_parse.py(170): lo = lo + 1
|
|
sre_parse.py(171): hi = hi + 1
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(148): if op is BRANCH:
|
|
sre_parse.py(157): elif op is CALL:
|
|
sre_parse.py(161): elif op is SUBPATTERN:
|
|
sre_parse.py(165): elif op in REPEATCODES:
|
|
sre_parse.py(166): i, j = av[2].getwidth()
|
|
--- modulename: sre_parse, funcname: getwidth
|
|
sre_parse.py(142): if self.width:
|
|
sre_parse.py(144): lo = hi = 0
|
|
sre_parse.py(145): UNITCODES = (ANY, RANGE, IN, LITERAL, NOT_LITERAL, CATEGORY)
|
|
sre_parse.py(146): REPEATCODES = (MIN_REPEAT, MAX_REPEAT)
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(148): if op is BRANCH:
|
|
sre_parse.py(157): elif op is CALL:
|
|
sre_parse.py(161): elif op is SUBPATTERN:
|
|
sre_parse.py(165): elif op in REPEATCODES:
|
|
sre_parse.py(169): elif op in UNITCODES:
|
|
sre_parse.py(170): lo = lo + 1
|
|
sre_parse.py(171): hi = hi + 1
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(174): self.width = min(lo, MAXREPEAT - 1), min(hi, MAXREPEAT)
|
|
sre_parse.py(175): return self.width
|
|
sre_parse.py(167): lo = lo + i * av[0]
|
|
sre_parse.py(168): hi = hi + j * av[1]
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(174): self.width = min(lo, MAXREPEAT - 1), min(hi, MAXREPEAT)
|
|
sre_parse.py(175): return self.width
|
|
sre_parse.py(163): lo = lo + i
|
|
sre_parse.py(164): hi = hi + j
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(148): if op is BRANCH:
|
|
sre_parse.py(157): elif op is CALL:
|
|
sre_parse.py(161): elif op is SUBPATTERN:
|
|
sre_parse.py(165): elif op in REPEATCODES:
|
|
sre_parse.py(166): i, j = av[2].getwidth()
|
|
--- modulename: sre_parse, funcname: getwidth
|
|
sre_parse.py(142): if self.width:
|
|
sre_parse.py(144): lo = hi = 0
|
|
sre_parse.py(145): UNITCODES = (ANY, RANGE, IN, LITERAL, NOT_LITERAL, CATEGORY)
|
|
sre_parse.py(146): REPEATCODES = (MIN_REPEAT, MAX_REPEAT)
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(148): if op is BRANCH:
|
|
sre_parse.py(157): elif op is CALL:
|
|
sre_parse.py(161): elif op is SUBPATTERN:
|
|
sre_parse.py(165): elif op in REPEATCODES:
|
|
sre_parse.py(169): elif op in UNITCODES:
|
|
sre_parse.py(170): lo = lo + 1
|
|
sre_parse.py(171): hi = hi + 1
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(174): self.width = min(lo, MAXREPEAT - 1), min(hi, MAXREPEAT)
|
|
sre_parse.py(175): return self.width
|
|
sre_parse.py(167): lo = lo + i * av[0]
|
|
sre_parse.py(168): hi = hi + j * av[1]
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(148): if op is BRANCH:
|
|
sre_parse.py(157): elif op is CALL:
|
|
sre_parse.py(161): elif op is SUBPATTERN:
|
|
sre_parse.py(162): i, j = av[1].getwidth()
|
|
--- modulename: sre_parse, funcname: getwidth
|
|
sre_parse.py(142): if self.width:
|
|
sre_parse.py(144): lo = hi = 0
|
|
sre_parse.py(145): UNITCODES = (ANY, RANGE, IN, LITERAL, NOT_LITERAL, CATEGORY)
|
|
sre_parse.py(146): REPEATCODES = (MIN_REPEAT, MAX_REPEAT)
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(148): if op is BRANCH:
|
|
sre_parse.py(157): elif op is CALL:
|
|
sre_parse.py(161): elif op is SUBPATTERN:
|
|
sre_parse.py(165): elif op in REPEATCODES:
|
|
sre_parse.py(169): elif op in UNITCODES:
|
|
sre_parse.py(170): lo = lo + 1
|
|
sre_parse.py(171): hi = hi + 1
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(174): self.width = min(lo, MAXREPEAT - 1), min(hi, MAXREPEAT)
|
|
sre_parse.py(175): return self.width
|
|
sre_parse.py(163): lo = lo + i
|
|
sre_parse.py(164): hi = hi + j
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(148): if op is BRANCH:
|
|
sre_parse.py(157): elif op is CALL:
|
|
sre_parse.py(161): elif op is SUBPATTERN:
|
|
sre_parse.py(165): elif op in REPEATCODES:
|
|
sre_parse.py(166): i, j = av[2].getwidth()
|
|
--- modulename: sre_parse, funcname: getwidth
|
|
sre_parse.py(142): if self.width:
|
|
sre_parse.py(144): lo = hi = 0
|
|
sre_parse.py(145): UNITCODES = (ANY, RANGE, IN, LITERAL, NOT_LITERAL, CATEGORY)
|
|
sre_parse.py(146): REPEATCODES = (MIN_REPEAT, MAX_REPEAT)
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(148): if op is BRANCH:
|
|
sre_parse.py(157): elif op is CALL:
|
|
sre_parse.py(161): elif op is SUBPATTERN:
|
|
sre_parse.py(165): elif op in REPEATCODES:
|
|
sre_parse.py(169): elif op in UNITCODES:
|
|
sre_parse.py(170): lo = lo + 1
|
|
sre_parse.py(171): hi = hi + 1
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(174): self.width = min(lo, MAXREPEAT - 1), min(hi, MAXREPEAT)
|
|
sre_parse.py(175): return self.width
|
|
sre_parse.py(167): lo = lo + i * av[0]
|
|
sre_parse.py(168): hi = hi + j * av[1]
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(148): if op is BRANCH:
|
|
sre_parse.py(157): elif op is CALL:
|
|
sre_parse.py(161): elif op is SUBPATTERN:
|
|
sre_parse.py(162): i, j = av[1].getwidth()
|
|
--- modulename: sre_parse, funcname: getwidth
|
|
sre_parse.py(142): if self.width:
|
|
sre_parse.py(144): lo = hi = 0
|
|
sre_parse.py(145): UNITCODES = (ANY, RANGE, IN, LITERAL, NOT_LITERAL, CATEGORY)
|
|
sre_parse.py(146): REPEATCODES = (MIN_REPEAT, MAX_REPEAT)
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(148): if op is BRANCH:
|
|
sre_parse.py(157): elif op is CALL:
|
|
sre_parse.py(161): elif op is SUBPATTERN:
|
|
sre_parse.py(165): elif op in REPEATCODES:
|
|
sre_parse.py(166): i, j = av[2].getwidth()
|
|
--- modulename: sre_parse, funcname: getwidth
|
|
sre_parse.py(142): if self.width:
|
|
sre_parse.py(144): lo = hi = 0
|
|
sre_parse.py(145): UNITCODES = (ANY, RANGE, IN, LITERAL, NOT_LITERAL, CATEGORY)
|
|
sre_parse.py(146): REPEATCODES = (MIN_REPEAT, MAX_REPEAT)
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(148): if op is BRANCH:
|
|
sre_parse.py(157): elif op is CALL:
|
|
sre_parse.py(161): elif op is SUBPATTERN:
|
|
sre_parse.py(165): elif op in REPEATCODES:
|
|
sre_parse.py(169): elif op in UNITCODES:
|
|
sre_parse.py(170): lo = lo + 1
|
|
sre_parse.py(171): hi = hi + 1
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(174): self.width = min(lo, MAXREPEAT - 1), min(hi, MAXREPEAT)
|
|
sre_parse.py(175): return self.width
|
|
sre_parse.py(167): lo = lo + i * av[0]
|
|
sre_parse.py(168): hi = hi + j * av[1]
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(174): self.width = min(lo, MAXREPEAT - 1), min(hi, MAXREPEAT)
|
|
sre_parse.py(175): return self.width
|
|
sre_parse.py(163): lo = lo + i
|
|
sre_parse.py(164): hi = hi + j
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(148): if op is BRANCH:
|
|
sre_parse.py(157): elif op is CALL:
|
|
sre_parse.py(161): elif op is SUBPATTERN:
|
|
sre_parse.py(165): elif op in REPEATCODES:
|
|
sre_parse.py(169): elif op in UNITCODES:
|
|
sre_parse.py(172): elif op == SUCCESS:
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(174): self.width = min(lo, MAXREPEAT - 1), min(hi, MAXREPEAT)
|
|
sre_parse.py(175): return self.width
|
|
sre_compile.py(364): if lo == 0:
|
|
sre_compile.py(367): prefix = []
|
|
sre_compile.py(368): prefixappend = prefix.append
|
|
sre_compile.py(369): prefix_skip = 0
|
|
sre_compile.py(370): charset = [] # not used
|
|
sre_compile.py(371): charsetappend = charset.append
|
|
sre_compile.py(372): if not (flags & SRE_FLAG_IGNORECASE):
|
|
sre_compile.py(374): for op, av in pattern.data:
|
|
sre_compile.py(375): if op is LITERAL:
|
|
sre_compile.py(379): elif op is SUBPATTERN and len(av[1]) == 1:
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
sre_compile.py(386): break
|
|
sre_compile.py(388): if not prefix and pattern.data:
|
|
sre_compile.py(389): op, av = pattern.data[0]
|
|
sre_compile.py(390): if op is SUBPATTERN and av[1]:
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
sre_compile.py(391): op, av = av[1][0]
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(392): if op is LITERAL:
|
|
sre_compile.py(394): elif op is BRANCH:
|
|
sre_compile.py(427): emit = code.append
|
|
sre_compile.py(428): emit(OPCODES[INFO])
|
|
sre_compile.py(429): skip = len(code); emit(0)
|
|
sre_compile.py(431): mask = 0
|
|
sre_compile.py(432): if prefix:
|
|
sre_compile.py(436): elif charset:
|
|
sre_compile.py(438): emit(mask)
|
|
sre_compile.py(440): if lo < MAXCODE:
|
|
sre_compile.py(441): emit(lo)
|
|
sre_compile.py(445): if hi < MAXCODE:
|
|
sre_compile.py(448): emit(0)
|
|
sre_compile.py(450): if prefix:
|
|
sre_compile.py(461): elif charset:
|
|
sre_compile.py(463): code[skip] = len(code) - skip
|
|
sre_compile.py(487): _compile(code, p.data, flags)
|
|
--- modulename: sre_compile, funcname: _compile
|
|
sre_compile.py(34): emit = code.append
|
|
sre_compile.py(35): _len = len
|
|
sre_compile.py(36): LITERAL_CODES = _LITERAL_CODES
|
|
sre_compile.py(37): REPEATING_CODES = _REPEATING_CODES
|
|
sre_compile.py(38): SUCCESS_CODES = _SUCCESS_CODES
|
|
sre_compile.py(39): ASSERT_CODES = _ASSERT_CODES
|
|
sre_compile.py(40): for op, av in pattern:
|
|
sre_compile.py(41): if op in LITERAL_CODES:
|
|
sre_compile.py(48): elif op is IN:
|
|
sre_compile.py(59): elif op is ANY:
|
|
sre_compile.py(64): elif op in REPEATING_CODES:
|
|
sre_compile.py(96): elif op is SUBPATTERN:
|
|
sre_compile.py(97): if av[0]:
|
|
sre_compile.py(98): emit(OPCODES[MARK])
|
|
sre_compile.py(99): emit((av[0]-1)*2)
|
|
sre_compile.py(101): _compile(code, av[1], flags)
|
|
--- modulename: sre_compile, funcname: _compile
|
|
sre_compile.py(34): emit = code.append
|
|
sre_compile.py(35): _len = len
|
|
sre_compile.py(36): LITERAL_CODES = _LITERAL_CODES
|
|
sre_compile.py(37): REPEATING_CODES = _REPEATING_CODES
|
|
sre_compile.py(38): SUCCESS_CODES = _SUCCESS_CODES
|
|
sre_compile.py(39): ASSERT_CODES = _ASSERT_CODES
|
|
sre_compile.py(40): for op, av in pattern:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(41): if op in LITERAL_CODES:
|
|
sre_compile.py(48): elif op is IN:
|
|
sre_compile.py(49): if flags & SRE_FLAG_IGNORECASE:
|
|
sre_compile.py(54): emit(OPCODES[op])
|
|
sre_compile.py(55): fixup = _identityfunction
|
|
sre_compile.py(56): skip = _len(code); emit(0)
|
|
sre_compile.py(57): _compile_charset(av, flags, code, fixup)
|
|
--- modulename: sre_compile, funcname: _compile_charset
|
|
sre_compile.py(180): emit = code.append
|
|
sre_compile.py(181): if fixup is None:
|
|
sre_compile.py(183): for op, av in _optimize_charset(charset, fixup):
|
|
--- modulename: sre_compile, funcname: _optimize_charset
|
|
sre_compile.py(209): out = []
|
|
sre_compile.py(210): outappend = out.append
|
|
sre_compile.py(211): charmap = [0]*256
|
|
sre_compile.py(212): try:
|
|
sre_compile.py(213): for op, av in charset:
|
|
sre_compile.py(214): if op is NEGATE:
|
|
sre_compile.py(215): outappend((op, av))
|
|
sre_compile.py(213): for op, av in charset:
|
|
sre_compile.py(214): if op is NEGATE:
|
|
sre_compile.py(216): elif op is LITERAL:
|
|
sre_compile.py(217): charmap[fixup(av)] = 1
|
|
--- modulename: sre_compile, funcname: _identityfunction
|
|
sre_compile.py(25): return x
|
|
sre_compile.py(213): for op, av in charset:
|
|
sre_compile.py(214): if op is NEGATE:
|
|
sre_compile.py(216): elif op is LITERAL:
|
|
sre_compile.py(217): charmap[fixup(av)] = 1
|
|
--- modulename: sre_compile, funcname: _identityfunction
|
|
sre_compile.py(25): return x
|
|
sre_compile.py(213): for op, av in charset:
|
|
sre_compile.py(214): if op is NEGATE:
|
|
sre_compile.py(216): elif op is LITERAL:
|
|
sre_compile.py(218): elif op is RANGE:
|
|
sre_compile.py(221): elif op is CATEGORY:
|
|
sre_compile.py(223): return charset # cannot compress
|
|
sre_compile.py(184): emit(OPCODES[op])
|
|
sre_compile.py(185): if op is NEGATE:
|
|
sre_compile.py(186): pass
|
|
sre_compile.py(183): for op, av in _optimize_charset(charset, fixup):
|
|
sre_compile.py(184): emit(OPCODES[op])
|
|
sre_compile.py(185): if op is NEGATE:
|
|
sre_compile.py(187): elif op is LITERAL:
|
|
sre_compile.py(188): emit(fixup(av))
|
|
--- modulename: sre_compile, funcname: _identityfunction
|
|
sre_compile.py(25): return x
|
|
sre_compile.py(183): for op, av in _optimize_charset(charset, fixup):
|
|
sre_compile.py(184): emit(OPCODES[op])
|
|
sre_compile.py(185): if op is NEGATE:
|
|
sre_compile.py(187): elif op is LITERAL:
|
|
sre_compile.py(188): emit(fixup(av))
|
|
--- modulename: sre_compile, funcname: _identityfunction
|
|
sre_compile.py(25): return x
|
|
sre_compile.py(183): for op, av in _optimize_charset(charset, fixup):
|
|
sre_compile.py(184): emit(OPCODES[op])
|
|
sre_compile.py(185): if op is NEGATE:
|
|
sre_compile.py(187): elif op is LITERAL:
|
|
sre_compile.py(189): elif op is RANGE:
|
|
sre_compile.py(192): elif op is CHARSET:
|
|
sre_compile.py(194): elif op is BIGCHARSET:
|
|
sre_compile.py(196): elif op is CATEGORY:
|
|
sre_compile.py(197): if flags & SRE_FLAG_LOCALE:
|
|
sre_compile.py(199): elif flags & SRE_FLAG_UNICODE:
|
|
sre_compile.py(202): emit(CHCODES[av])
|
|
sre_compile.py(183): for op, av in _optimize_charset(charset, fixup):
|
|
sre_compile.py(205): emit(OPCODES[FAILURE])
|
|
sre_compile.py(58): code[skip] = _len(code) - skip
|
|
sre_compile.py(40): for op, av in pattern:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(41): if op in LITERAL_CODES:
|
|
sre_compile.py(48): elif op is IN:
|
|
sre_compile.py(59): elif op is ANY:
|
|
sre_compile.py(64): elif op in REPEATING_CODES:
|
|
sre_compile.py(65): if flags & SRE_FLAG_TEMPLATE:
|
|
sre_compile.py(74): elif _simple(av) and op is not REPEAT:
|
|
--- modulename: sre_compile, funcname: _simple
|
|
sre_compile.py(356): lo, hi = av[2].getwidth()
|
|
--- modulename: sre_parse, funcname: getwidth
|
|
sre_parse.py(142): if self.width:
|
|
sre_parse.py(143): return self.width
|
|
sre_compile.py(357): return lo == hi == 1 and av[2][0][0] != SUBPATTERN
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(75): if op is MAX_REPEAT:
|
|
sre_compile.py(76): emit(OPCODES[REPEAT_ONE])
|
|
sre_compile.py(79): skip = _len(code); emit(0)
|
|
sre_compile.py(80): emit(av[0])
|
|
sre_compile.py(81): emit(av[1])
|
|
sre_compile.py(82): _compile(code, av[2], flags)
|
|
--- modulename: sre_compile, funcname: _compile
|
|
sre_compile.py(34): emit = code.append
|
|
sre_compile.py(35): _len = len
|
|
sre_compile.py(36): LITERAL_CODES = _LITERAL_CODES
|
|
sre_compile.py(37): REPEATING_CODES = _REPEATING_CODES
|
|
sre_compile.py(38): SUCCESS_CODES = _SUCCESS_CODES
|
|
sre_compile.py(39): ASSERT_CODES = _ASSERT_CODES
|
|
sre_compile.py(40): for op, av in pattern:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(41): if op in LITERAL_CODES:
|
|
sre_compile.py(48): elif op is IN:
|
|
sre_compile.py(49): if flags & SRE_FLAG_IGNORECASE:
|
|
sre_compile.py(54): emit(OPCODES[op])
|
|
sre_compile.py(55): fixup = _identityfunction
|
|
sre_compile.py(56): skip = _len(code); emit(0)
|
|
sre_compile.py(57): _compile_charset(av, flags, code, fixup)
|
|
--- modulename: sre_compile, funcname: _compile_charset
|
|
sre_compile.py(180): emit = code.append
|
|
sre_compile.py(181): if fixup is None:
|
|
sre_compile.py(183): for op, av in _optimize_charset(charset, fixup):
|
|
--- modulename: sre_compile, funcname: _optimize_charset
|
|
sre_compile.py(209): out = []
|
|
sre_compile.py(210): outappend = out.append
|
|
sre_compile.py(211): charmap = [0]*256
|
|
sre_compile.py(212): try:
|
|
sre_compile.py(213): for op, av in charset:
|
|
sre_compile.py(214): if op is NEGATE:
|
|
sre_compile.py(215): outappend((op, av))
|
|
sre_compile.py(213): for op, av in charset:
|
|
sre_compile.py(214): if op is NEGATE:
|
|
sre_compile.py(216): elif op is LITERAL:
|
|
sre_compile.py(217): charmap[fixup(av)] = 1
|
|
--- modulename: sre_compile, funcname: _identityfunction
|
|
sre_compile.py(25): return x
|
|
sre_compile.py(213): for op, av in charset:
|
|
sre_compile.py(214): if op is NEGATE:
|
|
sre_compile.py(216): elif op is LITERAL:
|
|
sre_compile.py(217): charmap[fixup(av)] = 1
|
|
--- modulename: sre_compile, funcname: _identityfunction
|
|
sre_compile.py(25): return x
|
|
sre_compile.py(213): for op, av in charset:
|
|
sre_compile.py(228): i = p = n = 0
|
|
sre_compile.py(229): runs = []
|
|
sre_compile.py(230): runsappend = runs.append
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(234): p = i
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(237): runsappend((p, n))
|
|
sre_compile.py(238): n = 0
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(234): p = i
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(237): runsappend((p, n))
|
|
sre_compile.py(238): n = 0
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(240): if n:
|
|
sre_compile.py(242): if len(runs) <= 2:
|
|
sre_compile.py(244): for p, n in runs:
|
|
sre_compile.py(245): if n == 1:
|
|
sre_compile.py(246): outappend((LITERAL, p))
|
|
sre_compile.py(244): for p, n in runs:
|
|
sre_compile.py(245): if n == 1:
|
|
sre_compile.py(246): outappend((LITERAL, p))
|
|
sre_compile.py(244): for p, n in runs:
|
|
sre_compile.py(249): if len(out) < len(charset):
|
|
sre_compile.py(256): return charset
|
|
sre_compile.py(184): emit(OPCODES[op])
|
|
sre_compile.py(185): if op is NEGATE:
|
|
sre_compile.py(186): pass
|
|
sre_compile.py(183): for op, av in _optimize_charset(charset, fixup):
|
|
sre_compile.py(184): emit(OPCODES[op])
|
|
sre_compile.py(185): if op is NEGATE:
|
|
sre_compile.py(187): elif op is LITERAL:
|
|
sre_compile.py(188): emit(fixup(av))
|
|
--- modulename: sre_compile, funcname: _identityfunction
|
|
sre_compile.py(25): return x
|
|
sre_compile.py(183): for op, av in _optimize_charset(charset, fixup):
|
|
sre_compile.py(184): emit(OPCODES[op])
|
|
sre_compile.py(185): if op is NEGATE:
|
|
sre_compile.py(187): elif op is LITERAL:
|
|
sre_compile.py(188): emit(fixup(av))
|
|
--- modulename: sre_compile, funcname: _identityfunction
|
|
sre_compile.py(25): return x
|
|
sre_compile.py(183): for op, av in _optimize_charset(charset, fixup):
|
|
sre_compile.py(205): emit(OPCODES[FAILURE])
|
|
sre_compile.py(58): code[skip] = _len(code) - skip
|
|
sre_compile.py(40): for op, av in pattern:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(83): emit(OPCODES[SUCCESS])
|
|
sre_compile.py(84): code[skip] = _len(code) - skip
|
|
sre_compile.py(40): for op, av in pattern:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(102): if av[0]:
|
|
sre_compile.py(103): emit(OPCODES[MARK])
|
|
sre_compile.py(104): emit((av[0]-1)*2+1)
|
|
sre_compile.py(40): for op, av in pattern:
|
|
sre_compile.py(41): if op in LITERAL_CODES:
|
|
sre_compile.py(48): elif op is IN:
|
|
sre_compile.py(59): elif op is ANY:
|
|
sre_compile.py(64): elif op in REPEATING_CODES:
|
|
sre_compile.py(65): if flags & SRE_FLAG_TEMPLATE:
|
|
sre_compile.py(74): elif _simple(av) and op is not REPEAT:
|
|
--- modulename: sre_compile, funcname: _simple
|
|
sre_compile.py(356): lo, hi = av[2].getwidth()
|
|
--- modulename: sre_parse, funcname: getwidth
|
|
sre_parse.py(142): if self.width:
|
|
sre_parse.py(143): return self.width
|
|
sre_compile.py(357): return lo == hi == 1 and av[2][0][0] != SUBPATTERN
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(75): if op is MAX_REPEAT:
|
|
sre_compile.py(76): emit(OPCODES[REPEAT_ONE])
|
|
sre_compile.py(79): skip = _len(code); emit(0)
|
|
sre_compile.py(80): emit(av[0])
|
|
sre_compile.py(81): emit(av[1])
|
|
sre_compile.py(82): _compile(code, av[2], flags)
|
|
--- modulename: sre_compile, funcname: _compile
|
|
sre_compile.py(34): emit = code.append
|
|
sre_compile.py(35): _len = len
|
|
sre_compile.py(36): LITERAL_CODES = _LITERAL_CODES
|
|
sre_compile.py(37): REPEATING_CODES = _REPEATING_CODES
|
|
sre_compile.py(38): SUCCESS_CODES = _SUCCESS_CODES
|
|
sre_compile.py(39): ASSERT_CODES = _ASSERT_CODES
|
|
sre_compile.py(40): for op, av in pattern:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(41): if op in LITERAL_CODES:
|
|
sre_compile.py(48): elif op is IN:
|
|
sre_compile.py(49): if flags & SRE_FLAG_IGNORECASE:
|
|
sre_compile.py(54): emit(OPCODES[op])
|
|
sre_compile.py(55): fixup = _identityfunction
|
|
sre_compile.py(56): skip = _len(code); emit(0)
|
|
sre_compile.py(57): _compile_charset(av, flags, code, fixup)
|
|
--- modulename: sre_compile, funcname: _compile_charset
|
|
sre_compile.py(180): emit = code.append
|
|
sre_compile.py(181): if fixup is None:
|
|
sre_compile.py(183): for op, av in _optimize_charset(charset, fixup):
|
|
--- modulename: sre_compile, funcname: _optimize_charset
|
|
sre_compile.py(209): out = []
|
|
sre_compile.py(210): outappend = out.append
|
|
sre_compile.py(211): charmap = [0]*256
|
|
sre_compile.py(212): try:
|
|
sre_compile.py(213): for op, av in charset:
|
|
sre_compile.py(214): if op is NEGATE:
|
|
sre_compile.py(216): elif op is LITERAL:
|
|
sre_compile.py(218): elif op is RANGE:
|
|
sre_compile.py(221): elif op is CATEGORY:
|
|
sre_compile.py(223): return charset # cannot compress
|
|
sre_compile.py(184): emit(OPCODES[op])
|
|
sre_compile.py(185): if op is NEGATE:
|
|
sre_compile.py(187): elif op is LITERAL:
|
|
sre_compile.py(189): elif op is RANGE:
|
|
sre_compile.py(192): elif op is CHARSET:
|
|
sre_compile.py(194): elif op is BIGCHARSET:
|
|
sre_compile.py(196): elif op is CATEGORY:
|
|
sre_compile.py(197): if flags & SRE_FLAG_LOCALE:
|
|
sre_compile.py(199): elif flags & SRE_FLAG_UNICODE:
|
|
sre_compile.py(202): emit(CHCODES[av])
|
|
sre_compile.py(183): for op, av in _optimize_charset(charset, fixup):
|
|
sre_compile.py(205): emit(OPCODES[FAILURE])
|
|
sre_compile.py(58): code[skip] = _len(code) - skip
|
|
sre_compile.py(40): for op, av in pattern:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(83): emit(OPCODES[SUCCESS])
|
|
sre_compile.py(84): code[skip] = _len(code) - skip
|
|
sre_compile.py(40): for op, av in pattern:
|
|
sre_compile.py(41): if op in LITERAL_CODES:
|
|
sre_compile.py(48): elif op is IN:
|
|
sre_compile.py(59): elif op is ANY:
|
|
sre_compile.py(64): elif op in REPEATING_CODES:
|
|
sre_compile.py(96): elif op is SUBPATTERN:
|
|
sre_compile.py(97): if av[0]:
|
|
sre_compile.py(98): emit(OPCODES[MARK])
|
|
sre_compile.py(99): emit((av[0]-1)*2)
|
|
sre_compile.py(101): _compile(code, av[1], flags)
|
|
--- modulename: sre_compile, funcname: _compile
|
|
sre_compile.py(34): emit = code.append
|
|
sre_compile.py(35): _len = len
|
|
sre_compile.py(36): LITERAL_CODES = _LITERAL_CODES
|
|
sre_compile.py(37): REPEATING_CODES = _REPEATING_CODES
|
|
sre_compile.py(38): SUCCESS_CODES = _SUCCESS_CODES
|
|
sre_compile.py(39): ASSERT_CODES = _ASSERT_CODES
|
|
sre_compile.py(40): for op, av in pattern:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(41): if op in LITERAL_CODES:
|
|
sre_compile.py(48): elif op is IN:
|
|
sre_compile.py(49): if flags & SRE_FLAG_IGNORECASE:
|
|
sre_compile.py(54): emit(OPCODES[op])
|
|
sre_compile.py(55): fixup = _identityfunction
|
|
sre_compile.py(56): skip = _len(code); emit(0)
|
|
sre_compile.py(57): _compile_charset(av, flags, code, fixup)
|
|
--- modulename: sre_compile, funcname: _compile_charset
|
|
sre_compile.py(180): emit = code.append
|
|
sre_compile.py(181): if fixup is None:
|
|
sre_compile.py(183): for op, av in _optimize_charset(charset, fixup):
|
|
--- modulename: sre_compile, funcname: _optimize_charset
|
|
sre_compile.py(209): out = []
|
|
sre_compile.py(210): outappend = out.append
|
|
sre_compile.py(211): charmap = [0]*256
|
|
sre_compile.py(212): try:
|
|
sre_compile.py(213): for op, av in charset:
|
|
sre_compile.py(214): if op is NEGATE:
|
|
sre_compile.py(216): elif op is LITERAL:
|
|
sre_compile.py(217): charmap[fixup(av)] = 1
|
|
--- modulename: sre_compile, funcname: _identityfunction
|
|
sre_compile.py(25): return x
|
|
sre_compile.py(213): for op, av in charset:
|
|
sre_compile.py(214): if op is NEGATE:
|
|
sre_compile.py(216): elif op is LITERAL:
|
|
sre_compile.py(217): charmap[fixup(av)] = 1
|
|
--- modulename: sre_compile, funcname: _identityfunction
|
|
sre_compile.py(25): return x
|
|
sre_compile.py(213): for op, av in charset:
|
|
sre_compile.py(228): i = p = n = 0
|
|
sre_compile.py(229): runs = []
|
|
sre_compile.py(230): runsappend = runs.append
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(234): p = i
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(237): runsappend((p, n))
|
|
sre_compile.py(238): n = 0
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(234): p = i
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(237): runsappend((p, n))
|
|
sre_compile.py(238): n = 0
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(240): if n:
|
|
sre_compile.py(242): if len(runs) <= 2:
|
|
sre_compile.py(244): for p, n in runs:
|
|
sre_compile.py(245): if n == 1:
|
|
sre_compile.py(246): outappend((LITERAL, p))
|
|
sre_compile.py(244): for p, n in runs:
|
|
sre_compile.py(245): if n == 1:
|
|
sre_compile.py(246): outappend((LITERAL, p))
|
|
sre_compile.py(244): for p, n in runs:
|
|
sre_compile.py(249): if len(out) < len(charset):
|
|
sre_compile.py(256): return charset
|
|
sre_compile.py(184): emit(OPCODES[op])
|
|
sre_compile.py(185): if op is NEGATE:
|
|
sre_compile.py(187): elif op is LITERAL:
|
|
sre_compile.py(188): emit(fixup(av))
|
|
--- modulename: sre_compile, funcname: _identityfunction
|
|
sre_compile.py(25): return x
|
|
sre_compile.py(183): for op, av in _optimize_charset(charset, fixup):
|
|
sre_compile.py(184): emit(OPCODES[op])
|
|
sre_compile.py(185): if op is NEGATE:
|
|
sre_compile.py(187): elif op is LITERAL:
|
|
sre_compile.py(188): emit(fixup(av))
|
|
--- modulename: sre_compile, funcname: _identityfunction
|
|
sre_compile.py(25): return x
|
|
sre_compile.py(183): for op, av in _optimize_charset(charset, fixup):
|
|
sre_compile.py(205): emit(OPCODES[FAILURE])
|
|
sre_compile.py(58): code[skip] = _len(code) - skip
|
|
sre_compile.py(40): for op, av in pattern:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(102): if av[0]:
|
|
sre_compile.py(103): emit(OPCODES[MARK])
|
|
sre_compile.py(104): emit((av[0]-1)*2+1)
|
|
sre_compile.py(40): for op, av in pattern:
|
|
sre_compile.py(41): if op in LITERAL_CODES:
|
|
sre_compile.py(48): elif op is IN:
|
|
sre_compile.py(59): elif op is ANY:
|
|
sre_compile.py(64): elif op in REPEATING_CODES:
|
|
sre_compile.py(65): if flags & SRE_FLAG_TEMPLATE:
|
|
sre_compile.py(74): elif _simple(av) and op is not REPEAT:
|
|
--- modulename: sre_compile, funcname: _simple
|
|
sre_compile.py(356): lo, hi = av[2].getwidth()
|
|
--- modulename: sre_parse, funcname: getwidth
|
|
sre_parse.py(142): if self.width:
|
|
sre_parse.py(143): return self.width
|
|
sre_compile.py(357): return lo == hi == 1 and av[2][0][0] != SUBPATTERN
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(75): if op is MAX_REPEAT:
|
|
sre_compile.py(76): emit(OPCODES[REPEAT_ONE])
|
|
sre_compile.py(79): skip = _len(code); emit(0)
|
|
sre_compile.py(80): emit(av[0])
|
|
sre_compile.py(81): emit(av[1])
|
|
sre_compile.py(82): _compile(code, av[2], flags)
|
|
--- modulename: sre_compile, funcname: _compile
|
|
sre_compile.py(34): emit = code.append
|
|
sre_compile.py(35): _len = len
|
|
sre_compile.py(36): LITERAL_CODES = _LITERAL_CODES
|
|
sre_compile.py(37): REPEATING_CODES = _REPEATING_CODES
|
|
sre_compile.py(38): SUCCESS_CODES = _SUCCESS_CODES
|
|
sre_compile.py(39): ASSERT_CODES = _ASSERT_CODES
|
|
sre_compile.py(40): for op, av in pattern:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(41): if op in LITERAL_CODES:
|
|
sre_compile.py(48): elif op is IN:
|
|
sre_compile.py(49): if flags & SRE_FLAG_IGNORECASE:
|
|
sre_compile.py(54): emit(OPCODES[op])
|
|
sre_compile.py(55): fixup = _identityfunction
|
|
sre_compile.py(56): skip = _len(code); emit(0)
|
|
sre_compile.py(57): _compile_charset(av, flags, code, fixup)
|
|
--- modulename: sre_compile, funcname: _compile_charset
|
|
sre_compile.py(180): emit = code.append
|
|
sre_compile.py(181): if fixup is None:
|
|
sre_compile.py(183): for op, av in _optimize_charset(charset, fixup):
|
|
--- modulename: sre_compile, funcname: _optimize_charset
|
|
sre_compile.py(209): out = []
|
|
sre_compile.py(210): outappend = out.append
|
|
sre_compile.py(211): charmap = [0]*256
|
|
sre_compile.py(212): try:
|
|
sre_compile.py(213): for op, av in charset:
|
|
sre_compile.py(214): if op is NEGATE:
|
|
sre_compile.py(216): elif op is LITERAL:
|
|
sre_compile.py(218): elif op is RANGE:
|
|
sre_compile.py(221): elif op is CATEGORY:
|
|
sre_compile.py(223): return charset # cannot compress
|
|
sre_compile.py(184): emit(OPCODES[op])
|
|
sre_compile.py(185): if op is NEGATE:
|
|
sre_compile.py(187): elif op is LITERAL:
|
|
sre_compile.py(189): elif op is RANGE:
|
|
sre_compile.py(192): elif op is CHARSET:
|
|
sre_compile.py(194): elif op is BIGCHARSET:
|
|
sre_compile.py(196): elif op is CATEGORY:
|
|
sre_compile.py(197): if flags & SRE_FLAG_LOCALE:
|
|
sre_compile.py(199): elif flags & SRE_FLAG_UNICODE:
|
|
sre_compile.py(202): emit(CHCODES[av])
|
|
sre_compile.py(183): for op, av in _optimize_charset(charset, fixup):
|
|
sre_compile.py(205): emit(OPCODES[FAILURE])
|
|
sre_compile.py(58): code[skip] = _len(code) - skip
|
|
sre_compile.py(40): for op, av in pattern:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(83): emit(OPCODES[SUCCESS])
|
|
sre_compile.py(84): code[skip] = _len(code) - skip
|
|
sre_compile.py(40): for op, av in pattern:
|
|
sre_compile.py(41): if op in LITERAL_CODES:
|
|
sre_compile.py(48): elif op is IN:
|
|
sre_compile.py(59): elif op is ANY:
|
|
sre_compile.py(64): elif op in REPEATING_CODES:
|
|
sre_compile.py(96): elif op is SUBPATTERN:
|
|
sre_compile.py(97): if av[0]:
|
|
sre_compile.py(98): emit(OPCODES[MARK])
|
|
sre_compile.py(99): emit((av[0]-1)*2)
|
|
sre_compile.py(101): _compile(code, av[1], flags)
|
|
--- modulename: sre_compile, funcname: _compile
|
|
sre_compile.py(34): emit = code.append
|
|
sre_compile.py(35): _len = len
|
|
sre_compile.py(36): LITERAL_CODES = _LITERAL_CODES
|
|
sre_compile.py(37): REPEATING_CODES = _REPEATING_CODES
|
|
sre_compile.py(38): SUCCESS_CODES = _SUCCESS_CODES
|
|
sre_compile.py(39): ASSERT_CODES = _ASSERT_CODES
|
|
sre_compile.py(40): for op, av in pattern:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(41): if op in LITERAL_CODES:
|
|
sre_compile.py(48): elif op is IN:
|
|
sre_compile.py(59): elif op is ANY:
|
|
sre_compile.py(64): elif op in REPEATING_CODES:
|
|
sre_compile.py(65): if flags & SRE_FLAG_TEMPLATE:
|
|
sre_compile.py(74): elif _simple(av) and op is not REPEAT:
|
|
--- modulename: sre_compile, funcname: _simple
|
|
sre_compile.py(356): lo, hi = av[2].getwidth()
|
|
--- modulename: sre_parse, funcname: getwidth
|
|
sre_parse.py(142): if self.width:
|
|
sre_parse.py(143): return self.width
|
|
sre_compile.py(357): return lo == hi == 1 and av[2][0][0] != SUBPATTERN
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(75): if op is MAX_REPEAT:
|
|
sre_compile.py(76): emit(OPCODES[REPEAT_ONE])
|
|
sre_compile.py(79): skip = _len(code); emit(0)
|
|
sre_compile.py(80): emit(av[0])
|
|
sre_compile.py(81): emit(av[1])
|
|
sre_compile.py(82): _compile(code, av[2], flags)
|
|
--- modulename: sre_compile, funcname: _compile
|
|
sre_compile.py(34): emit = code.append
|
|
sre_compile.py(35): _len = len
|
|
sre_compile.py(36): LITERAL_CODES = _LITERAL_CODES
|
|
sre_compile.py(37): REPEATING_CODES = _REPEATING_CODES
|
|
sre_compile.py(38): SUCCESS_CODES = _SUCCESS_CODES
|
|
sre_compile.py(39): ASSERT_CODES = _ASSERT_CODES
|
|
sre_compile.py(40): for op, av in pattern:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(41): if op in LITERAL_CODES:
|
|
sre_compile.py(48): elif op is IN:
|
|
sre_compile.py(59): elif op is ANY:
|
|
sre_compile.py(60): if flags & SRE_FLAG_DOTALL:
|
|
sre_compile.py(63): emit(OPCODES[ANY])
|
|
sre_compile.py(40): for op, av in pattern:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(83): emit(OPCODES[SUCCESS])
|
|
sre_compile.py(84): code[skip] = _len(code) - skip
|
|
sre_compile.py(40): for op, av in pattern:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(102): if av[0]:
|
|
sre_compile.py(103): emit(OPCODES[MARK])
|
|
sre_compile.py(104): emit((av[0]-1)*2+1)
|
|
sre_compile.py(40): for op, av in pattern:
|
|
sre_compile.py(41): if op in LITERAL_CODES:
|
|
sre_compile.py(48): elif op is IN:
|
|
sre_compile.py(59): elif op is ANY:
|
|
sre_compile.py(64): elif op in REPEATING_CODES:
|
|
sre_compile.py(96): elif op is SUBPATTERN:
|
|
sre_compile.py(105): elif op in SUCCESS_CODES:
|
|
sre_compile.py(107): elif op in ASSERT_CODES:
|
|
sre_compile.py(120): elif op is CALL:
|
|
sre_compile.py(126): elif op is AT:
|
|
sre_compile.py(127): emit(OPCODES[op])
|
|
sre_compile.py(128): if flags & SRE_FLAG_MULTILINE:
|
|
sre_compile.py(130): if flags & SRE_FLAG_LOCALE:
|
|
sre_compile.py(132): elif flags & SRE_FLAG_UNICODE:
|
|
sre_compile.py(134): emit(ATCODES[av])
|
|
sre_compile.py(40): for op, av in pattern:
|
|
sre_compile.py(489): code.append(OPCODES[SUCCESS])
|
|
sre_compile.py(491): return code
|
|
sre_compile.py(507): if p.pattern.groups > 100:
|
|
sre_compile.py(513): groupindex = p.pattern.groupdict
|
|
sre_compile.py(514): indexgroup = [None] * p.pattern.groups
|
|
sre_compile.py(515): for k, i in groupindex.items():
|
|
sre_compile.py(516): indexgroup[i] = k
|
|
sre_compile.py(515): for k, i in groupindex.items():
|
|
sre_compile.py(516): indexgroup[i] = k
|
|
sre_compile.py(515): for k, i in groupindex.items():
|
|
sre_compile.py(516): indexgroup[i] = k
|
|
sre_compile.py(515): for k, i in groupindex.items():
|
|
sre_compile.py(518): return _sre.compile(
|
|
sre_compile.py(519): pattern, flags | p.pattern.flags, code,
|
|
sre_compile.py(520): p.pattern.groups-1,
|
|
sre_compile.py(521): groupindex, indexgroup
|
|
re.py(245): if not bypass_cache:
|
|
re.py(246): if len(_cache) >= _MAXCACHE:
|
|
re.py(248): _cache[cachekey] = p
|
|
re.py(249): return p
|
|
ConfigParser.py(454): OPTCRE_NV = re.compile(
|
|
ConfigParser.py(455): r'(?P<option>[^:=\s][^:=]*)' # very permissive!
|
|
--- modulename: re, funcname: compile
|
|
re.py(190): return _compile(pattern, flags)
|
|
--- modulename: re, funcname: _compile
|
|
re.py(228): pattern, flags = key
|
|
re.py(229): bypass_cache = flags & DEBUG
|
|
re.py(230): if not bypass_cache:
|
|
re.py(231): cachekey = (type(key[0]),) + key
|
|
re.py(232): p = _cache.get(cachekey)
|
|
re.py(233): if p is not None:
|
|
re.py(235): if isinstance(pattern, _pattern_type):
|
|
re.py(239): if not sre_compile.isstring(pattern):
|
|
--- modulename: sre_compile, funcname: isstring
|
|
sre_compile.py(473): for tp in STRING_TYPES:
|
|
sre_compile.py(474): if isinstance(obj, tp):
|
|
sre_compile.py(475): return 1
|
|
re.py(241): try:
|
|
re.py(242): p = sre_compile.compile(pattern, flags)
|
|
--- modulename: sre_compile, funcname: compile
|
|
sre_compile.py(496): if isstring(p):
|
|
--- modulename: sre_compile, funcname: isstring
|
|
sre_compile.py(473): for tp in STRING_TYPES:
|
|
sre_compile.py(474): if isinstance(obj, tp):
|
|
sre_compile.py(475): return 1
|
|
sre_compile.py(497): pattern = p
|
|
sre_compile.py(498): p = sre_parse.parse(p, flags)
|
|
--- modulename: sre_parse, funcname: parse
|
|
sre_parse.py(678): source = Tokenizer(str)
|
|
--- modulename: sre_parse, funcname: __init__
|
|
sre_parse.py(179): self.string = string
|
|
sre_parse.py(180): self.index = 0
|
|
sre_parse.py(181): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(680): if pattern is None:
|
|
sre_parse.py(681): pattern = Pattern()
|
|
--- modulename: sre_parse, funcname: __init__
|
|
sre_parse.py(68): self.flags = 0
|
|
sre_parse.py(69): self.open = []
|
|
sre_parse.py(70): self.groups = 1
|
|
sre_parse.py(71): self.groupdict = {}
|
|
sre_parse.py(682): pattern.flags = flags
|
|
sre_parse.py(683): pattern.str = str
|
|
sre_parse.py(685): p = _parse_sub(source, pattern, 0)
|
|
--- modulename: sre_parse, funcname: _parse_sub
|
|
sre_parse.py(304): items = []
|
|
sre_parse.py(305): itemsappend = items.append
|
|
sre_parse.py(306): sourcematch = source.match
|
|
sre_parse.py(307): while 1:
|
|
sre_parse.py(308): itemsappend(_parse(source, state))
|
|
--- modulename: sre_parse, funcname: _parse
|
|
sre_parse.py(381): subpattern = SubPattern(state)
|
|
--- modulename: sre_parse, funcname: __init__
|
|
sre_parse.py(91): self.pattern = pattern
|
|
sre_parse.py(92): if data is None:
|
|
sre_parse.py(93): data = []
|
|
sre_parse.py(94): self.data = data
|
|
sre_parse.py(95): self.width = None
|
|
sre_parse.py(384): subpatternappend = subpattern.append
|
|
sre_parse.py(385): sourceget = source.get
|
|
sre_parse.py(386): sourcematch = source.match
|
|
sre_parse.py(387): _len = len
|
|
sre_parse.py(388): PATTERNENDERS = _PATTERNENDERS
|
|
sre_parse.py(389): ASSERTCHARS = _ASSERTCHARS
|
|
sre_parse.py(390): LOOKBEHINDASSERTCHARS = _LOOKBEHINDASSERTCHARS
|
|
sre_parse.py(391): REPEATCODES = _REPEATCODES
|
|
sre_parse.py(393): while 1:
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(397): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(398): if this is None:
|
|
sre_parse.py(401): if state.flags & SRE_FLAG_VERBOSE:
|
|
sre_parse.py(412): if this and this[0] not in SPECIAL_CHARS:
|
|
sre_parse.py(415): elif this == "[":
|
|
sre_parse.py(472): elif this and this[0] in REPEAT_CHARS:
|
|
sre_parse.py(525): elif this == ".":
|
|
sre_parse.py(528): elif this == "(":
|
|
sre_parse.py(529): group = 1
|
|
sre_parse.py(530): name = None
|
|
sre_parse.py(531): condgroup = None
|
|
sre_parse.py(532): if sourcematch("?"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(197): if skip:
|
|
sre_parse.py(198): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(199): return 1
|
|
sre_parse.py(533): group = 0
|
|
sre_parse.py(535): if sourcematch("P"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(197): if skip:
|
|
sre_parse.py(198): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(199): return 1
|
|
sre_parse.py(537): if sourcematch("<"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(197): if skip:
|
|
sre_parse.py(198): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(199): return 1
|
|
sre_parse.py(539): name = ""
|
|
sre_parse.py(540): while 1:
|
|
sre_parse.py(541): char = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(542): if char is None:
|
|
sre_parse.py(544): if char == ">":
|
|
sre_parse.py(546): name = name + char
|
|
sre_parse.py(541): char = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(542): if char is None:
|
|
sre_parse.py(544): if char == ">":
|
|
sre_parse.py(546): name = name + char
|
|
sre_parse.py(541): char = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(542): if char is None:
|
|
sre_parse.py(544): if char == ">":
|
|
sre_parse.py(546): name = name + char
|
|
sre_parse.py(541): char = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(542): if char is None:
|
|
sre_parse.py(544): if char == ">":
|
|
sre_parse.py(546): name = name + char
|
|
sre_parse.py(541): char = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(542): if char is None:
|
|
sre_parse.py(544): if char == ">":
|
|
sre_parse.py(546): name = name + char
|
|
sre_parse.py(541): char = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(542): if char is None:
|
|
sre_parse.py(544): if char == ">":
|
|
sre_parse.py(546): name = name + char
|
|
sre_parse.py(541): char = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(542): if char is None:
|
|
sre_parse.py(544): if char == ">":
|
|
sre_parse.py(545): break
|
|
sre_parse.py(547): group = 1
|
|
sre_parse.py(548): if not name:
|
|
sre_parse.py(550): if not isname(name):
|
|
--- modulename: sre_parse, funcname: isname
|
|
sre_parse.py(218): if not isident(name[0]):
|
|
--- modulename: sre_parse, funcname: isident
|
|
sre_parse.py(211): return "a" <= char <= "z" or "A" <= char <= "Z" or char == "_"
|
|
sre_parse.py(220): for char in name[1:]:
|
|
sre_parse.py(221): if not isident(char) and not isdigit(char):
|
|
--- modulename: sre_parse, funcname: isident
|
|
sre_parse.py(211): return "a" <= char <= "z" or "A" <= char <= "Z" or char == "_"
|
|
sre_parse.py(220): for char in name[1:]:
|
|
sre_parse.py(221): if not isident(char) and not isdigit(char):
|
|
--- modulename: sre_parse, funcname: isident
|
|
sre_parse.py(211): return "a" <= char <= "z" or "A" <= char <= "Z" or char == "_"
|
|
sre_parse.py(220): for char in name[1:]:
|
|
sre_parse.py(221): if not isident(char) and not isdigit(char):
|
|
--- modulename: sre_parse, funcname: isident
|
|
sre_parse.py(211): return "a" <= char <= "z" or "A" <= char <= "Z" or char == "_"
|
|
sre_parse.py(220): for char in name[1:]:
|
|
sre_parse.py(221): if not isident(char) and not isdigit(char):
|
|
--- modulename: sre_parse, funcname: isident
|
|
sre_parse.py(211): return "a" <= char <= "z" or "A" <= char <= "Z" or char == "_"
|
|
sre_parse.py(220): for char in name[1:]:
|
|
sre_parse.py(221): if not isident(char) and not isdigit(char):
|
|
--- modulename: sre_parse, funcname: isident
|
|
sre_parse.py(211): return "a" <= char <= "z" or "A" <= char <= "Z" or char == "_"
|
|
sre_parse.py(220): for char in name[1:]:
|
|
sre_parse.py(223): return True
|
|
sre_parse.py(635): if group:
|
|
sre_parse.py(637): if group == 2:
|
|
sre_parse.py(641): group = state.opengroup(name)
|
|
--- modulename: sre_parse, funcname: opengroup
|
|
sre_parse.py(73): gid = self.groups
|
|
sre_parse.py(74): self.groups = gid + 1
|
|
sre_parse.py(75): if name is not None:
|
|
sre_parse.py(76): ogid = self.groupdict.get(name, None)
|
|
sre_parse.py(77): if ogid is not None:
|
|
sre_parse.py(80): self.groupdict[name] = gid
|
|
sre_parse.py(81): self.open.append(gid)
|
|
sre_parse.py(82): return gid
|
|
sre_parse.py(642): if condgroup:
|
|
sre_parse.py(645): p = _parse_sub(source, state)
|
|
--- modulename: sre_parse, funcname: _parse_sub
|
|
sre_parse.py(304): items = []
|
|
sre_parse.py(305): itemsappend = items.append
|
|
sre_parse.py(306): sourcematch = source.match
|
|
sre_parse.py(307): while 1:
|
|
sre_parse.py(308): itemsappend(_parse(source, state))
|
|
--- modulename: sre_parse, funcname: _parse
|
|
sre_parse.py(381): subpattern = SubPattern(state)
|
|
--- modulename: sre_parse, funcname: __init__
|
|
sre_parse.py(91): self.pattern = pattern
|
|
sre_parse.py(92): if data is None:
|
|
sre_parse.py(93): data = []
|
|
sre_parse.py(94): self.data = data
|
|
sre_parse.py(95): self.width = None
|
|
sre_parse.py(384): subpatternappend = subpattern.append
|
|
sre_parse.py(385): sourceget = source.get
|
|
sre_parse.py(386): sourcematch = source.match
|
|
sre_parse.py(387): _len = len
|
|
sre_parse.py(388): PATTERNENDERS = _PATTERNENDERS
|
|
sre_parse.py(389): ASSERTCHARS = _ASSERTCHARS
|
|
sre_parse.py(390): LOOKBEHINDASSERTCHARS = _LOOKBEHINDASSERTCHARS
|
|
sre_parse.py(391): REPEATCODES = _REPEATCODES
|
|
sre_parse.py(393): while 1:
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(397): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(398): if this is None:
|
|
sre_parse.py(401): if state.flags & SRE_FLAG_VERBOSE:
|
|
sre_parse.py(412): if this and this[0] not in SPECIAL_CHARS:
|
|
sre_parse.py(415): elif this == "[":
|
|
sre_parse.py(417): set = []
|
|
sre_parse.py(418): setappend = set.append
|
|
sre_parse.py(421): if sourcematch("^"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(197): if skip:
|
|
sre_parse.py(198): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(199): return 1
|
|
sre_parse.py(422): setappend((NEGATE, None))
|
|
sre_parse.py(424): start = set[:]
|
|
sre_parse.py(425): while 1:
|
|
sre_parse.py(426): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(427): if this == "]" and set != start:
|
|
sre_parse.py(429): elif this and this[0] == "\\":
|
|
sre_parse.py(431): elif this:
|
|
sre_parse.py(432): code1 = LITERAL, ord(this)
|
|
sre_parse.py(435): if sourcematch("-"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(459): if code1[0] is IN:
|
|
sre_parse.py(461): setappend(code1)
|
|
sre_parse.py(426): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(188): try:
|
|
sre_parse.py(189): c = self.string[self.index + 1]
|
|
sre_parse.py(192): char = char + c
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(427): if this == "]" and set != start:
|
|
sre_parse.py(429): elif this and this[0] == "\\":
|
|
sre_parse.py(431): elif this:
|
|
sre_parse.py(432): code1 = LITERAL, ord(this)
|
|
sre_parse.py(435): if sourcematch("-"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(459): if code1[0] is IN:
|
|
sre_parse.py(461): setappend(code1)
|
|
sre_parse.py(426): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(427): if this == "]" and set != start:
|
|
sre_parse.py(429): elif this and this[0] == "\\":
|
|
sre_parse.py(430): code1 = _class_escape(source, this)
|
|
--- modulename: sre_parse, funcname: _class_escape
|
|
sre_parse.py(227): code = ESCAPES.get(escape)
|
|
sre_parse.py(228): if code:
|
|
sre_parse.py(230): code = CATEGORIES.get(escape)
|
|
sre_parse.py(231): if code and code[0] == IN:
|
|
sre_parse.py(232): return code
|
|
sre_parse.py(435): if sourcematch("-"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(459): if code1[0] is IN:
|
|
sre_parse.py(460): code1 = code1[1][0]
|
|
sre_parse.py(461): setappend(code1)
|
|
sre_parse.py(426): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(427): if this == "]" and set != start:
|
|
sre_parse.py(428): break
|
|
sre_parse.py(464): if _len(set)==1 and set[0][0] is LITERAL:
|
|
sre_parse.py(466): elif _len(set)==2 and set[0][0] is NEGATE and set[1][0] is LITERAL:
|
|
sre_parse.py(470): subpatternappend((IN, set))
|
|
--- modulename: sre_parse, funcname: append
|
|
sre_parse.py(139): self.data.append(code)
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(397): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(398): if this is None:
|
|
sre_parse.py(401): if state.flags & SRE_FLAG_VERBOSE:
|
|
sre_parse.py(412): if this and this[0] not in SPECIAL_CHARS:
|
|
sre_parse.py(415): elif this == "[":
|
|
sre_parse.py(417): set = []
|
|
sre_parse.py(418): setappend = set.append
|
|
sre_parse.py(421): if sourcematch("^"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(197): if skip:
|
|
sre_parse.py(198): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(199): return 1
|
|
sre_parse.py(422): setappend((NEGATE, None))
|
|
sre_parse.py(424): start = set[:]
|
|
sre_parse.py(425): while 1:
|
|
sre_parse.py(426): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(427): if this == "]" and set != start:
|
|
sre_parse.py(429): elif this and this[0] == "\\":
|
|
sre_parse.py(431): elif this:
|
|
sre_parse.py(432): code1 = LITERAL, ord(this)
|
|
sre_parse.py(435): if sourcematch("-"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(459): if code1[0] is IN:
|
|
sre_parse.py(461): setappend(code1)
|
|
sre_parse.py(426): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(427): if this == "]" and set != start:
|
|
sre_parse.py(429): elif this and this[0] == "\\":
|
|
sre_parse.py(431): elif this:
|
|
sre_parse.py(432): code1 = LITERAL, ord(this)
|
|
sre_parse.py(435): if sourcematch("-"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(459): if code1[0] is IN:
|
|
sre_parse.py(461): setappend(code1)
|
|
sre_parse.py(426): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(427): if this == "]" and set != start:
|
|
sre_parse.py(428): break
|
|
sre_parse.py(464): if _len(set)==1 and set[0][0] is LITERAL:
|
|
sre_parse.py(466): elif _len(set)==2 and set[0][0] is NEGATE and set[1][0] is LITERAL:
|
|
sre_parse.py(470): subpatternappend((IN, set))
|
|
--- modulename: sre_parse, funcname: append
|
|
sre_parse.py(139): self.data.append(code)
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(397): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(398): if this is None:
|
|
sre_parse.py(401): if state.flags & SRE_FLAG_VERBOSE:
|
|
sre_parse.py(412): if this and this[0] not in SPECIAL_CHARS:
|
|
sre_parse.py(415): elif this == "[":
|
|
sre_parse.py(472): elif this and this[0] in REPEAT_CHARS:
|
|
sre_parse.py(474): if this == "?":
|
|
sre_parse.py(476): elif this == "*":
|
|
sre_parse.py(477): min, max = 0, MAXREPEAT
|
|
sre_parse.py(512): if subpattern:
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
sre_parse.py(513): item = subpattern[-1:]
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(132): return SubPattern(self.pattern, self.data[index])
|
|
--- modulename: sre_parse, funcname: __init__
|
|
sre_parse.py(91): self.pattern = pattern
|
|
sre_parse.py(92): if data is None:
|
|
sre_parse.py(94): self.data = data
|
|
sre_parse.py(95): self.width = None
|
|
sre_parse.py(516): if not item or (_len(item) == 1 and item[0][0] == AT):
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_parse.py(518): if item[0][0] in REPEATCODES:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_parse.py(520): if sourcematch("?"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(523): subpattern[-1] = (MAX_REPEAT, (min, max, item))
|
|
--- modulename: sre_parse, funcname: __setitem__
|
|
sre_parse.py(135): self.data[index] = code
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(396): break # end of subpattern
|
|
sre_parse.py(673): return subpattern
|
|
sre_parse.py(309): if sourcematch("|"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(311): if not nested:
|
|
sre_parse.py(313): if not source.next or sourcematch(")", 0):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(197): if skip:
|
|
sre_parse.py(199): return 1
|
|
sre_parse.py(314): break
|
|
sre_parse.py(318): if len(items) == 1:
|
|
sre_parse.py(319): return items[0]
|
|
sre_parse.py(646): if not sourcematch(")"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(197): if skip:
|
|
sre_parse.py(198): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(188): try:
|
|
sre_parse.py(189): c = self.string[self.index + 1]
|
|
sre_parse.py(192): char = char + c
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(199): return 1
|
|
sre_parse.py(648): if group is not None:
|
|
sre_parse.py(649): state.closegroup(group)
|
|
--- modulename: sre_parse, funcname: closegroup
|
|
sre_parse.py(84): self.open.remove(gid)
|
|
sre_parse.py(650): subpatternappend((SUBPATTERN, (group, p)))
|
|
--- modulename: sre_parse, funcname: append
|
|
sre_parse.py(139): self.data.append(code)
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(397): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(398): if this is None:
|
|
sre_parse.py(401): if state.flags & SRE_FLAG_VERBOSE:
|
|
sre_parse.py(412): if this and this[0] not in SPECIAL_CHARS:
|
|
sre_parse.py(415): elif this == "[":
|
|
sre_parse.py(472): elif this and this[0] in REPEAT_CHARS:
|
|
sre_parse.py(525): elif this == ".":
|
|
sre_parse.py(528): elif this == "(":
|
|
sre_parse.py(660): elif this == "^":
|
|
sre_parse.py(663): elif this == "$":
|
|
sre_parse.py(666): elif this and this[0] == "\\":
|
|
sre_parse.py(667): code = _escape(source, this, state)
|
|
--- modulename: sre_parse, funcname: _escape
|
|
sre_parse.py(259): code = CATEGORIES.get(escape)
|
|
sre_parse.py(260): if code:
|
|
sre_parse.py(261): return code
|
|
sre_parse.py(668): subpatternappend(code)
|
|
--- modulename: sre_parse, funcname: append
|
|
sre_parse.py(139): self.data.append(code)
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(397): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(398): if this is None:
|
|
sre_parse.py(401): if state.flags & SRE_FLAG_VERBOSE:
|
|
sre_parse.py(412): if this and this[0] not in SPECIAL_CHARS:
|
|
sre_parse.py(415): elif this == "[":
|
|
sre_parse.py(472): elif this and this[0] in REPEAT_CHARS:
|
|
sre_parse.py(474): if this == "?":
|
|
sre_parse.py(476): elif this == "*":
|
|
sre_parse.py(477): min, max = 0, MAXREPEAT
|
|
sre_parse.py(512): if subpattern:
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
sre_parse.py(513): item = subpattern[-1:]
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(132): return SubPattern(self.pattern, self.data[index])
|
|
--- modulename: sre_parse, funcname: __init__
|
|
sre_parse.py(91): self.pattern = pattern
|
|
sre_parse.py(92): if data is None:
|
|
sre_parse.py(94): self.data = data
|
|
sre_parse.py(95): self.width = None
|
|
sre_parse.py(516): if not item or (_len(item) == 1 and item[0][0] == AT):
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_parse.py(518): if item[0][0] in REPEATCODES:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_parse.py(520): if sourcematch("?"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(523): subpattern[-1] = (MAX_REPEAT, (min, max, item))
|
|
--- modulename: sre_parse, funcname: __setitem__
|
|
sre_parse.py(135): self.data[index] = code
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(397): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(398): if this is None:
|
|
sre_parse.py(401): if state.flags & SRE_FLAG_VERBOSE:
|
|
sre_parse.py(412): if this and this[0] not in SPECIAL_CHARS:
|
|
sre_parse.py(415): elif this == "[":
|
|
sre_parse.py(472): elif this and this[0] in REPEAT_CHARS:
|
|
sre_parse.py(525): elif this == ".":
|
|
sre_parse.py(528): elif this == "(":
|
|
sre_parse.py(529): group = 1
|
|
sre_parse.py(530): name = None
|
|
sre_parse.py(531): condgroup = None
|
|
sre_parse.py(532): if sourcematch("?"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(197): if skip:
|
|
sre_parse.py(198): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(199): return 1
|
|
sre_parse.py(533): group = 0
|
|
sre_parse.py(535): if sourcematch("P"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(578): elif sourcematch(":"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(197): if skip:
|
|
sre_parse.py(198): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(199): return 1
|
|
sre_parse.py(580): group = 2
|
|
sre_parse.py(635): if group:
|
|
sre_parse.py(637): if group == 2:
|
|
sre_parse.py(639): group = None
|
|
sre_parse.py(642): if condgroup:
|
|
sre_parse.py(645): p = _parse_sub(source, state)
|
|
--- modulename: sre_parse, funcname: _parse_sub
|
|
sre_parse.py(304): items = []
|
|
sre_parse.py(305): itemsappend = items.append
|
|
sre_parse.py(306): sourcematch = source.match
|
|
sre_parse.py(307): while 1:
|
|
sre_parse.py(308): itemsappend(_parse(source, state))
|
|
--- modulename: sre_parse, funcname: _parse
|
|
sre_parse.py(381): subpattern = SubPattern(state)
|
|
--- modulename: sre_parse, funcname: __init__
|
|
sre_parse.py(91): self.pattern = pattern
|
|
sre_parse.py(92): if data is None:
|
|
sre_parse.py(93): data = []
|
|
sre_parse.py(94): self.data = data
|
|
sre_parse.py(95): self.width = None
|
|
sre_parse.py(384): subpatternappend = subpattern.append
|
|
sre_parse.py(385): sourceget = source.get
|
|
sre_parse.py(386): sourcematch = source.match
|
|
sre_parse.py(387): _len = len
|
|
sre_parse.py(388): PATTERNENDERS = _PATTERNENDERS
|
|
sre_parse.py(389): ASSERTCHARS = _ASSERTCHARS
|
|
sre_parse.py(390): LOOKBEHINDASSERTCHARS = _LOOKBEHINDASSERTCHARS
|
|
sre_parse.py(391): REPEATCODES = _REPEATCODES
|
|
sre_parse.py(393): while 1:
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(397): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(398): if this is None:
|
|
sre_parse.py(401): if state.flags & SRE_FLAG_VERBOSE:
|
|
sre_parse.py(412): if this and this[0] not in SPECIAL_CHARS:
|
|
sre_parse.py(415): elif this == "[":
|
|
sre_parse.py(472): elif this and this[0] in REPEAT_CHARS:
|
|
sre_parse.py(525): elif this == ".":
|
|
sre_parse.py(528): elif this == "(":
|
|
sre_parse.py(529): group = 1
|
|
sre_parse.py(530): name = None
|
|
sre_parse.py(531): condgroup = None
|
|
sre_parse.py(532): if sourcematch("?"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(197): if skip:
|
|
sre_parse.py(198): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(199): return 1
|
|
sre_parse.py(533): group = 0
|
|
sre_parse.py(535): if sourcematch("P"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(197): if skip:
|
|
sre_parse.py(198): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(199): return 1
|
|
sre_parse.py(537): if sourcematch("<"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(197): if skip:
|
|
sre_parse.py(198): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(199): return 1
|
|
sre_parse.py(539): name = ""
|
|
sre_parse.py(540): while 1:
|
|
sre_parse.py(541): char = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(542): if char is None:
|
|
sre_parse.py(544): if char == ">":
|
|
sre_parse.py(546): name = name + char
|
|
sre_parse.py(541): char = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(542): if char is None:
|
|
sre_parse.py(544): if char == ">":
|
|
sre_parse.py(546): name = name + char
|
|
sre_parse.py(541): char = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(542): if char is None:
|
|
sre_parse.py(544): if char == ">":
|
|
sre_parse.py(545): break
|
|
sre_parse.py(547): group = 1
|
|
sre_parse.py(548): if not name:
|
|
sre_parse.py(550): if not isname(name):
|
|
--- modulename: sre_parse, funcname: isname
|
|
sre_parse.py(218): if not isident(name[0]):
|
|
--- modulename: sre_parse, funcname: isident
|
|
sre_parse.py(211): return "a" <= char <= "z" or "A" <= char <= "Z" or char == "_"
|
|
sre_parse.py(220): for char in name[1:]:
|
|
sre_parse.py(221): if not isident(char) and not isdigit(char):
|
|
--- modulename: sre_parse, funcname: isident
|
|
sre_parse.py(211): return "a" <= char <= "z" or "A" <= char <= "Z" or char == "_"
|
|
sre_parse.py(220): for char in name[1:]:
|
|
sre_parse.py(223): return True
|
|
sre_parse.py(635): if group:
|
|
sre_parse.py(637): if group == 2:
|
|
sre_parse.py(641): group = state.opengroup(name)
|
|
--- modulename: sre_parse, funcname: opengroup
|
|
sre_parse.py(73): gid = self.groups
|
|
sre_parse.py(74): self.groups = gid + 1
|
|
sre_parse.py(75): if name is not None:
|
|
sre_parse.py(76): ogid = self.groupdict.get(name, None)
|
|
sre_parse.py(77): if ogid is not None:
|
|
sre_parse.py(80): self.groupdict[name] = gid
|
|
sre_parse.py(81): self.open.append(gid)
|
|
sre_parse.py(82): return gid
|
|
sre_parse.py(642): if condgroup:
|
|
sre_parse.py(645): p = _parse_sub(source, state)
|
|
--- modulename: sre_parse, funcname: _parse_sub
|
|
sre_parse.py(304): items = []
|
|
sre_parse.py(305): itemsappend = items.append
|
|
sre_parse.py(306): sourcematch = source.match
|
|
sre_parse.py(307): while 1:
|
|
sre_parse.py(308): itemsappend(_parse(source, state))
|
|
--- modulename: sre_parse, funcname: _parse
|
|
sre_parse.py(381): subpattern = SubPattern(state)
|
|
--- modulename: sre_parse, funcname: __init__
|
|
sre_parse.py(91): self.pattern = pattern
|
|
sre_parse.py(92): if data is None:
|
|
sre_parse.py(93): data = []
|
|
sre_parse.py(94): self.data = data
|
|
sre_parse.py(95): self.width = None
|
|
sre_parse.py(384): subpatternappend = subpattern.append
|
|
sre_parse.py(385): sourceget = source.get
|
|
sre_parse.py(386): sourcematch = source.match
|
|
sre_parse.py(387): _len = len
|
|
sre_parse.py(388): PATTERNENDERS = _PATTERNENDERS
|
|
sre_parse.py(389): ASSERTCHARS = _ASSERTCHARS
|
|
sre_parse.py(390): LOOKBEHINDASSERTCHARS = _LOOKBEHINDASSERTCHARS
|
|
sre_parse.py(391): REPEATCODES = _REPEATCODES
|
|
sre_parse.py(393): while 1:
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(397): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(398): if this is None:
|
|
sre_parse.py(401): if state.flags & SRE_FLAG_VERBOSE:
|
|
sre_parse.py(412): if this and this[0] not in SPECIAL_CHARS:
|
|
sre_parse.py(415): elif this == "[":
|
|
sre_parse.py(417): set = []
|
|
sre_parse.py(418): setappend = set.append
|
|
sre_parse.py(421): if sourcematch("^"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(424): start = set[:]
|
|
sre_parse.py(425): while 1:
|
|
sre_parse.py(426): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(427): if this == "]" and set != start:
|
|
sre_parse.py(429): elif this and this[0] == "\\":
|
|
sre_parse.py(431): elif this:
|
|
sre_parse.py(432): code1 = LITERAL, ord(this)
|
|
sre_parse.py(435): if sourcematch("-"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(459): if code1[0] is IN:
|
|
sre_parse.py(461): setappend(code1)
|
|
sre_parse.py(426): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(427): if this == "]" and set != start:
|
|
sre_parse.py(429): elif this and this[0] == "\\":
|
|
sre_parse.py(431): elif this:
|
|
sre_parse.py(432): code1 = LITERAL, ord(this)
|
|
sre_parse.py(435): if sourcematch("-"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(459): if code1[0] is IN:
|
|
sre_parse.py(461): setappend(code1)
|
|
sre_parse.py(426): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(427): if this == "]" and set != start:
|
|
sre_parse.py(428): break
|
|
sre_parse.py(464): if _len(set)==1 and set[0][0] is LITERAL:
|
|
sre_parse.py(466): elif _len(set)==2 and set[0][0] is NEGATE and set[1][0] is LITERAL:
|
|
sre_parse.py(470): subpatternappend((IN, set))
|
|
--- modulename: sre_parse, funcname: append
|
|
sre_parse.py(139): self.data.append(code)
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(396): break # end of subpattern
|
|
sre_parse.py(673): return subpattern
|
|
sre_parse.py(309): if sourcematch("|"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(311): if not nested:
|
|
sre_parse.py(313): if not source.next or sourcematch(")", 0):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(197): if skip:
|
|
sre_parse.py(199): return 1
|
|
sre_parse.py(314): break
|
|
sre_parse.py(318): if len(items) == 1:
|
|
sre_parse.py(319): return items[0]
|
|
sre_parse.py(646): if not sourcematch(")"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(197): if skip:
|
|
sre_parse.py(198): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(188): try:
|
|
sre_parse.py(189): c = self.string[self.index + 1]
|
|
sre_parse.py(192): char = char + c
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(199): return 1
|
|
sre_parse.py(648): if group is not None:
|
|
sre_parse.py(649): state.closegroup(group)
|
|
--- modulename: sre_parse, funcname: closegroup
|
|
sre_parse.py(84): self.open.remove(gid)
|
|
sre_parse.py(650): subpatternappend((SUBPATTERN, (group, p)))
|
|
--- modulename: sre_parse, funcname: append
|
|
sre_parse.py(139): self.data.append(code)
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(397): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(398): if this is None:
|
|
sre_parse.py(401): if state.flags & SRE_FLAG_VERBOSE:
|
|
sre_parse.py(412): if this and this[0] not in SPECIAL_CHARS:
|
|
sre_parse.py(415): elif this == "[":
|
|
sre_parse.py(472): elif this and this[0] in REPEAT_CHARS:
|
|
sre_parse.py(525): elif this == ".":
|
|
sre_parse.py(528): elif this == "(":
|
|
sre_parse.py(660): elif this == "^":
|
|
sre_parse.py(663): elif this == "$":
|
|
sre_parse.py(666): elif this and this[0] == "\\":
|
|
sre_parse.py(667): code = _escape(source, this, state)
|
|
--- modulename: sre_parse, funcname: _escape
|
|
sre_parse.py(259): code = CATEGORIES.get(escape)
|
|
sre_parse.py(260): if code:
|
|
sre_parse.py(261): return code
|
|
sre_parse.py(668): subpatternappend(code)
|
|
--- modulename: sre_parse, funcname: append
|
|
sre_parse.py(139): self.data.append(code)
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(397): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(398): if this is None:
|
|
sre_parse.py(401): if state.flags & SRE_FLAG_VERBOSE:
|
|
sre_parse.py(412): if this and this[0] not in SPECIAL_CHARS:
|
|
sre_parse.py(415): elif this == "[":
|
|
sre_parse.py(472): elif this and this[0] in REPEAT_CHARS:
|
|
sre_parse.py(474): if this == "?":
|
|
sre_parse.py(476): elif this == "*":
|
|
sre_parse.py(477): min, max = 0, MAXREPEAT
|
|
sre_parse.py(512): if subpattern:
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
sre_parse.py(513): item = subpattern[-1:]
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(132): return SubPattern(self.pattern, self.data[index])
|
|
--- modulename: sre_parse, funcname: __init__
|
|
sre_parse.py(91): self.pattern = pattern
|
|
sre_parse.py(92): if data is None:
|
|
sre_parse.py(94): self.data = data
|
|
sre_parse.py(95): self.width = None
|
|
sre_parse.py(516): if not item or (_len(item) == 1 and item[0][0] == AT):
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_parse.py(518): if item[0][0] in REPEATCODES:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_parse.py(520): if sourcematch("?"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(523): subpattern[-1] = (MAX_REPEAT, (min, max, item))
|
|
--- modulename: sre_parse, funcname: __setitem__
|
|
sre_parse.py(135): self.data[index] = code
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(397): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(398): if this is None:
|
|
sre_parse.py(401): if state.flags & SRE_FLAG_VERBOSE:
|
|
sre_parse.py(412): if this and this[0] not in SPECIAL_CHARS:
|
|
sre_parse.py(415): elif this == "[":
|
|
sre_parse.py(472): elif this and this[0] in REPEAT_CHARS:
|
|
sre_parse.py(525): elif this == ".":
|
|
sre_parse.py(528): elif this == "(":
|
|
sre_parse.py(529): group = 1
|
|
sre_parse.py(530): name = None
|
|
sre_parse.py(531): condgroup = None
|
|
sre_parse.py(532): if sourcematch("?"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(197): if skip:
|
|
sre_parse.py(198): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(199): return 1
|
|
sre_parse.py(533): group = 0
|
|
sre_parse.py(535): if sourcematch("P"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(197): if skip:
|
|
sre_parse.py(198): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(199): return 1
|
|
sre_parse.py(537): if sourcematch("<"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(197): if skip:
|
|
sre_parse.py(198): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(199): return 1
|
|
sre_parse.py(539): name = ""
|
|
sre_parse.py(540): while 1:
|
|
sre_parse.py(541): char = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(542): if char is None:
|
|
sre_parse.py(544): if char == ">":
|
|
sre_parse.py(546): name = name + char
|
|
sre_parse.py(541): char = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(542): if char is None:
|
|
sre_parse.py(544): if char == ">":
|
|
sre_parse.py(546): name = name + char
|
|
sre_parse.py(541): char = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(542): if char is None:
|
|
sre_parse.py(544): if char == ">":
|
|
sre_parse.py(546): name = name + char
|
|
sre_parse.py(541): char = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(542): if char is None:
|
|
sre_parse.py(544): if char == ">":
|
|
sre_parse.py(546): name = name + char
|
|
sre_parse.py(541): char = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(542): if char is None:
|
|
sre_parse.py(544): if char == ">":
|
|
sre_parse.py(546): name = name + char
|
|
sre_parse.py(541): char = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(542): if char is None:
|
|
sre_parse.py(544): if char == ">":
|
|
sre_parse.py(545): break
|
|
sre_parse.py(547): group = 1
|
|
sre_parse.py(548): if not name:
|
|
sre_parse.py(550): if not isname(name):
|
|
--- modulename: sre_parse, funcname: isname
|
|
sre_parse.py(218): if not isident(name[0]):
|
|
--- modulename: sre_parse, funcname: isident
|
|
sre_parse.py(211): return "a" <= char <= "z" or "A" <= char <= "Z" or char == "_"
|
|
sre_parse.py(220): for char in name[1:]:
|
|
sre_parse.py(221): if not isident(char) and not isdigit(char):
|
|
--- modulename: sre_parse, funcname: isident
|
|
sre_parse.py(211): return "a" <= char <= "z" or "A" <= char <= "Z" or char == "_"
|
|
sre_parse.py(220): for char in name[1:]:
|
|
sre_parse.py(221): if not isident(char) and not isdigit(char):
|
|
--- modulename: sre_parse, funcname: isident
|
|
sre_parse.py(211): return "a" <= char <= "z" or "A" <= char <= "Z" or char == "_"
|
|
sre_parse.py(220): for char in name[1:]:
|
|
sre_parse.py(221): if not isident(char) and not isdigit(char):
|
|
--- modulename: sre_parse, funcname: isident
|
|
sre_parse.py(211): return "a" <= char <= "z" or "A" <= char <= "Z" or char == "_"
|
|
sre_parse.py(220): for char in name[1:]:
|
|
sre_parse.py(221): if not isident(char) and not isdigit(char):
|
|
--- modulename: sre_parse, funcname: isident
|
|
sre_parse.py(211): return "a" <= char <= "z" or "A" <= char <= "Z" or char == "_"
|
|
sre_parse.py(220): for char in name[1:]:
|
|
sre_parse.py(223): return True
|
|
sre_parse.py(635): if group:
|
|
sre_parse.py(637): if group == 2:
|
|
sre_parse.py(641): group = state.opengroup(name)
|
|
--- modulename: sre_parse, funcname: opengroup
|
|
sre_parse.py(73): gid = self.groups
|
|
sre_parse.py(74): self.groups = gid + 1
|
|
sre_parse.py(75): if name is not None:
|
|
sre_parse.py(76): ogid = self.groupdict.get(name, None)
|
|
sre_parse.py(77): if ogid is not None:
|
|
sre_parse.py(80): self.groupdict[name] = gid
|
|
sre_parse.py(81): self.open.append(gid)
|
|
sre_parse.py(82): return gid
|
|
sre_parse.py(642): if condgroup:
|
|
sre_parse.py(645): p = _parse_sub(source, state)
|
|
--- modulename: sre_parse, funcname: _parse_sub
|
|
sre_parse.py(304): items = []
|
|
sre_parse.py(305): itemsappend = items.append
|
|
sre_parse.py(306): sourcematch = source.match
|
|
sre_parse.py(307): while 1:
|
|
sre_parse.py(308): itemsappend(_parse(source, state))
|
|
--- modulename: sre_parse, funcname: _parse
|
|
sre_parse.py(381): subpattern = SubPattern(state)
|
|
--- modulename: sre_parse, funcname: __init__
|
|
sre_parse.py(91): self.pattern = pattern
|
|
sre_parse.py(92): if data is None:
|
|
sre_parse.py(93): data = []
|
|
sre_parse.py(94): self.data = data
|
|
sre_parse.py(95): self.width = None
|
|
sre_parse.py(384): subpatternappend = subpattern.append
|
|
sre_parse.py(385): sourceget = source.get
|
|
sre_parse.py(386): sourcematch = source.match
|
|
sre_parse.py(387): _len = len
|
|
sre_parse.py(388): PATTERNENDERS = _PATTERNENDERS
|
|
sre_parse.py(389): ASSERTCHARS = _ASSERTCHARS
|
|
sre_parse.py(390): LOOKBEHINDASSERTCHARS = _LOOKBEHINDASSERTCHARS
|
|
sre_parse.py(391): REPEATCODES = _REPEATCODES
|
|
sre_parse.py(393): while 1:
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(397): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(398): if this is None:
|
|
sre_parse.py(401): if state.flags & SRE_FLAG_VERBOSE:
|
|
sre_parse.py(412): if this and this[0] not in SPECIAL_CHARS:
|
|
sre_parse.py(415): elif this == "[":
|
|
sre_parse.py(472): elif this and this[0] in REPEAT_CHARS:
|
|
sre_parse.py(525): elif this == ".":
|
|
sre_parse.py(526): subpatternappend((ANY, None))
|
|
--- modulename: sre_parse, funcname: append
|
|
sre_parse.py(139): self.data.append(code)
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(397): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(398): if this is None:
|
|
sre_parse.py(401): if state.flags & SRE_FLAG_VERBOSE:
|
|
sre_parse.py(412): if this and this[0] not in SPECIAL_CHARS:
|
|
sre_parse.py(415): elif this == "[":
|
|
sre_parse.py(472): elif this and this[0] in REPEAT_CHARS:
|
|
sre_parse.py(474): if this == "?":
|
|
sre_parse.py(476): elif this == "*":
|
|
sre_parse.py(477): min, max = 0, MAXREPEAT
|
|
sre_parse.py(512): if subpattern:
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
sre_parse.py(513): item = subpattern[-1:]
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(132): return SubPattern(self.pattern, self.data[index])
|
|
--- modulename: sre_parse, funcname: __init__
|
|
sre_parse.py(91): self.pattern = pattern
|
|
sre_parse.py(92): if data is None:
|
|
sre_parse.py(94): self.data = data
|
|
sre_parse.py(95): self.width = None
|
|
sre_parse.py(516): if not item or (_len(item) == 1 and item[0][0] == AT):
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_parse.py(518): if item[0][0] in REPEATCODES:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_parse.py(520): if sourcematch("?"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(523): subpattern[-1] = (MAX_REPEAT, (min, max, item))
|
|
--- modulename: sre_parse, funcname: __setitem__
|
|
sre_parse.py(135): self.data[index] = code
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(396): break # end of subpattern
|
|
sre_parse.py(673): return subpattern
|
|
sre_parse.py(309): if sourcematch("|"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(311): if not nested:
|
|
sre_parse.py(313): if not source.next or sourcematch(")", 0):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(197): if skip:
|
|
sre_parse.py(199): return 1
|
|
sre_parse.py(314): break
|
|
sre_parse.py(318): if len(items) == 1:
|
|
sre_parse.py(319): return items[0]
|
|
sre_parse.py(646): if not sourcematch(")"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(197): if skip:
|
|
sre_parse.py(198): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(199): return 1
|
|
sre_parse.py(648): if group is not None:
|
|
sre_parse.py(649): state.closegroup(group)
|
|
--- modulename: sre_parse, funcname: closegroup
|
|
sre_parse.py(84): self.open.remove(gid)
|
|
sre_parse.py(650): subpatternappend((SUBPATTERN, (group, p)))
|
|
--- modulename: sre_parse, funcname: append
|
|
sre_parse.py(139): self.data.append(code)
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(396): break # end of subpattern
|
|
sre_parse.py(673): return subpattern
|
|
sre_parse.py(309): if sourcematch("|"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(311): if not nested:
|
|
sre_parse.py(313): if not source.next or sourcematch(")", 0):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(197): if skip:
|
|
sre_parse.py(199): return 1
|
|
sre_parse.py(314): break
|
|
sre_parse.py(318): if len(items) == 1:
|
|
sre_parse.py(319): return items[0]
|
|
sre_parse.py(646): if not sourcematch(")"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(197): if skip:
|
|
sre_parse.py(198): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(199): return 1
|
|
sre_parse.py(648): if group is not None:
|
|
sre_parse.py(650): subpatternappend((SUBPATTERN, (group, p)))
|
|
--- modulename: sre_parse, funcname: append
|
|
sre_parse.py(139): self.data.append(code)
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(397): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(398): if this is None:
|
|
sre_parse.py(401): if state.flags & SRE_FLAG_VERBOSE:
|
|
sre_parse.py(412): if this and this[0] not in SPECIAL_CHARS:
|
|
sre_parse.py(415): elif this == "[":
|
|
sre_parse.py(472): elif this and this[0] in REPEAT_CHARS:
|
|
sre_parse.py(474): if this == "?":
|
|
sre_parse.py(475): min, max = 0, 1
|
|
sre_parse.py(512): if subpattern:
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
sre_parse.py(513): item = subpattern[-1:]
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(132): return SubPattern(self.pattern, self.data[index])
|
|
--- modulename: sre_parse, funcname: __init__
|
|
sre_parse.py(91): self.pattern = pattern
|
|
sre_parse.py(92): if data is None:
|
|
sre_parse.py(94): self.data = data
|
|
sre_parse.py(95): self.width = None
|
|
sre_parse.py(516): if not item or (_len(item) == 1 and item[0][0] == AT):
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_parse.py(518): if item[0][0] in REPEATCODES:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_parse.py(520): if sourcematch("?"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(523): subpattern[-1] = (MAX_REPEAT, (min, max, item))
|
|
--- modulename: sre_parse, funcname: __setitem__
|
|
sre_parse.py(135): self.data[index] = code
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(397): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(184): self.next = None
|
|
sre_parse.py(185): return
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(398): if this is None:
|
|
sre_parse.py(401): if state.flags & SRE_FLAG_VERBOSE:
|
|
sre_parse.py(412): if this and this[0] not in SPECIAL_CHARS:
|
|
sre_parse.py(415): elif this == "[":
|
|
sre_parse.py(472): elif this and this[0] in REPEAT_CHARS:
|
|
sre_parse.py(525): elif this == ".":
|
|
sre_parse.py(528): elif this == "(":
|
|
sre_parse.py(660): elif this == "^":
|
|
sre_parse.py(663): elif this == "$":
|
|
sre_parse.py(664): subpattern.append((AT, AT_END))
|
|
--- modulename: sre_parse, funcname: append
|
|
sre_parse.py(139): self.data.append(code)
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(397): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(184): self.next = None
|
|
sre_parse.py(185): return
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(398): if this is None:
|
|
sre_parse.py(399): break # end of pattern
|
|
sre_parse.py(673): return subpattern
|
|
sre_parse.py(309): if sourcematch("|"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(311): if not nested:
|
|
sre_parse.py(312): break
|
|
sre_parse.py(318): if len(items) == 1:
|
|
sre_parse.py(319): return items[0]
|
|
sre_parse.py(687): tail = source.get()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(184): self.next = None
|
|
sre_parse.py(185): return
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(688): if tail == ")":
|
|
sre_parse.py(690): elif tail:
|
|
sre_parse.py(693): if flags & SRE_FLAG_DEBUG:
|
|
sre_parse.py(696): if not (flags & SRE_FLAG_VERBOSE) and p.pattern.flags & SRE_FLAG_VERBOSE:
|
|
sre_parse.py(701): return p
|
|
sre_compile.py(502): code = _code(p, flags)
|
|
--- modulename: sre_compile, funcname: _code
|
|
sre_compile.py(480): flags = p.pattern.flags | flags
|
|
sre_compile.py(481): code = []
|
|
sre_compile.py(484): _compile_info(code, p, flags)
|
|
--- modulename: sre_compile, funcname: _compile_info
|
|
sre_compile.py(363): lo, hi = pattern.getwidth()
|
|
--- modulename: sre_parse, funcname: getwidth
|
|
sre_parse.py(142): if self.width:
|
|
sre_parse.py(144): lo = hi = 0
|
|
sre_parse.py(145): UNITCODES = (ANY, RANGE, IN, LITERAL, NOT_LITERAL, CATEGORY)
|
|
sre_parse.py(146): REPEATCODES = (MIN_REPEAT, MAX_REPEAT)
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(148): if op is BRANCH:
|
|
sre_parse.py(157): elif op is CALL:
|
|
sre_parse.py(161): elif op is SUBPATTERN:
|
|
sre_parse.py(162): i, j = av[1].getwidth()
|
|
--- modulename: sre_parse, funcname: getwidth
|
|
sre_parse.py(142): if self.width:
|
|
sre_parse.py(144): lo = hi = 0
|
|
sre_parse.py(145): UNITCODES = (ANY, RANGE, IN, LITERAL, NOT_LITERAL, CATEGORY)
|
|
sre_parse.py(146): REPEATCODES = (MIN_REPEAT, MAX_REPEAT)
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(148): if op is BRANCH:
|
|
sre_parse.py(157): elif op is CALL:
|
|
sre_parse.py(161): elif op is SUBPATTERN:
|
|
sre_parse.py(165): elif op in REPEATCODES:
|
|
sre_parse.py(169): elif op in UNITCODES:
|
|
sre_parse.py(170): lo = lo + 1
|
|
sre_parse.py(171): hi = hi + 1
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(148): if op is BRANCH:
|
|
sre_parse.py(157): elif op is CALL:
|
|
sre_parse.py(161): elif op is SUBPATTERN:
|
|
sre_parse.py(165): elif op in REPEATCODES:
|
|
sre_parse.py(166): i, j = av[2].getwidth()
|
|
--- modulename: sre_parse, funcname: getwidth
|
|
sre_parse.py(142): if self.width:
|
|
sre_parse.py(144): lo = hi = 0
|
|
sre_parse.py(145): UNITCODES = (ANY, RANGE, IN, LITERAL, NOT_LITERAL, CATEGORY)
|
|
sre_parse.py(146): REPEATCODES = (MIN_REPEAT, MAX_REPEAT)
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(148): if op is BRANCH:
|
|
sre_parse.py(157): elif op is CALL:
|
|
sre_parse.py(161): elif op is SUBPATTERN:
|
|
sre_parse.py(165): elif op in REPEATCODES:
|
|
sre_parse.py(169): elif op in UNITCODES:
|
|
sre_parse.py(170): lo = lo + 1
|
|
sre_parse.py(171): hi = hi + 1
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(174): self.width = min(lo, MAXREPEAT - 1), min(hi, MAXREPEAT)
|
|
sre_parse.py(175): return self.width
|
|
sre_parse.py(167): lo = lo + i * av[0]
|
|
sre_parse.py(168): hi = hi + j * av[1]
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(174): self.width = min(lo, MAXREPEAT - 1), min(hi, MAXREPEAT)
|
|
sre_parse.py(175): return self.width
|
|
sre_parse.py(163): lo = lo + i
|
|
sre_parse.py(164): hi = hi + j
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(148): if op is BRANCH:
|
|
sre_parse.py(157): elif op is CALL:
|
|
sre_parse.py(161): elif op is SUBPATTERN:
|
|
sre_parse.py(165): elif op in REPEATCODES:
|
|
sre_parse.py(166): i, j = av[2].getwidth()
|
|
--- modulename: sre_parse, funcname: getwidth
|
|
sre_parse.py(142): if self.width:
|
|
sre_parse.py(144): lo = hi = 0
|
|
sre_parse.py(145): UNITCODES = (ANY, RANGE, IN, LITERAL, NOT_LITERAL, CATEGORY)
|
|
sre_parse.py(146): REPEATCODES = (MIN_REPEAT, MAX_REPEAT)
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(148): if op is BRANCH:
|
|
sre_parse.py(157): elif op is CALL:
|
|
sre_parse.py(161): elif op is SUBPATTERN:
|
|
sre_parse.py(165): elif op in REPEATCODES:
|
|
sre_parse.py(169): elif op in UNITCODES:
|
|
sre_parse.py(170): lo = lo + 1
|
|
sre_parse.py(171): hi = hi + 1
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(174): self.width = min(lo, MAXREPEAT - 1), min(hi, MAXREPEAT)
|
|
sre_parse.py(175): return self.width
|
|
sre_parse.py(167): lo = lo + i * av[0]
|
|
sre_parse.py(168): hi = hi + j * av[1]
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(148): if op is BRANCH:
|
|
sre_parse.py(157): elif op is CALL:
|
|
sre_parse.py(161): elif op is SUBPATTERN:
|
|
sre_parse.py(165): elif op in REPEATCODES:
|
|
sre_parse.py(166): i, j = av[2].getwidth()
|
|
--- modulename: sre_parse, funcname: getwidth
|
|
sre_parse.py(142): if self.width:
|
|
sre_parse.py(144): lo = hi = 0
|
|
sre_parse.py(145): UNITCODES = (ANY, RANGE, IN, LITERAL, NOT_LITERAL, CATEGORY)
|
|
sre_parse.py(146): REPEATCODES = (MIN_REPEAT, MAX_REPEAT)
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(148): if op is BRANCH:
|
|
sre_parse.py(157): elif op is CALL:
|
|
sre_parse.py(161): elif op is SUBPATTERN:
|
|
sre_parse.py(162): i, j = av[1].getwidth()
|
|
--- modulename: sre_parse, funcname: getwidth
|
|
sre_parse.py(142): if self.width:
|
|
sre_parse.py(144): lo = hi = 0
|
|
sre_parse.py(145): UNITCODES = (ANY, RANGE, IN, LITERAL, NOT_LITERAL, CATEGORY)
|
|
sre_parse.py(146): REPEATCODES = (MIN_REPEAT, MAX_REPEAT)
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(148): if op is BRANCH:
|
|
sre_parse.py(157): elif op is CALL:
|
|
sre_parse.py(161): elif op is SUBPATTERN:
|
|
sre_parse.py(162): i, j = av[1].getwidth()
|
|
--- modulename: sre_parse, funcname: getwidth
|
|
sre_parse.py(142): if self.width:
|
|
sre_parse.py(144): lo = hi = 0
|
|
sre_parse.py(145): UNITCODES = (ANY, RANGE, IN, LITERAL, NOT_LITERAL, CATEGORY)
|
|
sre_parse.py(146): REPEATCODES = (MIN_REPEAT, MAX_REPEAT)
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(148): if op is BRANCH:
|
|
sre_parse.py(157): elif op is CALL:
|
|
sre_parse.py(161): elif op is SUBPATTERN:
|
|
sre_parse.py(165): elif op in REPEATCODES:
|
|
sre_parse.py(169): elif op in UNITCODES:
|
|
sre_parse.py(170): lo = lo + 1
|
|
sre_parse.py(171): hi = hi + 1
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(174): self.width = min(lo, MAXREPEAT - 1), min(hi, MAXREPEAT)
|
|
sre_parse.py(175): return self.width
|
|
sre_parse.py(163): lo = lo + i
|
|
sre_parse.py(164): hi = hi + j
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(148): if op is BRANCH:
|
|
sre_parse.py(157): elif op is CALL:
|
|
sre_parse.py(161): elif op is SUBPATTERN:
|
|
sre_parse.py(165): elif op in REPEATCODES:
|
|
sre_parse.py(166): i, j = av[2].getwidth()
|
|
--- modulename: sre_parse, funcname: getwidth
|
|
sre_parse.py(142): if self.width:
|
|
sre_parse.py(144): lo = hi = 0
|
|
sre_parse.py(145): UNITCODES = (ANY, RANGE, IN, LITERAL, NOT_LITERAL, CATEGORY)
|
|
sre_parse.py(146): REPEATCODES = (MIN_REPEAT, MAX_REPEAT)
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(148): if op is BRANCH:
|
|
sre_parse.py(157): elif op is CALL:
|
|
sre_parse.py(161): elif op is SUBPATTERN:
|
|
sre_parse.py(165): elif op in REPEATCODES:
|
|
sre_parse.py(169): elif op in UNITCODES:
|
|
sre_parse.py(170): lo = lo + 1
|
|
sre_parse.py(171): hi = hi + 1
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(174): self.width = min(lo, MAXREPEAT - 1), min(hi, MAXREPEAT)
|
|
sre_parse.py(175): return self.width
|
|
sre_parse.py(167): lo = lo + i * av[0]
|
|
sre_parse.py(168): hi = hi + j * av[1]
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(148): if op is BRANCH:
|
|
sre_parse.py(157): elif op is CALL:
|
|
sre_parse.py(161): elif op is SUBPATTERN:
|
|
sre_parse.py(162): i, j = av[1].getwidth()
|
|
--- modulename: sre_parse, funcname: getwidth
|
|
sre_parse.py(142): if self.width:
|
|
sre_parse.py(144): lo = hi = 0
|
|
sre_parse.py(145): UNITCODES = (ANY, RANGE, IN, LITERAL, NOT_LITERAL, CATEGORY)
|
|
sre_parse.py(146): REPEATCODES = (MIN_REPEAT, MAX_REPEAT)
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(148): if op is BRANCH:
|
|
sre_parse.py(157): elif op is CALL:
|
|
sre_parse.py(161): elif op is SUBPATTERN:
|
|
sre_parse.py(165): elif op in REPEATCODES:
|
|
sre_parse.py(166): i, j = av[2].getwidth()
|
|
--- modulename: sre_parse, funcname: getwidth
|
|
sre_parse.py(142): if self.width:
|
|
sre_parse.py(144): lo = hi = 0
|
|
sre_parse.py(145): UNITCODES = (ANY, RANGE, IN, LITERAL, NOT_LITERAL, CATEGORY)
|
|
sre_parse.py(146): REPEATCODES = (MIN_REPEAT, MAX_REPEAT)
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(148): if op is BRANCH:
|
|
sre_parse.py(157): elif op is CALL:
|
|
sre_parse.py(161): elif op is SUBPATTERN:
|
|
sre_parse.py(165): elif op in REPEATCODES:
|
|
sre_parse.py(169): elif op in UNITCODES:
|
|
sre_parse.py(170): lo = lo + 1
|
|
sre_parse.py(171): hi = hi + 1
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(174): self.width = min(lo, MAXREPEAT - 1), min(hi, MAXREPEAT)
|
|
sre_parse.py(175): return self.width
|
|
sre_parse.py(167): lo = lo + i * av[0]
|
|
sre_parse.py(168): hi = hi + j * av[1]
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(174): self.width = min(lo, MAXREPEAT - 1), min(hi, MAXREPEAT)
|
|
sre_parse.py(175): return self.width
|
|
sre_parse.py(163): lo = lo + i
|
|
sre_parse.py(164): hi = hi + j
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(174): self.width = min(lo, MAXREPEAT - 1), min(hi, MAXREPEAT)
|
|
sre_parse.py(175): return self.width
|
|
sre_parse.py(163): lo = lo + i
|
|
sre_parse.py(164): hi = hi + j
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(174): self.width = min(lo, MAXREPEAT - 1), min(hi, MAXREPEAT)
|
|
sre_parse.py(175): return self.width
|
|
sre_parse.py(167): lo = lo + i * av[0]
|
|
sre_parse.py(168): hi = hi + j * av[1]
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(148): if op is BRANCH:
|
|
sre_parse.py(157): elif op is CALL:
|
|
sre_parse.py(161): elif op is SUBPATTERN:
|
|
sre_parse.py(165): elif op in REPEATCODES:
|
|
sre_parse.py(169): elif op in UNITCODES:
|
|
sre_parse.py(172): elif op == SUCCESS:
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(174): self.width = min(lo, MAXREPEAT - 1), min(hi, MAXREPEAT)
|
|
sre_parse.py(175): return self.width
|
|
sre_compile.py(364): if lo == 0:
|
|
sre_compile.py(367): prefix = []
|
|
sre_compile.py(368): prefixappend = prefix.append
|
|
sre_compile.py(369): prefix_skip = 0
|
|
sre_compile.py(370): charset = [] # not used
|
|
sre_compile.py(371): charsetappend = charset.append
|
|
sre_compile.py(372): if not (flags & SRE_FLAG_IGNORECASE):
|
|
sre_compile.py(374): for op, av in pattern.data:
|
|
sre_compile.py(375): if op is LITERAL:
|
|
sre_compile.py(379): elif op is SUBPATTERN and len(av[1]) == 1:
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
sre_compile.py(386): break
|
|
sre_compile.py(388): if not prefix and pattern.data:
|
|
sre_compile.py(389): op, av = pattern.data[0]
|
|
sre_compile.py(390): if op is SUBPATTERN and av[1]:
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
sre_compile.py(391): op, av = av[1][0]
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(392): if op is LITERAL:
|
|
sre_compile.py(394): elif op is BRANCH:
|
|
sre_compile.py(427): emit = code.append
|
|
sre_compile.py(428): emit(OPCODES[INFO])
|
|
sre_compile.py(429): skip = len(code); emit(0)
|
|
sre_compile.py(431): mask = 0
|
|
sre_compile.py(432): if prefix:
|
|
sre_compile.py(436): elif charset:
|
|
sre_compile.py(438): emit(mask)
|
|
sre_compile.py(440): if lo < MAXCODE:
|
|
sre_compile.py(441): emit(lo)
|
|
sre_compile.py(445): if hi < MAXCODE:
|
|
sre_compile.py(448): emit(0)
|
|
sre_compile.py(450): if prefix:
|
|
sre_compile.py(461): elif charset:
|
|
sre_compile.py(463): code[skip] = len(code) - skip
|
|
sre_compile.py(487): _compile(code, p.data, flags)
|
|
--- modulename: sre_compile, funcname: _compile
|
|
sre_compile.py(34): emit = code.append
|
|
sre_compile.py(35): _len = len
|
|
sre_compile.py(36): LITERAL_CODES = _LITERAL_CODES
|
|
sre_compile.py(37): REPEATING_CODES = _REPEATING_CODES
|
|
sre_compile.py(38): SUCCESS_CODES = _SUCCESS_CODES
|
|
sre_compile.py(39): ASSERT_CODES = _ASSERT_CODES
|
|
sre_compile.py(40): for op, av in pattern:
|
|
sre_compile.py(41): if op in LITERAL_CODES:
|
|
sre_compile.py(48): elif op is IN:
|
|
sre_compile.py(59): elif op is ANY:
|
|
sre_compile.py(64): elif op in REPEATING_CODES:
|
|
sre_compile.py(96): elif op is SUBPATTERN:
|
|
sre_compile.py(97): if av[0]:
|
|
sre_compile.py(98): emit(OPCODES[MARK])
|
|
sre_compile.py(99): emit((av[0]-1)*2)
|
|
sre_compile.py(101): _compile(code, av[1], flags)
|
|
--- modulename: sre_compile, funcname: _compile
|
|
sre_compile.py(34): emit = code.append
|
|
sre_compile.py(35): _len = len
|
|
sre_compile.py(36): LITERAL_CODES = _LITERAL_CODES
|
|
sre_compile.py(37): REPEATING_CODES = _REPEATING_CODES
|
|
sre_compile.py(38): SUCCESS_CODES = _SUCCESS_CODES
|
|
sre_compile.py(39): ASSERT_CODES = _ASSERT_CODES
|
|
sre_compile.py(40): for op, av in pattern:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(41): if op in LITERAL_CODES:
|
|
sre_compile.py(48): elif op is IN:
|
|
sre_compile.py(49): if flags & SRE_FLAG_IGNORECASE:
|
|
sre_compile.py(54): emit(OPCODES[op])
|
|
sre_compile.py(55): fixup = _identityfunction
|
|
sre_compile.py(56): skip = _len(code); emit(0)
|
|
sre_compile.py(57): _compile_charset(av, flags, code, fixup)
|
|
--- modulename: sre_compile, funcname: _compile_charset
|
|
sre_compile.py(180): emit = code.append
|
|
sre_compile.py(181): if fixup is None:
|
|
sre_compile.py(183): for op, av in _optimize_charset(charset, fixup):
|
|
--- modulename: sre_compile, funcname: _optimize_charset
|
|
sre_compile.py(209): out = []
|
|
sre_compile.py(210): outappend = out.append
|
|
sre_compile.py(211): charmap = [0]*256
|
|
sre_compile.py(212): try:
|
|
sre_compile.py(213): for op, av in charset:
|
|
sre_compile.py(214): if op is NEGATE:
|
|
sre_compile.py(215): outappend((op, av))
|
|
sre_compile.py(213): for op, av in charset:
|
|
sre_compile.py(214): if op is NEGATE:
|
|
sre_compile.py(216): elif op is LITERAL:
|
|
sre_compile.py(217): charmap[fixup(av)] = 1
|
|
--- modulename: sre_compile, funcname: _identityfunction
|
|
sre_compile.py(25): return x
|
|
sre_compile.py(213): for op, av in charset:
|
|
sre_compile.py(214): if op is NEGATE:
|
|
sre_compile.py(216): elif op is LITERAL:
|
|
sre_compile.py(217): charmap[fixup(av)] = 1
|
|
--- modulename: sre_compile, funcname: _identityfunction
|
|
sre_compile.py(25): return x
|
|
sre_compile.py(213): for op, av in charset:
|
|
sre_compile.py(214): if op is NEGATE:
|
|
sre_compile.py(216): elif op is LITERAL:
|
|
sre_compile.py(218): elif op is RANGE:
|
|
sre_compile.py(221): elif op is CATEGORY:
|
|
sre_compile.py(223): return charset # cannot compress
|
|
sre_compile.py(184): emit(OPCODES[op])
|
|
sre_compile.py(185): if op is NEGATE:
|
|
sre_compile.py(186): pass
|
|
sre_compile.py(183): for op, av in _optimize_charset(charset, fixup):
|
|
sre_compile.py(184): emit(OPCODES[op])
|
|
sre_compile.py(185): if op is NEGATE:
|
|
sre_compile.py(187): elif op is LITERAL:
|
|
sre_compile.py(188): emit(fixup(av))
|
|
--- modulename: sre_compile, funcname: _identityfunction
|
|
sre_compile.py(25): return x
|
|
sre_compile.py(183): for op, av in _optimize_charset(charset, fixup):
|
|
sre_compile.py(184): emit(OPCODES[op])
|
|
sre_compile.py(185): if op is NEGATE:
|
|
sre_compile.py(187): elif op is LITERAL:
|
|
sre_compile.py(188): emit(fixup(av))
|
|
--- modulename: sre_compile, funcname: _identityfunction
|
|
sre_compile.py(25): return x
|
|
sre_compile.py(183): for op, av in _optimize_charset(charset, fixup):
|
|
sre_compile.py(184): emit(OPCODES[op])
|
|
sre_compile.py(185): if op is NEGATE:
|
|
sre_compile.py(187): elif op is LITERAL:
|
|
sre_compile.py(189): elif op is RANGE:
|
|
sre_compile.py(192): elif op is CHARSET:
|
|
sre_compile.py(194): elif op is BIGCHARSET:
|
|
sre_compile.py(196): elif op is CATEGORY:
|
|
sre_compile.py(197): if flags & SRE_FLAG_LOCALE:
|
|
sre_compile.py(199): elif flags & SRE_FLAG_UNICODE:
|
|
sre_compile.py(202): emit(CHCODES[av])
|
|
sre_compile.py(183): for op, av in _optimize_charset(charset, fixup):
|
|
sre_compile.py(205): emit(OPCODES[FAILURE])
|
|
sre_compile.py(58): code[skip] = _len(code) - skip
|
|
sre_compile.py(40): for op, av in pattern:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(41): if op in LITERAL_CODES:
|
|
sre_compile.py(48): elif op is IN:
|
|
sre_compile.py(59): elif op is ANY:
|
|
sre_compile.py(64): elif op in REPEATING_CODES:
|
|
sre_compile.py(65): if flags & SRE_FLAG_TEMPLATE:
|
|
sre_compile.py(74): elif _simple(av) and op is not REPEAT:
|
|
--- modulename: sre_compile, funcname: _simple
|
|
sre_compile.py(356): lo, hi = av[2].getwidth()
|
|
--- modulename: sre_parse, funcname: getwidth
|
|
sre_parse.py(142): if self.width:
|
|
sre_parse.py(143): return self.width
|
|
sre_compile.py(357): return lo == hi == 1 and av[2][0][0] != SUBPATTERN
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(75): if op is MAX_REPEAT:
|
|
sre_compile.py(76): emit(OPCODES[REPEAT_ONE])
|
|
sre_compile.py(79): skip = _len(code); emit(0)
|
|
sre_compile.py(80): emit(av[0])
|
|
sre_compile.py(81): emit(av[1])
|
|
sre_compile.py(82): _compile(code, av[2], flags)
|
|
--- modulename: sre_compile, funcname: _compile
|
|
sre_compile.py(34): emit = code.append
|
|
sre_compile.py(35): _len = len
|
|
sre_compile.py(36): LITERAL_CODES = _LITERAL_CODES
|
|
sre_compile.py(37): REPEATING_CODES = _REPEATING_CODES
|
|
sre_compile.py(38): SUCCESS_CODES = _SUCCESS_CODES
|
|
sre_compile.py(39): ASSERT_CODES = _ASSERT_CODES
|
|
sre_compile.py(40): for op, av in pattern:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(41): if op in LITERAL_CODES:
|
|
sre_compile.py(48): elif op is IN:
|
|
sre_compile.py(49): if flags & SRE_FLAG_IGNORECASE:
|
|
sre_compile.py(54): emit(OPCODES[op])
|
|
sre_compile.py(55): fixup = _identityfunction
|
|
sre_compile.py(56): skip = _len(code); emit(0)
|
|
sre_compile.py(57): _compile_charset(av, flags, code, fixup)
|
|
--- modulename: sre_compile, funcname: _compile_charset
|
|
sre_compile.py(180): emit = code.append
|
|
sre_compile.py(181): if fixup is None:
|
|
sre_compile.py(183): for op, av in _optimize_charset(charset, fixup):
|
|
--- modulename: sre_compile, funcname: _optimize_charset
|
|
sre_compile.py(209): out = []
|
|
sre_compile.py(210): outappend = out.append
|
|
sre_compile.py(211): charmap = [0]*256
|
|
sre_compile.py(212): try:
|
|
sre_compile.py(213): for op, av in charset:
|
|
sre_compile.py(214): if op is NEGATE:
|
|
sre_compile.py(215): outappend((op, av))
|
|
sre_compile.py(213): for op, av in charset:
|
|
sre_compile.py(214): if op is NEGATE:
|
|
sre_compile.py(216): elif op is LITERAL:
|
|
sre_compile.py(217): charmap[fixup(av)] = 1
|
|
--- modulename: sre_compile, funcname: _identityfunction
|
|
sre_compile.py(25): return x
|
|
sre_compile.py(213): for op, av in charset:
|
|
sre_compile.py(214): if op is NEGATE:
|
|
sre_compile.py(216): elif op is LITERAL:
|
|
sre_compile.py(217): charmap[fixup(av)] = 1
|
|
--- modulename: sre_compile, funcname: _identityfunction
|
|
sre_compile.py(25): return x
|
|
sre_compile.py(213): for op, av in charset:
|
|
sre_compile.py(228): i = p = n = 0
|
|
sre_compile.py(229): runs = []
|
|
sre_compile.py(230): runsappend = runs.append
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(234): p = i
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(237): runsappend((p, n))
|
|
sre_compile.py(238): n = 0
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(234): p = i
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(237): runsappend((p, n))
|
|
sre_compile.py(238): n = 0
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(240): if n:
|
|
sre_compile.py(242): if len(runs) <= 2:
|
|
sre_compile.py(244): for p, n in runs:
|
|
sre_compile.py(245): if n == 1:
|
|
sre_compile.py(246): outappend((LITERAL, p))
|
|
sre_compile.py(244): for p, n in runs:
|
|
sre_compile.py(245): if n == 1:
|
|
sre_compile.py(246): outappend((LITERAL, p))
|
|
sre_compile.py(244): for p, n in runs:
|
|
sre_compile.py(249): if len(out) < len(charset):
|
|
sre_compile.py(256): return charset
|
|
sre_compile.py(184): emit(OPCODES[op])
|
|
sre_compile.py(185): if op is NEGATE:
|
|
sre_compile.py(186): pass
|
|
sre_compile.py(183): for op, av in _optimize_charset(charset, fixup):
|
|
sre_compile.py(184): emit(OPCODES[op])
|
|
sre_compile.py(185): if op is NEGATE:
|
|
sre_compile.py(187): elif op is LITERAL:
|
|
sre_compile.py(188): emit(fixup(av))
|
|
--- modulename: sre_compile, funcname: _identityfunction
|
|
sre_compile.py(25): return x
|
|
sre_compile.py(183): for op, av in _optimize_charset(charset, fixup):
|
|
sre_compile.py(184): emit(OPCODES[op])
|
|
sre_compile.py(185): if op is NEGATE:
|
|
sre_compile.py(187): elif op is LITERAL:
|
|
sre_compile.py(188): emit(fixup(av))
|
|
--- modulename: sre_compile, funcname: _identityfunction
|
|
sre_compile.py(25): return x
|
|
sre_compile.py(183): for op, av in _optimize_charset(charset, fixup):
|
|
sre_compile.py(205): emit(OPCODES[FAILURE])
|
|
sre_compile.py(58): code[skip] = _len(code) - skip
|
|
sre_compile.py(40): for op, av in pattern:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(83): emit(OPCODES[SUCCESS])
|
|
sre_compile.py(84): code[skip] = _len(code) - skip
|
|
sre_compile.py(40): for op, av in pattern:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(102): if av[0]:
|
|
sre_compile.py(103): emit(OPCODES[MARK])
|
|
sre_compile.py(104): emit((av[0]-1)*2+1)
|
|
sre_compile.py(40): for op, av in pattern:
|
|
sre_compile.py(41): if op in LITERAL_CODES:
|
|
sre_compile.py(48): elif op is IN:
|
|
sre_compile.py(59): elif op is ANY:
|
|
sre_compile.py(64): elif op in REPEATING_CODES:
|
|
sre_compile.py(65): if flags & SRE_FLAG_TEMPLATE:
|
|
sre_compile.py(74): elif _simple(av) and op is not REPEAT:
|
|
--- modulename: sre_compile, funcname: _simple
|
|
sre_compile.py(356): lo, hi = av[2].getwidth()
|
|
--- modulename: sre_parse, funcname: getwidth
|
|
sre_parse.py(142): if self.width:
|
|
sre_parse.py(143): return self.width
|
|
sre_compile.py(357): return lo == hi == 1 and av[2][0][0] != SUBPATTERN
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(75): if op is MAX_REPEAT:
|
|
sre_compile.py(76): emit(OPCODES[REPEAT_ONE])
|
|
sre_compile.py(79): skip = _len(code); emit(0)
|
|
sre_compile.py(80): emit(av[0])
|
|
sre_compile.py(81): emit(av[1])
|
|
sre_compile.py(82): _compile(code, av[2], flags)
|
|
--- modulename: sre_compile, funcname: _compile
|
|
sre_compile.py(34): emit = code.append
|
|
sre_compile.py(35): _len = len
|
|
sre_compile.py(36): LITERAL_CODES = _LITERAL_CODES
|
|
sre_compile.py(37): REPEATING_CODES = _REPEATING_CODES
|
|
sre_compile.py(38): SUCCESS_CODES = _SUCCESS_CODES
|
|
sre_compile.py(39): ASSERT_CODES = _ASSERT_CODES
|
|
sre_compile.py(40): for op, av in pattern:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(41): if op in LITERAL_CODES:
|
|
sre_compile.py(48): elif op is IN:
|
|
sre_compile.py(49): if flags & SRE_FLAG_IGNORECASE:
|
|
sre_compile.py(54): emit(OPCODES[op])
|
|
sre_compile.py(55): fixup = _identityfunction
|
|
sre_compile.py(56): skip = _len(code); emit(0)
|
|
sre_compile.py(57): _compile_charset(av, flags, code, fixup)
|
|
--- modulename: sre_compile, funcname: _compile_charset
|
|
sre_compile.py(180): emit = code.append
|
|
sre_compile.py(181): if fixup is None:
|
|
sre_compile.py(183): for op, av in _optimize_charset(charset, fixup):
|
|
--- modulename: sre_compile, funcname: _optimize_charset
|
|
sre_compile.py(209): out = []
|
|
sre_compile.py(210): outappend = out.append
|
|
sre_compile.py(211): charmap = [0]*256
|
|
sre_compile.py(212): try:
|
|
sre_compile.py(213): for op, av in charset:
|
|
sre_compile.py(214): if op is NEGATE:
|
|
sre_compile.py(216): elif op is LITERAL:
|
|
sre_compile.py(218): elif op is RANGE:
|
|
sre_compile.py(221): elif op is CATEGORY:
|
|
sre_compile.py(223): return charset # cannot compress
|
|
sre_compile.py(184): emit(OPCODES[op])
|
|
sre_compile.py(185): if op is NEGATE:
|
|
sre_compile.py(187): elif op is LITERAL:
|
|
sre_compile.py(189): elif op is RANGE:
|
|
sre_compile.py(192): elif op is CHARSET:
|
|
sre_compile.py(194): elif op is BIGCHARSET:
|
|
sre_compile.py(196): elif op is CATEGORY:
|
|
sre_compile.py(197): if flags & SRE_FLAG_LOCALE:
|
|
sre_compile.py(199): elif flags & SRE_FLAG_UNICODE:
|
|
sre_compile.py(202): emit(CHCODES[av])
|
|
sre_compile.py(183): for op, av in _optimize_charset(charset, fixup):
|
|
sre_compile.py(205): emit(OPCODES[FAILURE])
|
|
sre_compile.py(58): code[skip] = _len(code) - skip
|
|
sre_compile.py(40): for op, av in pattern:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(83): emit(OPCODES[SUCCESS])
|
|
sre_compile.py(84): code[skip] = _len(code) - skip
|
|
sre_compile.py(40): for op, av in pattern:
|
|
sre_compile.py(41): if op in LITERAL_CODES:
|
|
sre_compile.py(48): elif op is IN:
|
|
sre_compile.py(59): elif op is ANY:
|
|
sre_compile.py(64): elif op in REPEATING_CODES:
|
|
sre_compile.py(65): if flags & SRE_FLAG_TEMPLATE:
|
|
sre_compile.py(74): elif _simple(av) and op is not REPEAT:
|
|
--- modulename: sre_compile, funcname: _simple
|
|
sre_compile.py(356): lo, hi = av[2].getwidth()
|
|
--- modulename: sre_parse, funcname: getwidth
|
|
sre_parse.py(142): if self.width:
|
|
sre_parse.py(143): return self.width
|
|
sre_compile.py(357): return lo == hi == 1 and av[2][0][0] != SUBPATTERN
|
|
sre_compile.py(86): emit(OPCODES[REPEAT])
|
|
sre_compile.py(87): skip = _len(code); emit(0)
|
|
sre_compile.py(88): emit(av[0])
|
|
sre_compile.py(89): emit(av[1])
|
|
sre_compile.py(90): _compile(code, av[2], flags)
|
|
--- modulename: sre_compile, funcname: _compile
|
|
sre_compile.py(34): emit = code.append
|
|
sre_compile.py(35): _len = len
|
|
sre_compile.py(36): LITERAL_CODES = _LITERAL_CODES
|
|
sre_compile.py(37): REPEATING_CODES = _REPEATING_CODES
|
|
sre_compile.py(38): SUCCESS_CODES = _SUCCESS_CODES
|
|
sre_compile.py(39): ASSERT_CODES = _ASSERT_CODES
|
|
sre_compile.py(40): for op, av in pattern:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(41): if op in LITERAL_CODES:
|
|
sre_compile.py(48): elif op is IN:
|
|
sre_compile.py(59): elif op is ANY:
|
|
sre_compile.py(64): elif op in REPEATING_CODES:
|
|
sre_compile.py(96): elif op is SUBPATTERN:
|
|
sre_compile.py(97): if av[0]:
|
|
sre_compile.py(101): _compile(code, av[1], flags)
|
|
--- modulename: sre_compile, funcname: _compile
|
|
sre_compile.py(34): emit = code.append
|
|
sre_compile.py(35): _len = len
|
|
sre_compile.py(36): LITERAL_CODES = _LITERAL_CODES
|
|
sre_compile.py(37): REPEATING_CODES = _REPEATING_CODES
|
|
sre_compile.py(38): SUCCESS_CODES = _SUCCESS_CODES
|
|
sre_compile.py(39): ASSERT_CODES = _ASSERT_CODES
|
|
sre_compile.py(40): for op, av in pattern:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(41): if op in LITERAL_CODES:
|
|
sre_compile.py(48): elif op is IN:
|
|
sre_compile.py(59): elif op is ANY:
|
|
sre_compile.py(64): elif op in REPEATING_CODES:
|
|
sre_compile.py(96): elif op is SUBPATTERN:
|
|
sre_compile.py(97): if av[0]:
|
|
sre_compile.py(98): emit(OPCODES[MARK])
|
|
sre_compile.py(99): emit((av[0]-1)*2)
|
|
sre_compile.py(101): _compile(code, av[1], flags)
|
|
--- modulename: sre_compile, funcname: _compile
|
|
sre_compile.py(34): emit = code.append
|
|
sre_compile.py(35): _len = len
|
|
sre_compile.py(36): LITERAL_CODES = _LITERAL_CODES
|
|
sre_compile.py(37): REPEATING_CODES = _REPEATING_CODES
|
|
sre_compile.py(38): SUCCESS_CODES = _SUCCESS_CODES
|
|
sre_compile.py(39): ASSERT_CODES = _ASSERT_CODES
|
|
sre_compile.py(40): for op, av in pattern:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(41): if op in LITERAL_CODES:
|
|
sre_compile.py(48): elif op is IN:
|
|
sre_compile.py(49): if flags & SRE_FLAG_IGNORECASE:
|
|
sre_compile.py(54): emit(OPCODES[op])
|
|
sre_compile.py(55): fixup = _identityfunction
|
|
sre_compile.py(56): skip = _len(code); emit(0)
|
|
sre_compile.py(57): _compile_charset(av, flags, code, fixup)
|
|
--- modulename: sre_compile, funcname: _compile_charset
|
|
sre_compile.py(180): emit = code.append
|
|
sre_compile.py(181): if fixup is None:
|
|
sre_compile.py(183): for op, av in _optimize_charset(charset, fixup):
|
|
--- modulename: sre_compile, funcname: _optimize_charset
|
|
sre_compile.py(209): out = []
|
|
sre_compile.py(210): outappend = out.append
|
|
sre_compile.py(211): charmap = [0]*256
|
|
sre_compile.py(212): try:
|
|
sre_compile.py(213): for op, av in charset:
|
|
sre_compile.py(214): if op is NEGATE:
|
|
sre_compile.py(216): elif op is LITERAL:
|
|
sre_compile.py(217): charmap[fixup(av)] = 1
|
|
--- modulename: sre_compile, funcname: _identityfunction
|
|
sre_compile.py(25): return x
|
|
sre_compile.py(213): for op, av in charset:
|
|
sre_compile.py(214): if op is NEGATE:
|
|
sre_compile.py(216): elif op is LITERAL:
|
|
sre_compile.py(217): charmap[fixup(av)] = 1
|
|
--- modulename: sre_compile, funcname: _identityfunction
|
|
sre_compile.py(25): return x
|
|
sre_compile.py(213): for op, av in charset:
|
|
sre_compile.py(228): i = p = n = 0
|
|
sre_compile.py(229): runs = []
|
|
sre_compile.py(230): runsappend = runs.append
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(234): p = i
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(237): runsappend((p, n))
|
|
sre_compile.py(238): n = 0
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(234): p = i
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(237): runsappend((p, n))
|
|
sre_compile.py(238): n = 0
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(240): if n:
|
|
sre_compile.py(242): if len(runs) <= 2:
|
|
sre_compile.py(244): for p, n in runs:
|
|
sre_compile.py(245): if n == 1:
|
|
sre_compile.py(246): outappend((LITERAL, p))
|
|
sre_compile.py(244): for p, n in runs:
|
|
sre_compile.py(245): if n == 1:
|
|
sre_compile.py(246): outappend((LITERAL, p))
|
|
sre_compile.py(244): for p, n in runs:
|
|
sre_compile.py(249): if len(out) < len(charset):
|
|
sre_compile.py(256): return charset
|
|
sre_compile.py(184): emit(OPCODES[op])
|
|
sre_compile.py(185): if op is NEGATE:
|
|
sre_compile.py(187): elif op is LITERAL:
|
|
sre_compile.py(188): emit(fixup(av))
|
|
--- modulename: sre_compile, funcname: _identityfunction
|
|
sre_compile.py(25): return x
|
|
sre_compile.py(183): for op, av in _optimize_charset(charset, fixup):
|
|
sre_compile.py(184): emit(OPCODES[op])
|
|
sre_compile.py(185): if op is NEGATE:
|
|
sre_compile.py(187): elif op is LITERAL:
|
|
sre_compile.py(188): emit(fixup(av))
|
|
--- modulename: sre_compile, funcname: _identityfunction
|
|
sre_compile.py(25): return x
|
|
sre_compile.py(183): for op, av in _optimize_charset(charset, fixup):
|
|
sre_compile.py(205): emit(OPCODES[FAILURE])
|
|
sre_compile.py(58): code[skip] = _len(code) - skip
|
|
sre_compile.py(40): for op, av in pattern:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(102): if av[0]:
|
|
sre_compile.py(103): emit(OPCODES[MARK])
|
|
sre_compile.py(104): emit((av[0]-1)*2+1)
|
|
sre_compile.py(40): for op, av in pattern:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(41): if op in LITERAL_CODES:
|
|
sre_compile.py(48): elif op is IN:
|
|
sre_compile.py(59): elif op is ANY:
|
|
sre_compile.py(64): elif op in REPEATING_CODES:
|
|
sre_compile.py(65): if flags & SRE_FLAG_TEMPLATE:
|
|
sre_compile.py(74): elif _simple(av) and op is not REPEAT:
|
|
--- modulename: sre_compile, funcname: _simple
|
|
sre_compile.py(356): lo, hi = av[2].getwidth()
|
|
--- modulename: sre_parse, funcname: getwidth
|
|
sre_parse.py(142): if self.width:
|
|
sre_parse.py(143): return self.width
|
|
sre_compile.py(357): return lo == hi == 1 and av[2][0][0] != SUBPATTERN
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(75): if op is MAX_REPEAT:
|
|
sre_compile.py(76): emit(OPCODES[REPEAT_ONE])
|
|
sre_compile.py(79): skip = _len(code); emit(0)
|
|
sre_compile.py(80): emit(av[0])
|
|
sre_compile.py(81): emit(av[1])
|
|
sre_compile.py(82): _compile(code, av[2], flags)
|
|
--- modulename: sre_compile, funcname: _compile
|
|
sre_compile.py(34): emit = code.append
|
|
sre_compile.py(35): _len = len
|
|
sre_compile.py(36): LITERAL_CODES = _LITERAL_CODES
|
|
sre_compile.py(37): REPEATING_CODES = _REPEATING_CODES
|
|
sre_compile.py(38): SUCCESS_CODES = _SUCCESS_CODES
|
|
sre_compile.py(39): ASSERT_CODES = _ASSERT_CODES
|
|
sre_compile.py(40): for op, av in pattern:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(41): if op in LITERAL_CODES:
|
|
sre_compile.py(48): elif op is IN:
|
|
sre_compile.py(49): if flags & SRE_FLAG_IGNORECASE:
|
|
sre_compile.py(54): emit(OPCODES[op])
|
|
sre_compile.py(55): fixup = _identityfunction
|
|
sre_compile.py(56): skip = _len(code); emit(0)
|
|
sre_compile.py(57): _compile_charset(av, flags, code, fixup)
|
|
--- modulename: sre_compile, funcname: _compile_charset
|
|
sre_compile.py(180): emit = code.append
|
|
sre_compile.py(181): if fixup is None:
|
|
sre_compile.py(183): for op, av in _optimize_charset(charset, fixup):
|
|
--- modulename: sre_compile, funcname: _optimize_charset
|
|
sre_compile.py(209): out = []
|
|
sre_compile.py(210): outappend = out.append
|
|
sre_compile.py(211): charmap = [0]*256
|
|
sre_compile.py(212): try:
|
|
sre_compile.py(213): for op, av in charset:
|
|
sre_compile.py(214): if op is NEGATE:
|
|
sre_compile.py(216): elif op is LITERAL:
|
|
sre_compile.py(218): elif op is RANGE:
|
|
sre_compile.py(221): elif op is CATEGORY:
|
|
sre_compile.py(223): return charset # cannot compress
|
|
sre_compile.py(184): emit(OPCODES[op])
|
|
sre_compile.py(185): if op is NEGATE:
|
|
sre_compile.py(187): elif op is LITERAL:
|
|
sre_compile.py(189): elif op is RANGE:
|
|
sre_compile.py(192): elif op is CHARSET:
|
|
sre_compile.py(194): elif op is BIGCHARSET:
|
|
sre_compile.py(196): elif op is CATEGORY:
|
|
sre_compile.py(197): if flags & SRE_FLAG_LOCALE:
|
|
sre_compile.py(199): elif flags & SRE_FLAG_UNICODE:
|
|
sre_compile.py(202): emit(CHCODES[av])
|
|
sre_compile.py(183): for op, av in _optimize_charset(charset, fixup):
|
|
sre_compile.py(205): emit(OPCODES[FAILURE])
|
|
sre_compile.py(58): code[skip] = _len(code) - skip
|
|
sre_compile.py(40): for op, av in pattern:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(83): emit(OPCODES[SUCCESS])
|
|
sre_compile.py(84): code[skip] = _len(code) - skip
|
|
sre_compile.py(40): for op, av in pattern:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(41): if op in LITERAL_CODES:
|
|
sre_compile.py(48): elif op is IN:
|
|
sre_compile.py(59): elif op is ANY:
|
|
sre_compile.py(64): elif op in REPEATING_CODES:
|
|
sre_compile.py(96): elif op is SUBPATTERN:
|
|
sre_compile.py(97): if av[0]:
|
|
sre_compile.py(98): emit(OPCODES[MARK])
|
|
sre_compile.py(99): emit((av[0]-1)*2)
|
|
sre_compile.py(101): _compile(code, av[1], flags)
|
|
--- modulename: sre_compile, funcname: _compile
|
|
sre_compile.py(34): emit = code.append
|
|
sre_compile.py(35): _len = len
|
|
sre_compile.py(36): LITERAL_CODES = _LITERAL_CODES
|
|
sre_compile.py(37): REPEATING_CODES = _REPEATING_CODES
|
|
sre_compile.py(38): SUCCESS_CODES = _SUCCESS_CODES
|
|
sre_compile.py(39): ASSERT_CODES = _ASSERT_CODES
|
|
sre_compile.py(40): for op, av in pattern:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(41): if op in LITERAL_CODES:
|
|
sre_compile.py(48): elif op is IN:
|
|
sre_compile.py(59): elif op is ANY:
|
|
sre_compile.py(64): elif op in REPEATING_CODES:
|
|
sre_compile.py(65): if flags & SRE_FLAG_TEMPLATE:
|
|
sre_compile.py(74): elif _simple(av) and op is not REPEAT:
|
|
--- modulename: sre_compile, funcname: _simple
|
|
sre_compile.py(356): lo, hi = av[2].getwidth()
|
|
--- modulename: sre_parse, funcname: getwidth
|
|
sre_parse.py(142): if self.width:
|
|
sre_parse.py(143): return self.width
|
|
sre_compile.py(357): return lo == hi == 1 and av[2][0][0] != SUBPATTERN
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(75): if op is MAX_REPEAT:
|
|
sre_compile.py(76): emit(OPCODES[REPEAT_ONE])
|
|
sre_compile.py(79): skip = _len(code); emit(0)
|
|
sre_compile.py(80): emit(av[0])
|
|
sre_compile.py(81): emit(av[1])
|
|
sre_compile.py(82): _compile(code, av[2], flags)
|
|
--- modulename: sre_compile, funcname: _compile
|
|
sre_compile.py(34): emit = code.append
|
|
sre_compile.py(35): _len = len
|
|
sre_compile.py(36): LITERAL_CODES = _LITERAL_CODES
|
|
sre_compile.py(37): REPEATING_CODES = _REPEATING_CODES
|
|
sre_compile.py(38): SUCCESS_CODES = _SUCCESS_CODES
|
|
sre_compile.py(39): ASSERT_CODES = _ASSERT_CODES
|
|
sre_compile.py(40): for op, av in pattern:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(41): if op in LITERAL_CODES:
|
|
sre_compile.py(48): elif op is IN:
|
|
sre_compile.py(59): elif op is ANY:
|
|
sre_compile.py(60): if flags & SRE_FLAG_DOTALL:
|
|
sre_compile.py(63): emit(OPCODES[ANY])
|
|
sre_compile.py(40): for op, av in pattern:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(83): emit(OPCODES[SUCCESS])
|
|
sre_compile.py(84): code[skip] = _len(code) - skip
|
|
sre_compile.py(40): for op, av in pattern:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(102): if av[0]:
|
|
sre_compile.py(103): emit(OPCODES[MARK])
|
|
sre_compile.py(104): emit((av[0]-1)*2+1)
|
|
sre_compile.py(40): for op, av in pattern:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(102): if av[0]:
|
|
sre_compile.py(40): for op, av in pattern:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(91): code[skip] = _len(code) - skip
|
|
sre_compile.py(92): if op is MAX_REPEAT:
|
|
sre_compile.py(93): emit(OPCODES[MAX_UNTIL])
|
|
sre_compile.py(40): for op, av in pattern:
|
|
sre_compile.py(41): if op in LITERAL_CODES:
|
|
sre_compile.py(48): elif op is IN:
|
|
sre_compile.py(59): elif op is ANY:
|
|
sre_compile.py(64): elif op in REPEATING_CODES:
|
|
sre_compile.py(96): elif op is SUBPATTERN:
|
|
sre_compile.py(105): elif op in SUCCESS_CODES:
|
|
sre_compile.py(107): elif op in ASSERT_CODES:
|
|
sre_compile.py(120): elif op is CALL:
|
|
sre_compile.py(126): elif op is AT:
|
|
sre_compile.py(127): emit(OPCODES[op])
|
|
sre_compile.py(128): if flags & SRE_FLAG_MULTILINE:
|
|
sre_compile.py(130): if flags & SRE_FLAG_LOCALE:
|
|
sre_compile.py(132): elif flags & SRE_FLAG_UNICODE:
|
|
sre_compile.py(134): emit(ATCODES[av])
|
|
sre_compile.py(40): for op, av in pattern:
|
|
sre_compile.py(489): code.append(OPCODES[SUCCESS])
|
|
sre_compile.py(491): return code
|
|
sre_compile.py(507): if p.pattern.groups > 100:
|
|
sre_compile.py(513): groupindex = p.pattern.groupdict
|
|
sre_compile.py(514): indexgroup = [None] * p.pattern.groups
|
|
sre_compile.py(515): for k, i in groupindex.items():
|
|
sre_compile.py(516): indexgroup[i] = k
|
|
sre_compile.py(515): for k, i in groupindex.items():
|
|
sre_compile.py(516): indexgroup[i] = k
|
|
sre_compile.py(515): for k, i in groupindex.items():
|
|
sre_compile.py(516): indexgroup[i] = k
|
|
sre_compile.py(515): for k, i in groupindex.items():
|
|
sre_compile.py(518): return _sre.compile(
|
|
sre_compile.py(519): pattern, flags | p.pattern.flags, code,
|
|
sre_compile.py(520): p.pattern.groups-1,
|
|
sre_compile.py(521): groupindex, indexgroup
|
|
re.py(245): if not bypass_cache:
|
|
re.py(246): if len(_cache) >= _MAXCACHE:
|
|
re.py(248): _cache[cachekey] = p
|
|
re.py(249): return p
|
|
ConfigParser.py(464): def _read(self, fp, fpname):
|
|
ConfigParser.py(556): import UserDict as _UserDict
|
|
ConfigParser.py(558): class _Chainmap(_UserDict.DictMixin):
|
|
--- modulename: ConfigParser, funcname: _Chainmap
|
|
ConfigParser.py(558): class _Chainmap(_UserDict.DictMixin):
|
|
ConfigParser.py(565): """
|
|
ConfigParser.py(567): def __init__(self, *maps):
|
|
ConfigParser.py(570): def __getitem__(self, key):
|
|
ConfigParser.py(578): def keys(self):
|
|
ConfigParser.py(588): class ConfigParser(RawConfigParser):
|
|
--- modulename: ConfigParser, funcname: ConfigParser
|
|
ConfigParser.py(588): class ConfigParser(RawConfigParser):
|
|
ConfigParser.py(590): def get(self, section, option, raw=False, vars=None):
|
|
ConfigParser.py(625): def items(self, section, raw=False, vars=None):
|
|
ConfigParser.py(657): def _interpolate(self, section, option, rawval, vars):
|
|
ConfigParser.py(676): _KEYCRE = re.compile(r"%\(([^)]*)\)s|.")
|
|
--- modulename: re, funcname: compile
|
|
re.py(190): return _compile(pattern, flags)
|
|
--- modulename: re, funcname: _compile
|
|
re.py(228): pattern, flags = key
|
|
re.py(229): bypass_cache = flags & DEBUG
|
|
re.py(230): if not bypass_cache:
|
|
re.py(231): cachekey = (type(key[0]),) + key
|
|
re.py(232): p = _cache.get(cachekey)
|
|
re.py(233): if p is not None:
|
|
re.py(235): if isinstance(pattern, _pattern_type):
|
|
re.py(239): if not sre_compile.isstring(pattern):
|
|
--- modulename: sre_compile, funcname: isstring
|
|
sre_compile.py(473): for tp in STRING_TYPES:
|
|
sre_compile.py(474): if isinstance(obj, tp):
|
|
sre_compile.py(475): return 1
|
|
re.py(241): try:
|
|
re.py(242): p = sre_compile.compile(pattern, flags)
|
|
--- modulename: sre_compile, funcname: compile
|
|
sre_compile.py(496): if isstring(p):
|
|
--- modulename: sre_compile, funcname: isstring
|
|
sre_compile.py(473): for tp in STRING_TYPES:
|
|
sre_compile.py(474): if isinstance(obj, tp):
|
|
sre_compile.py(475): return 1
|
|
sre_compile.py(497): pattern = p
|
|
sre_compile.py(498): p = sre_parse.parse(p, flags)
|
|
--- modulename: sre_parse, funcname: parse
|
|
sre_parse.py(678): source = Tokenizer(str)
|
|
--- modulename: sre_parse, funcname: __init__
|
|
sre_parse.py(179): self.string = string
|
|
sre_parse.py(180): self.index = 0
|
|
sre_parse.py(181): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(680): if pattern is None:
|
|
sre_parse.py(681): pattern = Pattern()
|
|
--- modulename: sre_parse, funcname: __init__
|
|
sre_parse.py(68): self.flags = 0
|
|
sre_parse.py(69): self.open = []
|
|
sre_parse.py(70): self.groups = 1
|
|
sre_parse.py(71): self.groupdict = {}
|
|
sre_parse.py(682): pattern.flags = flags
|
|
sre_parse.py(683): pattern.str = str
|
|
sre_parse.py(685): p = _parse_sub(source, pattern, 0)
|
|
--- modulename: sre_parse, funcname: _parse_sub
|
|
sre_parse.py(304): items = []
|
|
sre_parse.py(305): itemsappend = items.append
|
|
sre_parse.py(306): sourcematch = source.match
|
|
sre_parse.py(307): while 1:
|
|
sre_parse.py(308): itemsappend(_parse(source, state))
|
|
--- modulename: sre_parse, funcname: _parse
|
|
sre_parse.py(381): subpattern = SubPattern(state)
|
|
--- modulename: sre_parse, funcname: __init__
|
|
sre_parse.py(91): self.pattern = pattern
|
|
sre_parse.py(92): if data is None:
|
|
sre_parse.py(93): data = []
|
|
sre_parse.py(94): self.data = data
|
|
sre_parse.py(95): self.width = None
|
|
sre_parse.py(384): subpatternappend = subpattern.append
|
|
sre_parse.py(385): sourceget = source.get
|
|
sre_parse.py(386): sourcematch = source.match
|
|
sre_parse.py(387): _len = len
|
|
sre_parse.py(388): PATTERNENDERS = _PATTERNENDERS
|
|
sre_parse.py(389): ASSERTCHARS = _ASSERTCHARS
|
|
sre_parse.py(390): LOOKBEHINDASSERTCHARS = _LOOKBEHINDASSERTCHARS
|
|
sre_parse.py(391): REPEATCODES = _REPEATCODES
|
|
sre_parse.py(393): while 1:
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(397): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(188): try:
|
|
sre_parse.py(189): c = self.string[self.index + 1]
|
|
sre_parse.py(192): char = char + c
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(398): if this is None:
|
|
sre_parse.py(401): if state.flags & SRE_FLAG_VERBOSE:
|
|
sre_parse.py(412): if this and this[0] not in SPECIAL_CHARS:
|
|
sre_parse.py(413): subpatternappend((LITERAL, ord(this)))
|
|
--- modulename: sre_parse, funcname: append
|
|
sre_parse.py(139): self.data.append(code)
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(397): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(398): if this is None:
|
|
sre_parse.py(401): if state.flags & SRE_FLAG_VERBOSE:
|
|
sre_parse.py(412): if this and this[0] not in SPECIAL_CHARS:
|
|
sre_parse.py(415): elif this == "[":
|
|
sre_parse.py(472): elif this and this[0] in REPEAT_CHARS:
|
|
sre_parse.py(525): elif this == ".":
|
|
sre_parse.py(528): elif this == "(":
|
|
sre_parse.py(660): elif this == "^":
|
|
sre_parse.py(663): elif this == "$":
|
|
sre_parse.py(666): elif this and this[0] == "\\":
|
|
sre_parse.py(667): code = _escape(source, this, state)
|
|
--- modulename: sre_parse, funcname: _escape
|
|
sre_parse.py(259): code = CATEGORIES.get(escape)
|
|
sre_parse.py(260): if code:
|
|
sre_parse.py(262): code = ESCAPES.get(escape)
|
|
sre_parse.py(263): if code:
|
|
sre_parse.py(265): try:
|
|
sre_parse.py(266): c = escape[1:2]
|
|
sre_parse.py(267): if c == "x":
|
|
sre_parse.py(274): elif c == "0":
|
|
sre_parse.py(279): elif c in DIGITS:
|
|
sre_parse.py(295): if len(escape) == 2:
|
|
sre_parse.py(296): return LITERAL, ord(escape[1])
|
|
sre_parse.py(668): subpatternappend(code)
|
|
--- modulename: sre_parse, funcname: append
|
|
sre_parse.py(139): self.data.append(code)
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(397): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(398): if this is None:
|
|
sre_parse.py(401): if state.flags & SRE_FLAG_VERBOSE:
|
|
sre_parse.py(412): if this and this[0] not in SPECIAL_CHARS:
|
|
sre_parse.py(415): elif this == "[":
|
|
sre_parse.py(472): elif this and this[0] in REPEAT_CHARS:
|
|
sre_parse.py(525): elif this == ".":
|
|
sre_parse.py(528): elif this == "(":
|
|
sre_parse.py(529): group = 1
|
|
sre_parse.py(530): name = None
|
|
sre_parse.py(531): condgroup = None
|
|
sre_parse.py(532): if sourcematch("?"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(635): if group:
|
|
sre_parse.py(637): if group == 2:
|
|
sre_parse.py(641): group = state.opengroup(name)
|
|
--- modulename: sre_parse, funcname: opengroup
|
|
sre_parse.py(73): gid = self.groups
|
|
sre_parse.py(74): self.groups = gid + 1
|
|
sre_parse.py(75): if name is not None:
|
|
sre_parse.py(81): self.open.append(gid)
|
|
sre_parse.py(82): return gid
|
|
sre_parse.py(642): if condgroup:
|
|
sre_parse.py(645): p = _parse_sub(source, state)
|
|
--- modulename: sre_parse, funcname: _parse_sub
|
|
sre_parse.py(304): items = []
|
|
sre_parse.py(305): itemsappend = items.append
|
|
sre_parse.py(306): sourcematch = source.match
|
|
sre_parse.py(307): while 1:
|
|
sre_parse.py(308): itemsappend(_parse(source, state))
|
|
--- modulename: sre_parse, funcname: _parse
|
|
sre_parse.py(381): subpattern = SubPattern(state)
|
|
--- modulename: sre_parse, funcname: __init__
|
|
sre_parse.py(91): self.pattern = pattern
|
|
sre_parse.py(92): if data is None:
|
|
sre_parse.py(93): data = []
|
|
sre_parse.py(94): self.data = data
|
|
sre_parse.py(95): self.width = None
|
|
sre_parse.py(384): subpatternappend = subpattern.append
|
|
sre_parse.py(385): sourceget = source.get
|
|
sre_parse.py(386): sourcematch = source.match
|
|
sre_parse.py(387): _len = len
|
|
sre_parse.py(388): PATTERNENDERS = _PATTERNENDERS
|
|
sre_parse.py(389): ASSERTCHARS = _ASSERTCHARS
|
|
sre_parse.py(390): LOOKBEHINDASSERTCHARS = _LOOKBEHINDASSERTCHARS
|
|
sre_parse.py(391): REPEATCODES = _REPEATCODES
|
|
sre_parse.py(393): while 1:
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(397): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(398): if this is None:
|
|
sre_parse.py(401): if state.flags & SRE_FLAG_VERBOSE:
|
|
sre_parse.py(412): if this and this[0] not in SPECIAL_CHARS:
|
|
sre_parse.py(415): elif this == "[":
|
|
sre_parse.py(417): set = []
|
|
sre_parse.py(418): setappend = set.append
|
|
sre_parse.py(421): if sourcematch("^"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(197): if skip:
|
|
sre_parse.py(198): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(199): return 1
|
|
sre_parse.py(422): setappend((NEGATE, None))
|
|
sre_parse.py(424): start = set[:]
|
|
sre_parse.py(425): while 1:
|
|
sre_parse.py(426): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(427): if this == "]" and set != start:
|
|
sre_parse.py(429): elif this and this[0] == "\\":
|
|
sre_parse.py(431): elif this:
|
|
sre_parse.py(432): code1 = LITERAL, ord(this)
|
|
sre_parse.py(435): if sourcematch("-"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(459): if code1[0] is IN:
|
|
sre_parse.py(461): setappend(code1)
|
|
sre_parse.py(426): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(427): if this == "]" and set != start:
|
|
sre_parse.py(428): break
|
|
sre_parse.py(464): if _len(set)==1 and set[0][0] is LITERAL:
|
|
sre_parse.py(466): elif _len(set)==2 and set[0][0] is NEGATE and set[1][0] is LITERAL:
|
|
sre_parse.py(467): subpatternappend((NOT_LITERAL, set[1][1])) # optimization
|
|
--- modulename: sre_parse, funcname: append
|
|
sre_parse.py(139): self.data.append(code)
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(397): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(398): if this is None:
|
|
sre_parse.py(401): if state.flags & SRE_FLAG_VERBOSE:
|
|
sre_parse.py(412): if this and this[0] not in SPECIAL_CHARS:
|
|
sre_parse.py(415): elif this == "[":
|
|
sre_parse.py(472): elif this and this[0] in REPEAT_CHARS:
|
|
sre_parse.py(474): if this == "?":
|
|
sre_parse.py(476): elif this == "*":
|
|
sre_parse.py(477): min, max = 0, MAXREPEAT
|
|
sre_parse.py(512): if subpattern:
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
sre_parse.py(513): item = subpattern[-1:]
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(132): return SubPattern(self.pattern, self.data[index])
|
|
--- modulename: sre_parse, funcname: __init__
|
|
sre_parse.py(91): self.pattern = pattern
|
|
sre_parse.py(92): if data is None:
|
|
sre_parse.py(94): self.data = data
|
|
sre_parse.py(95): self.width = None
|
|
sre_parse.py(516): if not item or (_len(item) == 1 and item[0][0] == AT):
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_parse.py(518): if item[0][0] in REPEATCODES:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_parse.py(520): if sourcematch("?"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(523): subpattern[-1] = (MAX_REPEAT, (min, max, item))
|
|
--- modulename: sre_parse, funcname: __setitem__
|
|
sre_parse.py(135): self.data[index] = code
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(396): break # end of subpattern
|
|
sre_parse.py(673): return subpattern
|
|
sre_parse.py(309): if sourcematch("|"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(311): if not nested:
|
|
sre_parse.py(313): if not source.next or sourcematch(")", 0):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(197): if skip:
|
|
sre_parse.py(199): return 1
|
|
sre_parse.py(314): break
|
|
sre_parse.py(318): if len(items) == 1:
|
|
sre_parse.py(319): return items[0]
|
|
sre_parse.py(646): if not sourcematch(")"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(197): if skip:
|
|
sre_parse.py(198): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(188): try:
|
|
sre_parse.py(189): c = self.string[self.index + 1]
|
|
sre_parse.py(192): char = char + c
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(199): return 1
|
|
sre_parse.py(648): if group is not None:
|
|
sre_parse.py(649): state.closegroup(group)
|
|
--- modulename: sre_parse, funcname: closegroup
|
|
sre_parse.py(84): self.open.remove(gid)
|
|
sre_parse.py(650): subpatternappend((SUBPATTERN, (group, p)))
|
|
--- modulename: sre_parse, funcname: append
|
|
sre_parse.py(139): self.data.append(code)
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(397): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(398): if this is None:
|
|
sre_parse.py(401): if state.flags & SRE_FLAG_VERBOSE:
|
|
sre_parse.py(412): if this and this[0] not in SPECIAL_CHARS:
|
|
sre_parse.py(415): elif this == "[":
|
|
sre_parse.py(472): elif this and this[0] in REPEAT_CHARS:
|
|
sre_parse.py(525): elif this == ".":
|
|
sre_parse.py(528): elif this == "(":
|
|
sre_parse.py(660): elif this == "^":
|
|
sre_parse.py(663): elif this == "$":
|
|
sre_parse.py(666): elif this and this[0] == "\\":
|
|
sre_parse.py(667): code = _escape(source, this, state)
|
|
--- modulename: sre_parse, funcname: _escape
|
|
sre_parse.py(259): code = CATEGORIES.get(escape)
|
|
sre_parse.py(260): if code:
|
|
sre_parse.py(262): code = ESCAPES.get(escape)
|
|
sre_parse.py(263): if code:
|
|
sre_parse.py(265): try:
|
|
sre_parse.py(266): c = escape[1:2]
|
|
sre_parse.py(267): if c == "x":
|
|
sre_parse.py(274): elif c == "0":
|
|
sre_parse.py(279): elif c in DIGITS:
|
|
sre_parse.py(295): if len(escape) == 2:
|
|
sre_parse.py(296): return LITERAL, ord(escape[1])
|
|
sre_parse.py(668): subpatternappend(code)
|
|
--- modulename: sre_parse, funcname: append
|
|
sre_parse.py(139): self.data.append(code)
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(397): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(398): if this is None:
|
|
sre_parse.py(401): if state.flags & SRE_FLAG_VERBOSE:
|
|
sre_parse.py(412): if this and this[0] not in SPECIAL_CHARS:
|
|
sre_parse.py(413): subpatternappend((LITERAL, ord(this)))
|
|
--- modulename: sre_parse, funcname: append
|
|
sre_parse.py(139): self.data.append(code)
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(396): break # end of subpattern
|
|
sre_parse.py(673): return subpattern
|
|
sre_parse.py(309): if sourcematch("|"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(197): if skip:
|
|
sre_parse.py(198): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(199): return 1
|
|
sre_parse.py(310): continue
|
|
sre_parse.py(308): itemsappend(_parse(source, state))
|
|
--- modulename: sre_parse, funcname: _parse
|
|
sre_parse.py(381): subpattern = SubPattern(state)
|
|
--- modulename: sre_parse, funcname: __init__
|
|
sre_parse.py(91): self.pattern = pattern
|
|
sre_parse.py(92): if data is None:
|
|
sre_parse.py(93): data = []
|
|
sre_parse.py(94): self.data = data
|
|
sre_parse.py(95): self.width = None
|
|
sre_parse.py(384): subpatternappend = subpattern.append
|
|
sre_parse.py(385): sourceget = source.get
|
|
sre_parse.py(386): sourcematch = source.match
|
|
sre_parse.py(387): _len = len
|
|
sre_parse.py(388): PATTERNENDERS = _PATTERNENDERS
|
|
sre_parse.py(389): ASSERTCHARS = _ASSERTCHARS
|
|
sre_parse.py(390): LOOKBEHINDASSERTCHARS = _LOOKBEHINDASSERTCHARS
|
|
sre_parse.py(391): REPEATCODES = _REPEATCODES
|
|
sre_parse.py(393): while 1:
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(397): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(184): self.next = None
|
|
sre_parse.py(185): return
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(398): if this is None:
|
|
sre_parse.py(401): if state.flags & SRE_FLAG_VERBOSE:
|
|
sre_parse.py(412): if this and this[0] not in SPECIAL_CHARS:
|
|
sre_parse.py(415): elif this == "[":
|
|
sre_parse.py(472): elif this and this[0] in REPEAT_CHARS:
|
|
sre_parse.py(525): elif this == ".":
|
|
sre_parse.py(526): subpatternappend((ANY, None))
|
|
--- modulename: sre_parse, funcname: append
|
|
sre_parse.py(139): self.data.append(code)
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(397): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(184): self.next = None
|
|
sre_parse.py(185): return
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(398): if this is None:
|
|
sre_parse.py(399): break # end of pattern
|
|
sre_parse.py(673): return subpattern
|
|
sre_parse.py(309): if sourcematch("|"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(311): if not nested:
|
|
sre_parse.py(312): break
|
|
sre_parse.py(318): if len(items) == 1:
|
|
sre_parse.py(321): subpattern = SubPattern(state)
|
|
--- modulename: sre_parse, funcname: __init__
|
|
sre_parse.py(91): self.pattern = pattern
|
|
sre_parse.py(92): if data is None:
|
|
sre_parse.py(93): data = []
|
|
sre_parse.py(94): self.data = data
|
|
sre_parse.py(95): self.width = None
|
|
sre_parse.py(322): subpatternappend = subpattern.append
|
|
sre_parse.py(325): while 1:
|
|
sre_parse.py(326): prefix = None
|
|
sre_parse.py(327): for item in items:
|
|
sre_parse.py(328): if not item:
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
sre_parse.py(330): if prefix is None:
|
|
sre_parse.py(331): prefix = item[0]
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_parse.py(327): for item in items:
|
|
sre_parse.py(328): if not item:
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
sre_parse.py(330): if prefix is None:
|
|
sre_parse.py(332): elif item[0] != prefix:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_parse.py(333): break
|
|
sre_parse.py(341): break
|
|
sre_parse.py(344): for item in items:
|
|
sre_parse.py(345): if len(item) != 1 or item[0][0] != LITERAL:
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
sre_parse.py(346): break
|
|
sre_parse.py(357): subpattern.append((BRANCH, (None, items)))
|
|
--- modulename: sre_parse, funcname: append
|
|
sre_parse.py(139): self.data.append(code)
|
|
sre_parse.py(358): return subpattern
|
|
sre_parse.py(687): tail = source.get()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(184): self.next = None
|
|
sre_parse.py(185): return
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(688): if tail == ")":
|
|
sre_parse.py(690): elif tail:
|
|
sre_parse.py(693): if flags & SRE_FLAG_DEBUG:
|
|
sre_parse.py(696): if not (flags & SRE_FLAG_VERBOSE) and p.pattern.flags & SRE_FLAG_VERBOSE:
|
|
sre_parse.py(701): return p
|
|
sre_compile.py(502): code = _code(p, flags)
|
|
--- modulename: sre_compile, funcname: _code
|
|
sre_compile.py(480): flags = p.pattern.flags | flags
|
|
sre_compile.py(481): code = []
|
|
sre_compile.py(484): _compile_info(code, p, flags)
|
|
--- modulename: sre_compile, funcname: _compile_info
|
|
sre_compile.py(363): lo, hi = pattern.getwidth()
|
|
--- modulename: sre_parse, funcname: getwidth
|
|
sre_parse.py(142): if self.width:
|
|
sre_parse.py(144): lo = hi = 0
|
|
sre_parse.py(145): UNITCODES = (ANY, RANGE, IN, LITERAL, NOT_LITERAL, CATEGORY)
|
|
sre_parse.py(146): REPEATCODES = (MIN_REPEAT, MAX_REPEAT)
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(148): if op is BRANCH:
|
|
sre_parse.py(149): i = MAXREPEAT - 1
|
|
sre_parse.py(150): j = 0
|
|
sre_parse.py(151): for av in av[1]:
|
|
sre_parse.py(152): l, h = av.getwidth()
|
|
--- modulename: sre_parse, funcname: getwidth
|
|
sre_parse.py(142): if self.width:
|
|
sre_parse.py(144): lo = hi = 0
|
|
sre_parse.py(145): UNITCODES = (ANY, RANGE, IN, LITERAL, NOT_LITERAL, CATEGORY)
|
|
sre_parse.py(146): REPEATCODES = (MIN_REPEAT, MAX_REPEAT)
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(148): if op is BRANCH:
|
|
sre_parse.py(157): elif op is CALL:
|
|
sre_parse.py(161): elif op is SUBPATTERN:
|
|
sre_parse.py(165): elif op in REPEATCODES:
|
|
sre_parse.py(169): elif op in UNITCODES:
|
|
sre_parse.py(170): lo = lo + 1
|
|
sre_parse.py(171): hi = hi + 1
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(148): if op is BRANCH:
|
|
sre_parse.py(157): elif op is CALL:
|
|
sre_parse.py(161): elif op is SUBPATTERN:
|
|
sre_parse.py(165): elif op in REPEATCODES:
|
|
sre_parse.py(169): elif op in UNITCODES:
|
|
sre_parse.py(170): lo = lo + 1
|
|
sre_parse.py(171): hi = hi + 1
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(148): if op is BRANCH:
|
|
sre_parse.py(157): elif op is CALL:
|
|
sre_parse.py(161): elif op is SUBPATTERN:
|
|
sre_parse.py(162): i, j = av[1].getwidth()
|
|
--- modulename: sre_parse, funcname: getwidth
|
|
sre_parse.py(142): if self.width:
|
|
sre_parse.py(144): lo = hi = 0
|
|
sre_parse.py(145): UNITCODES = (ANY, RANGE, IN, LITERAL, NOT_LITERAL, CATEGORY)
|
|
sre_parse.py(146): REPEATCODES = (MIN_REPEAT, MAX_REPEAT)
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(148): if op is BRANCH:
|
|
sre_parse.py(157): elif op is CALL:
|
|
sre_parse.py(161): elif op is SUBPATTERN:
|
|
sre_parse.py(165): elif op in REPEATCODES:
|
|
sre_parse.py(166): i, j = av[2].getwidth()
|
|
--- modulename: sre_parse, funcname: getwidth
|
|
sre_parse.py(142): if self.width:
|
|
sre_parse.py(144): lo = hi = 0
|
|
sre_parse.py(145): UNITCODES = (ANY, RANGE, IN, LITERAL, NOT_LITERAL, CATEGORY)
|
|
sre_parse.py(146): REPEATCODES = (MIN_REPEAT, MAX_REPEAT)
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(148): if op is BRANCH:
|
|
sre_parse.py(157): elif op is CALL:
|
|
sre_parse.py(161): elif op is SUBPATTERN:
|
|
sre_parse.py(165): elif op in REPEATCODES:
|
|
sre_parse.py(169): elif op in UNITCODES:
|
|
sre_parse.py(170): lo = lo + 1
|
|
sre_parse.py(171): hi = hi + 1
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(174): self.width = min(lo, MAXREPEAT - 1), min(hi, MAXREPEAT)
|
|
sre_parse.py(175): return self.width
|
|
sre_parse.py(167): lo = lo + i * av[0]
|
|
sre_parse.py(168): hi = hi + j * av[1]
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(174): self.width = min(lo, MAXREPEAT - 1), min(hi, MAXREPEAT)
|
|
sre_parse.py(175): return self.width
|
|
sre_parse.py(163): lo = lo + i
|
|
sre_parse.py(164): hi = hi + j
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(148): if op is BRANCH:
|
|
sre_parse.py(157): elif op is CALL:
|
|
sre_parse.py(161): elif op is SUBPATTERN:
|
|
sre_parse.py(165): elif op in REPEATCODES:
|
|
sre_parse.py(169): elif op in UNITCODES:
|
|
sre_parse.py(170): lo = lo + 1
|
|
sre_parse.py(171): hi = hi + 1
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(148): if op is BRANCH:
|
|
sre_parse.py(157): elif op is CALL:
|
|
sre_parse.py(161): elif op is SUBPATTERN:
|
|
sre_parse.py(165): elif op in REPEATCODES:
|
|
sre_parse.py(169): elif op in UNITCODES:
|
|
sre_parse.py(170): lo = lo + 1
|
|
sre_parse.py(171): hi = hi + 1
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(174): self.width = min(lo, MAXREPEAT - 1), min(hi, MAXREPEAT)
|
|
sre_parse.py(175): return self.width
|
|
sre_parse.py(153): i = min(i, l)
|
|
sre_parse.py(154): j = max(j, h)
|
|
sre_parse.py(151): for av in av[1]:
|
|
sre_parse.py(152): l, h = av.getwidth()
|
|
--- modulename: sre_parse, funcname: getwidth
|
|
sre_parse.py(142): if self.width:
|
|
sre_parse.py(144): lo = hi = 0
|
|
sre_parse.py(145): UNITCODES = (ANY, RANGE, IN, LITERAL, NOT_LITERAL, CATEGORY)
|
|
sre_parse.py(146): REPEATCODES = (MIN_REPEAT, MAX_REPEAT)
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(148): if op is BRANCH:
|
|
sre_parse.py(157): elif op is CALL:
|
|
sre_parse.py(161): elif op is SUBPATTERN:
|
|
sre_parse.py(165): elif op in REPEATCODES:
|
|
sre_parse.py(169): elif op in UNITCODES:
|
|
sre_parse.py(170): lo = lo + 1
|
|
sre_parse.py(171): hi = hi + 1
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(174): self.width = min(lo, MAXREPEAT - 1), min(hi, MAXREPEAT)
|
|
sre_parse.py(175): return self.width
|
|
sre_parse.py(153): i = min(i, l)
|
|
sre_parse.py(154): j = max(j, h)
|
|
sre_parse.py(151): for av in av[1]:
|
|
sre_parse.py(155): lo = lo + i
|
|
sre_parse.py(156): hi = hi + j
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(174): self.width = min(lo, MAXREPEAT - 1), min(hi, MAXREPEAT)
|
|
sre_parse.py(175): return self.width
|
|
sre_compile.py(364): if lo == 0:
|
|
sre_compile.py(367): prefix = []
|
|
sre_compile.py(368): prefixappend = prefix.append
|
|
sre_compile.py(369): prefix_skip = 0
|
|
sre_compile.py(370): charset = [] # not used
|
|
sre_compile.py(371): charsetappend = charset.append
|
|
sre_compile.py(372): if not (flags & SRE_FLAG_IGNORECASE):
|
|
sre_compile.py(374): for op, av in pattern.data:
|
|
sre_compile.py(375): if op is LITERAL:
|
|
sre_compile.py(379): elif op is SUBPATTERN and len(av[1]) == 1:
|
|
sre_compile.py(386): break
|
|
sre_compile.py(388): if not prefix and pattern.data:
|
|
sre_compile.py(389): op, av = pattern.data[0]
|
|
sre_compile.py(390): if op is SUBPATTERN and av[1]:
|
|
sre_compile.py(407): elif op is BRANCH:
|
|
sre_compile.py(408): c = []
|
|
sre_compile.py(409): cappend = c.append
|
|
sre_compile.py(410): for p in av[1]:
|
|
sre_compile.py(411): if not p:
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
sre_compile.py(413): op, av = p[0]
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(414): if op is LITERAL:
|
|
sre_compile.py(415): cappend((op, av))
|
|
sre_compile.py(410): for p in av[1]:
|
|
sre_compile.py(411): if not p:
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
sre_compile.py(413): op, av = p[0]
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(414): if op is LITERAL:
|
|
sre_compile.py(417): break
|
|
sre_compile.py(427): emit = code.append
|
|
sre_compile.py(428): emit(OPCODES[INFO])
|
|
sre_compile.py(429): skip = len(code); emit(0)
|
|
sre_compile.py(431): mask = 0
|
|
sre_compile.py(432): if prefix:
|
|
sre_compile.py(436): elif charset:
|
|
sre_compile.py(438): emit(mask)
|
|
sre_compile.py(440): if lo < MAXCODE:
|
|
sre_compile.py(441): emit(lo)
|
|
sre_compile.py(445): if hi < MAXCODE:
|
|
sre_compile.py(448): emit(0)
|
|
sre_compile.py(450): if prefix:
|
|
sre_compile.py(461): elif charset:
|
|
sre_compile.py(463): code[skip] = len(code) - skip
|
|
sre_compile.py(487): _compile(code, p.data, flags)
|
|
--- modulename: sre_compile, funcname: _compile
|
|
sre_compile.py(34): emit = code.append
|
|
sre_compile.py(35): _len = len
|
|
sre_compile.py(36): LITERAL_CODES = _LITERAL_CODES
|
|
sre_compile.py(37): REPEATING_CODES = _REPEATING_CODES
|
|
sre_compile.py(38): SUCCESS_CODES = _SUCCESS_CODES
|
|
sre_compile.py(39): ASSERT_CODES = _ASSERT_CODES
|
|
sre_compile.py(40): for op, av in pattern:
|
|
sre_compile.py(41): if op in LITERAL_CODES:
|
|
sre_compile.py(48): elif op is IN:
|
|
sre_compile.py(59): elif op is ANY:
|
|
sre_compile.py(64): elif op in REPEATING_CODES:
|
|
sre_compile.py(96): elif op is SUBPATTERN:
|
|
sre_compile.py(105): elif op in SUCCESS_CODES:
|
|
sre_compile.py(107): elif op in ASSERT_CODES:
|
|
sre_compile.py(120): elif op is CALL:
|
|
sre_compile.py(126): elif op is AT:
|
|
sre_compile.py(135): elif op is BRANCH:
|
|
sre_compile.py(136): emit(OPCODES[op])
|
|
sre_compile.py(137): tail = []
|
|
sre_compile.py(138): tailappend = tail.append
|
|
sre_compile.py(139): for av in av[1]:
|
|
sre_compile.py(140): skip = _len(code); emit(0)
|
|
sre_compile.py(142): _compile(code, av, flags)
|
|
--- modulename: sre_compile, funcname: _compile
|
|
sre_compile.py(34): emit = code.append
|
|
sre_compile.py(35): _len = len
|
|
sre_compile.py(36): LITERAL_CODES = _LITERAL_CODES
|
|
sre_compile.py(37): REPEATING_CODES = _REPEATING_CODES
|
|
sre_compile.py(38): SUCCESS_CODES = _SUCCESS_CODES
|
|
sre_compile.py(39): ASSERT_CODES = _ASSERT_CODES
|
|
sre_compile.py(40): for op, av in pattern:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(41): if op in LITERAL_CODES:
|
|
sre_compile.py(42): if flags & SRE_FLAG_IGNORECASE:
|
|
sre_compile.py(46): emit(OPCODES[op])
|
|
sre_compile.py(47): emit(av)
|
|
sre_compile.py(40): for op, av in pattern:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(41): if op in LITERAL_CODES:
|
|
sre_compile.py(42): if flags & SRE_FLAG_IGNORECASE:
|
|
sre_compile.py(46): emit(OPCODES[op])
|
|
sre_compile.py(47): emit(av)
|
|
sre_compile.py(40): for op, av in pattern:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(41): if op in LITERAL_CODES:
|
|
sre_compile.py(48): elif op is IN:
|
|
sre_compile.py(59): elif op is ANY:
|
|
sre_compile.py(64): elif op in REPEATING_CODES:
|
|
sre_compile.py(96): elif op is SUBPATTERN:
|
|
sre_compile.py(97): if av[0]:
|
|
sre_compile.py(98): emit(OPCODES[MARK])
|
|
sre_compile.py(99): emit((av[0]-1)*2)
|
|
sre_compile.py(101): _compile(code, av[1], flags)
|
|
--- modulename: sre_compile, funcname: _compile
|
|
sre_compile.py(34): emit = code.append
|
|
sre_compile.py(35): _len = len
|
|
sre_compile.py(36): LITERAL_CODES = _LITERAL_CODES
|
|
sre_compile.py(37): REPEATING_CODES = _REPEATING_CODES
|
|
sre_compile.py(38): SUCCESS_CODES = _SUCCESS_CODES
|
|
sre_compile.py(39): ASSERT_CODES = _ASSERT_CODES
|
|
sre_compile.py(40): for op, av in pattern:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(41): if op in LITERAL_CODES:
|
|
sre_compile.py(48): elif op is IN:
|
|
sre_compile.py(59): elif op is ANY:
|
|
sre_compile.py(64): elif op in REPEATING_CODES:
|
|
sre_compile.py(65): if flags & SRE_FLAG_TEMPLATE:
|
|
sre_compile.py(74): elif _simple(av) and op is not REPEAT:
|
|
--- modulename: sre_compile, funcname: _simple
|
|
sre_compile.py(356): lo, hi = av[2].getwidth()
|
|
--- modulename: sre_parse, funcname: getwidth
|
|
sre_parse.py(142): if self.width:
|
|
sre_parse.py(143): return self.width
|
|
sre_compile.py(357): return lo == hi == 1 and av[2][0][0] != SUBPATTERN
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(75): if op is MAX_REPEAT:
|
|
sre_compile.py(76): emit(OPCODES[REPEAT_ONE])
|
|
sre_compile.py(79): skip = _len(code); emit(0)
|
|
sre_compile.py(80): emit(av[0])
|
|
sre_compile.py(81): emit(av[1])
|
|
sre_compile.py(82): _compile(code, av[2], flags)
|
|
--- modulename: sre_compile, funcname: _compile
|
|
sre_compile.py(34): emit = code.append
|
|
sre_compile.py(35): _len = len
|
|
sre_compile.py(36): LITERAL_CODES = _LITERAL_CODES
|
|
sre_compile.py(37): REPEATING_CODES = _REPEATING_CODES
|
|
sre_compile.py(38): SUCCESS_CODES = _SUCCESS_CODES
|
|
sre_compile.py(39): ASSERT_CODES = _ASSERT_CODES
|
|
sre_compile.py(40): for op, av in pattern:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(41): if op in LITERAL_CODES:
|
|
sre_compile.py(42): if flags & SRE_FLAG_IGNORECASE:
|
|
sre_compile.py(46): emit(OPCODES[op])
|
|
sre_compile.py(47): emit(av)
|
|
sre_compile.py(40): for op, av in pattern:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(83): emit(OPCODES[SUCCESS])
|
|
sre_compile.py(84): code[skip] = _len(code) - skip
|
|
sre_compile.py(40): for op, av in pattern:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(102): if av[0]:
|
|
sre_compile.py(103): emit(OPCODES[MARK])
|
|
sre_compile.py(104): emit((av[0]-1)*2+1)
|
|
sre_compile.py(40): for op, av in pattern:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(41): if op in LITERAL_CODES:
|
|
sre_compile.py(42): if flags & SRE_FLAG_IGNORECASE:
|
|
sre_compile.py(46): emit(OPCODES[op])
|
|
sre_compile.py(47): emit(av)
|
|
sre_compile.py(40): for op, av in pattern:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(41): if op in LITERAL_CODES:
|
|
sre_compile.py(42): if flags & SRE_FLAG_IGNORECASE:
|
|
sre_compile.py(46): emit(OPCODES[op])
|
|
sre_compile.py(47): emit(av)
|
|
sre_compile.py(40): for op, av in pattern:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(143): emit(OPCODES[JUMP])
|
|
sre_compile.py(144): tailappend(_len(code)); emit(0)
|
|
sre_compile.py(145): code[skip] = _len(code) - skip
|
|
sre_compile.py(139): for av in av[1]:
|
|
sre_compile.py(140): skip = _len(code); emit(0)
|
|
sre_compile.py(142): _compile(code, av, flags)
|
|
--- modulename: sre_compile, funcname: _compile
|
|
sre_compile.py(34): emit = code.append
|
|
sre_compile.py(35): _len = len
|
|
sre_compile.py(36): LITERAL_CODES = _LITERAL_CODES
|
|
sre_compile.py(37): REPEATING_CODES = _REPEATING_CODES
|
|
sre_compile.py(38): SUCCESS_CODES = _SUCCESS_CODES
|
|
sre_compile.py(39): ASSERT_CODES = _ASSERT_CODES
|
|
sre_compile.py(40): for op, av in pattern:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(41): if op in LITERAL_CODES:
|
|
sre_compile.py(48): elif op is IN:
|
|
sre_compile.py(59): elif op is ANY:
|
|
sre_compile.py(60): if flags & SRE_FLAG_DOTALL:
|
|
sre_compile.py(63): emit(OPCODES[ANY])
|
|
sre_compile.py(40): for op, av in pattern:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(143): emit(OPCODES[JUMP])
|
|
sre_compile.py(144): tailappend(_len(code)); emit(0)
|
|
sre_compile.py(145): code[skip] = _len(code) - skip
|
|
sre_compile.py(139): for av in av[1]:
|
|
sre_compile.py(146): emit(0) # end of branch
|
|
sre_compile.py(147): for tail in tail:
|
|
sre_compile.py(148): code[tail] = _len(code) - tail
|
|
sre_compile.py(147): for tail in tail:
|
|
sre_compile.py(148): code[tail] = _len(code) - tail
|
|
sre_compile.py(147): for tail in tail:
|
|
sre_compile.py(40): for op, av in pattern:
|
|
sre_compile.py(489): code.append(OPCODES[SUCCESS])
|
|
sre_compile.py(491): return code
|
|
sre_compile.py(507): if p.pattern.groups > 100:
|
|
sre_compile.py(513): groupindex = p.pattern.groupdict
|
|
sre_compile.py(514): indexgroup = [None] * p.pattern.groups
|
|
sre_compile.py(515): for k, i in groupindex.items():
|
|
sre_compile.py(518): return _sre.compile(
|
|
sre_compile.py(519): pattern, flags | p.pattern.flags, code,
|
|
sre_compile.py(520): p.pattern.groups-1,
|
|
sre_compile.py(521): groupindex, indexgroup
|
|
re.py(245): if not bypass_cache:
|
|
re.py(246): if len(_cache) >= _MAXCACHE:
|
|
re.py(248): _cache[cachekey] = p
|
|
re.py(249): return p
|
|
ConfigParser.py(678): def _interpolation_replace(self, match):
|
|
ConfigParser.py(686): class SafeConfigParser(ConfigParser):
|
|
--- modulename: ConfigParser, funcname: SafeConfigParser
|
|
ConfigParser.py(686): class SafeConfigParser(ConfigParser):
|
|
ConfigParser.py(688): def _interpolate(self, section, option, rawval, vars):
|
|
ConfigParser.py(694): _interpvar_re = re.compile(r"%\(([^)]+)\)s")
|
|
--- modulename: re, funcname: compile
|
|
re.py(190): return _compile(pattern, flags)
|
|
--- modulename: re, funcname: _compile
|
|
re.py(228): pattern, flags = key
|
|
re.py(229): bypass_cache = flags & DEBUG
|
|
re.py(230): if not bypass_cache:
|
|
re.py(231): cachekey = (type(key[0]),) + key
|
|
re.py(232): p = _cache.get(cachekey)
|
|
re.py(233): if p is not None:
|
|
re.py(235): if isinstance(pattern, _pattern_type):
|
|
re.py(239): if not sre_compile.isstring(pattern):
|
|
--- modulename: sre_compile, funcname: isstring
|
|
sre_compile.py(473): for tp in STRING_TYPES:
|
|
sre_compile.py(474): if isinstance(obj, tp):
|
|
sre_compile.py(475): return 1
|
|
re.py(241): try:
|
|
re.py(242): p = sre_compile.compile(pattern, flags)
|
|
--- modulename: sre_compile, funcname: compile
|
|
sre_compile.py(496): if isstring(p):
|
|
--- modulename: sre_compile, funcname: isstring
|
|
sre_compile.py(473): for tp in STRING_TYPES:
|
|
sre_compile.py(474): if isinstance(obj, tp):
|
|
sre_compile.py(475): return 1
|
|
sre_compile.py(497): pattern = p
|
|
sre_compile.py(498): p = sre_parse.parse(p, flags)
|
|
--- modulename: sre_parse, funcname: parse
|
|
sre_parse.py(678): source = Tokenizer(str)
|
|
--- modulename: sre_parse, funcname: __init__
|
|
sre_parse.py(179): self.string = string
|
|
sre_parse.py(180): self.index = 0
|
|
sre_parse.py(181): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(680): if pattern is None:
|
|
sre_parse.py(681): pattern = Pattern()
|
|
--- modulename: sre_parse, funcname: __init__
|
|
sre_parse.py(68): self.flags = 0
|
|
sre_parse.py(69): self.open = []
|
|
sre_parse.py(70): self.groups = 1
|
|
sre_parse.py(71): self.groupdict = {}
|
|
sre_parse.py(682): pattern.flags = flags
|
|
sre_parse.py(683): pattern.str = str
|
|
sre_parse.py(685): p = _parse_sub(source, pattern, 0)
|
|
--- modulename: sre_parse, funcname: _parse_sub
|
|
sre_parse.py(304): items = []
|
|
sre_parse.py(305): itemsappend = items.append
|
|
sre_parse.py(306): sourcematch = source.match
|
|
sre_parse.py(307): while 1:
|
|
sre_parse.py(308): itemsappend(_parse(source, state))
|
|
--- modulename: sre_parse, funcname: _parse
|
|
sre_parse.py(381): subpattern = SubPattern(state)
|
|
--- modulename: sre_parse, funcname: __init__
|
|
sre_parse.py(91): self.pattern = pattern
|
|
sre_parse.py(92): if data is None:
|
|
sre_parse.py(93): data = []
|
|
sre_parse.py(94): self.data = data
|
|
sre_parse.py(95): self.width = None
|
|
sre_parse.py(384): subpatternappend = subpattern.append
|
|
sre_parse.py(385): sourceget = source.get
|
|
sre_parse.py(386): sourcematch = source.match
|
|
sre_parse.py(387): _len = len
|
|
sre_parse.py(388): PATTERNENDERS = _PATTERNENDERS
|
|
sre_parse.py(389): ASSERTCHARS = _ASSERTCHARS
|
|
sre_parse.py(390): LOOKBEHINDASSERTCHARS = _LOOKBEHINDASSERTCHARS
|
|
sre_parse.py(391): REPEATCODES = _REPEATCODES
|
|
sre_parse.py(393): while 1:
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(397): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(188): try:
|
|
sre_parse.py(189): c = self.string[self.index + 1]
|
|
sre_parse.py(192): char = char + c
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(398): if this is None:
|
|
sre_parse.py(401): if state.flags & SRE_FLAG_VERBOSE:
|
|
sre_parse.py(412): if this and this[0] not in SPECIAL_CHARS:
|
|
sre_parse.py(413): subpatternappend((LITERAL, ord(this)))
|
|
--- modulename: sre_parse, funcname: append
|
|
sre_parse.py(139): self.data.append(code)
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(397): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(398): if this is None:
|
|
sre_parse.py(401): if state.flags & SRE_FLAG_VERBOSE:
|
|
sre_parse.py(412): if this and this[0] not in SPECIAL_CHARS:
|
|
sre_parse.py(415): elif this == "[":
|
|
sre_parse.py(472): elif this and this[0] in REPEAT_CHARS:
|
|
sre_parse.py(525): elif this == ".":
|
|
sre_parse.py(528): elif this == "(":
|
|
sre_parse.py(660): elif this == "^":
|
|
sre_parse.py(663): elif this == "$":
|
|
sre_parse.py(666): elif this and this[0] == "\\":
|
|
sre_parse.py(667): code = _escape(source, this, state)
|
|
--- modulename: sre_parse, funcname: _escape
|
|
sre_parse.py(259): code = CATEGORIES.get(escape)
|
|
sre_parse.py(260): if code:
|
|
sre_parse.py(262): code = ESCAPES.get(escape)
|
|
sre_parse.py(263): if code:
|
|
sre_parse.py(265): try:
|
|
sre_parse.py(266): c = escape[1:2]
|
|
sre_parse.py(267): if c == "x":
|
|
sre_parse.py(274): elif c == "0":
|
|
sre_parse.py(279): elif c in DIGITS:
|
|
sre_parse.py(295): if len(escape) == 2:
|
|
sre_parse.py(296): return LITERAL, ord(escape[1])
|
|
sre_parse.py(668): subpatternappend(code)
|
|
--- modulename: sre_parse, funcname: append
|
|
sre_parse.py(139): self.data.append(code)
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(397): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(398): if this is None:
|
|
sre_parse.py(401): if state.flags & SRE_FLAG_VERBOSE:
|
|
sre_parse.py(412): if this and this[0] not in SPECIAL_CHARS:
|
|
sre_parse.py(415): elif this == "[":
|
|
sre_parse.py(472): elif this and this[0] in REPEAT_CHARS:
|
|
sre_parse.py(525): elif this == ".":
|
|
sre_parse.py(528): elif this == "(":
|
|
sre_parse.py(529): group = 1
|
|
sre_parse.py(530): name = None
|
|
sre_parse.py(531): condgroup = None
|
|
sre_parse.py(532): if sourcematch("?"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(635): if group:
|
|
sre_parse.py(637): if group == 2:
|
|
sre_parse.py(641): group = state.opengroup(name)
|
|
--- modulename: sre_parse, funcname: opengroup
|
|
sre_parse.py(73): gid = self.groups
|
|
sre_parse.py(74): self.groups = gid + 1
|
|
sre_parse.py(75): if name is not None:
|
|
sre_parse.py(81): self.open.append(gid)
|
|
sre_parse.py(82): return gid
|
|
sre_parse.py(642): if condgroup:
|
|
sre_parse.py(645): p = _parse_sub(source, state)
|
|
--- modulename: sre_parse, funcname: _parse_sub
|
|
sre_parse.py(304): items = []
|
|
sre_parse.py(305): itemsappend = items.append
|
|
sre_parse.py(306): sourcematch = source.match
|
|
sre_parse.py(307): while 1:
|
|
sre_parse.py(308): itemsappend(_parse(source, state))
|
|
--- modulename: sre_parse, funcname: _parse
|
|
sre_parse.py(381): subpattern = SubPattern(state)
|
|
--- modulename: sre_parse, funcname: __init__
|
|
sre_parse.py(91): self.pattern = pattern
|
|
sre_parse.py(92): if data is None:
|
|
sre_parse.py(93): data = []
|
|
sre_parse.py(94): self.data = data
|
|
sre_parse.py(95): self.width = None
|
|
sre_parse.py(384): subpatternappend = subpattern.append
|
|
sre_parse.py(385): sourceget = source.get
|
|
sre_parse.py(386): sourcematch = source.match
|
|
sre_parse.py(387): _len = len
|
|
sre_parse.py(388): PATTERNENDERS = _PATTERNENDERS
|
|
sre_parse.py(389): ASSERTCHARS = _ASSERTCHARS
|
|
sre_parse.py(390): LOOKBEHINDASSERTCHARS = _LOOKBEHINDASSERTCHARS
|
|
sre_parse.py(391): REPEATCODES = _REPEATCODES
|
|
sre_parse.py(393): while 1:
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(397): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(398): if this is None:
|
|
sre_parse.py(401): if state.flags & SRE_FLAG_VERBOSE:
|
|
sre_parse.py(412): if this and this[0] not in SPECIAL_CHARS:
|
|
sre_parse.py(415): elif this == "[":
|
|
sre_parse.py(417): set = []
|
|
sre_parse.py(418): setappend = set.append
|
|
sre_parse.py(421): if sourcematch("^"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(197): if skip:
|
|
sre_parse.py(198): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(199): return 1
|
|
sre_parse.py(422): setappend((NEGATE, None))
|
|
sre_parse.py(424): start = set[:]
|
|
sre_parse.py(425): while 1:
|
|
sre_parse.py(426): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(427): if this == "]" and set != start:
|
|
sre_parse.py(429): elif this and this[0] == "\\":
|
|
sre_parse.py(431): elif this:
|
|
sre_parse.py(432): code1 = LITERAL, ord(this)
|
|
sre_parse.py(435): if sourcematch("-"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(459): if code1[0] is IN:
|
|
sre_parse.py(461): setappend(code1)
|
|
sre_parse.py(426): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(427): if this == "]" and set != start:
|
|
sre_parse.py(428): break
|
|
sre_parse.py(464): if _len(set)==1 and set[0][0] is LITERAL:
|
|
sre_parse.py(466): elif _len(set)==2 and set[0][0] is NEGATE and set[1][0] is LITERAL:
|
|
sre_parse.py(467): subpatternappend((NOT_LITERAL, set[1][1])) # optimization
|
|
--- modulename: sre_parse, funcname: append
|
|
sre_parse.py(139): self.data.append(code)
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(397): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(398): if this is None:
|
|
sre_parse.py(401): if state.flags & SRE_FLAG_VERBOSE:
|
|
sre_parse.py(412): if this and this[0] not in SPECIAL_CHARS:
|
|
sre_parse.py(415): elif this == "[":
|
|
sre_parse.py(472): elif this and this[0] in REPEAT_CHARS:
|
|
sre_parse.py(474): if this == "?":
|
|
sre_parse.py(476): elif this == "*":
|
|
sre_parse.py(479): elif this == "+":
|
|
sre_parse.py(480): min, max = 1, MAXREPEAT
|
|
sre_parse.py(512): if subpattern:
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
sre_parse.py(513): item = subpattern[-1:]
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(132): return SubPattern(self.pattern, self.data[index])
|
|
--- modulename: sre_parse, funcname: __init__
|
|
sre_parse.py(91): self.pattern = pattern
|
|
sre_parse.py(92): if data is None:
|
|
sre_parse.py(94): self.data = data
|
|
sre_parse.py(95): self.width = None
|
|
sre_parse.py(516): if not item or (_len(item) == 1 and item[0][0] == AT):
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_parse.py(518): if item[0][0] in REPEATCODES:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_parse.py(520): if sourcematch("?"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(523): subpattern[-1] = (MAX_REPEAT, (min, max, item))
|
|
--- modulename: sre_parse, funcname: __setitem__
|
|
sre_parse.py(135): self.data[index] = code
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(396): break # end of subpattern
|
|
sre_parse.py(673): return subpattern
|
|
sre_parse.py(309): if sourcematch("|"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(311): if not nested:
|
|
sre_parse.py(313): if not source.next or sourcematch(")", 0):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(197): if skip:
|
|
sre_parse.py(199): return 1
|
|
sre_parse.py(314): break
|
|
sre_parse.py(318): if len(items) == 1:
|
|
sre_parse.py(319): return items[0]
|
|
sre_parse.py(646): if not sourcematch(")"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(197): if skip:
|
|
sre_parse.py(198): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(188): try:
|
|
sre_parse.py(189): c = self.string[self.index + 1]
|
|
sre_parse.py(192): char = char + c
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(199): return 1
|
|
sre_parse.py(648): if group is not None:
|
|
sre_parse.py(649): state.closegroup(group)
|
|
--- modulename: sre_parse, funcname: closegroup
|
|
sre_parse.py(84): self.open.remove(gid)
|
|
sre_parse.py(650): subpatternappend((SUBPATTERN, (group, p)))
|
|
--- modulename: sre_parse, funcname: append
|
|
sre_parse.py(139): self.data.append(code)
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(397): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(398): if this is None:
|
|
sre_parse.py(401): if state.flags & SRE_FLAG_VERBOSE:
|
|
sre_parse.py(412): if this and this[0] not in SPECIAL_CHARS:
|
|
sre_parse.py(415): elif this == "[":
|
|
sre_parse.py(472): elif this and this[0] in REPEAT_CHARS:
|
|
sre_parse.py(525): elif this == ".":
|
|
sre_parse.py(528): elif this == "(":
|
|
sre_parse.py(660): elif this == "^":
|
|
sre_parse.py(663): elif this == "$":
|
|
sre_parse.py(666): elif this and this[0] == "\\":
|
|
sre_parse.py(667): code = _escape(source, this, state)
|
|
--- modulename: sre_parse, funcname: _escape
|
|
sre_parse.py(259): code = CATEGORIES.get(escape)
|
|
sre_parse.py(260): if code:
|
|
sre_parse.py(262): code = ESCAPES.get(escape)
|
|
sre_parse.py(263): if code:
|
|
sre_parse.py(265): try:
|
|
sre_parse.py(266): c = escape[1:2]
|
|
sre_parse.py(267): if c == "x":
|
|
sre_parse.py(274): elif c == "0":
|
|
sre_parse.py(279): elif c in DIGITS:
|
|
sre_parse.py(295): if len(escape) == 2:
|
|
sre_parse.py(296): return LITERAL, ord(escape[1])
|
|
sre_parse.py(668): subpatternappend(code)
|
|
--- modulename: sre_parse, funcname: append
|
|
sre_parse.py(139): self.data.append(code)
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(397): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(184): self.next = None
|
|
sre_parse.py(185): return
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(398): if this is None:
|
|
sre_parse.py(401): if state.flags & SRE_FLAG_VERBOSE:
|
|
sre_parse.py(412): if this and this[0] not in SPECIAL_CHARS:
|
|
sre_parse.py(413): subpatternappend((LITERAL, ord(this)))
|
|
--- modulename: sre_parse, funcname: append
|
|
sre_parse.py(139): self.data.append(code)
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(397): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(184): self.next = None
|
|
sre_parse.py(185): return
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(398): if this is None:
|
|
sre_parse.py(399): break # end of pattern
|
|
sre_parse.py(673): return subpattern
|
|
sre_parse.py(309): if sourcematch("|"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(311): if not nested:
|
|
sre_parse.py(312): break
|
|
sre_parse.py(318): if len(items) == 1:
|
|
sre_parse.py(319): return items[0]
|
|
sre_parse.py(687): tail = source.get()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(184): self.next = None
|
|
sre_parse.py(185): return
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(688): if tail == ")":
|
|
sre_parse.py(690): elif tail:
|
|
sre_parse.py(693): if flags & SRE_FLAG_DEBUG:
|
|
sre_parse.py(696): if not (flags & SRE_FLAG_VERBOSE) and p.pattern.flags & SRE_FLAG_VERBOSE:
|
|
sre_parse.py(701): return p
|
|
sre_compile.py(502): code = _code(p, flags)
|
|
--- modulename: sre_compile, funcname: _code
|
|
sre_compile.py(480): flags = p.pattern.flags | flags
|
|
sre_compile.py(481): code = []
|
|
sre_compile.py(484): _compile_info(code, p, flags)
|
|
--- modulename: sre_compile, funcname: _compile_info
|
|
sre_compile.py(363): lo, hi = pattern.getwidth()
|
|
--- modulename: sre_parse, funcname: getwidth
|
|
sre_parse.py(142): if self.width:
|
|
sre_parse.py(144): lo = hi = 0
|
|
sre_parse.py(145): UNITCODES = (ANY, RANGE, IN, LITERAL, NOT_LITERAL, CATEGORY)
|
|
sre_parse.py(146): REPEATCODES = (MIN_REPEAT, MAX_REPEAT)
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(148): if op is BRANCH:
|
|
sre_parse.py(157): elif op is CALL:
|
|
sre_parse.py(161): elif op is SUBPATTERN:
|
|
sre_parse.py(165): elif op in REPEATCODES:
|
|
sre_parse.py(169): elif op in UNITCODES:
|
|
sre_parse.py(170): lo = lo + 1
|
|
sre_parse.py(171): hi = hi + 1
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(148): if op is BRANCH:
|
|
sre_parse.py(157): elif op is CALL:
|
|
sre_parse.py(161): elif op is SUBPATTERN:
|
|
sre_parse.py(165): elif op in REPEATCODES:
|
|
sre_parse.py(169): elif op in UNITCODES:
|
|
sre_parse.py(170): lo = lo + 1
|
|
sre_parse.py(171): hi = hi + 1
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(148): if op is BRANCH:
|
|
sre_parse.py(157): elif op is CALL:
|
|
sre_parse.py(161): elif op is SUBPATTERN:
|
|
sre_parse.py(162): i, j = av[1].getwidth()
|
|
--- modulename: sre_parse, funcname: getwidth
|
|
sre_parse.py(142): if self.width:
|
|
sre_parse.py(144): lo = hi = 0
|
|
sre_parse.py(145): UNITCODES = (ANY, RANGE, IN, LITERAL, NOT_LITERAL, CATEGORY)
|
|
sre_parse.py(146): REPEATCODES = (MIN_REPEAT, MAX_REPEAT)
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(148): if op is BRANCH:
|
|
sre_parse.py(157): elif op is CALL:
|
|
sre_parse.py(161): elif op is SUBPATTERN:
|
|
sre_parse.py(165): elif op in REPEATCODES:
|
|
sre_parse.py(166): i, j = av[2].getwidth()
|
|
--- modulename: sre_parse, funcname: getwidth
|
|
sre_parse.py(142): if self.width:
|
|
sre_parse.py(144): lo = hi = 0
|
|
sre_parse.py(145): UNITCODES = (ANY, RANGE, IN, LITERAL, NOT_LITERAL, CATEGORY)
|
|
sre_parse.py(146): REPEATCODES = (MIN_REPEAT, MAX_REPEAT)
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(148): if op is BRANCH:
|
|
sre_parse.py(157): elif op is CALL:
|
|
sre_parse.py(161): elif op is SUBPATTERN:
|
|
sre_parse.py(165): elif op in REPEATCODES:
|
|
sre_parse.py(169): elif op in UNITCODES:
|
|
sre_parse.py(170): lo = lo + 1
|
|
sre_parse.py(171): hi = hi + 1
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(174): self.width = min(lo, MAXREPEAT - 1), min(hi, MAXREPEAT)
|
|
sre_parse.py(175): return self.width
|
|
sre_parse.py(167): lo = lo + i * av[0]
|
|
sre_parse.py(168): hi = hi + j * av[1]
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(174): self.width = min(lo, MAXREPEAT - 1), min(hi, MAXREPEAT)
|
|
sre_parse.py(175): return self.width
|
|
sre_parse.py(163): lo = lo + i
|
|
sre_parse.py(164): hi = hi + j
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(148): if op is BRANCH:
|
|
sre_parse.py(157): elif op is CALL:
|
|
sre_parse.py(161): elif op is SUBPATTERN:
|
|
sre_parse.py(165): elif op in REPEATCODES:
|
|
sre_parse.py(169): elif op in UNITCODES:
|
|
sre_parse.py(170): lo = lo + 1
|
|
sre_parse.py(171): hi = hi + 1
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(148): if op is BRANCH:
|
|
sre_parse.py(157): elif op is CALL:
|
|
sre_parse.py(161): elif op is SUBPATTERN:
|
|
sre_parse.py(165): elif op in REPEATCODES:
|
|
sre_parse.py(169): elif op in UNITCODES:
|
|
sre_parse.py(170): lo = lo + 1
|
|
sre_parse.py(171): hi = hi + 1
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(174): self.width = min(lo, MAXREPEAT - 1), min(hi, MAXREPEAT)
|
|
sre_parse.py(175): return self.width
|
|
sre_compile.py(364): if lo == 0:
|
|
sre_compile.py(367): prefix = []
|
|
sre_compile.py(368): prefixappend = prefix.append
|
|
sre_compile.py(369): prefix_skip = 0
|
|
sre_compile.py(370): charset = [] # not used
|
|
sre_compile.py(371): charsetappend = charset.append
|
|
sre_compile.py(372): if not (flags & SRE_FLAG_IGNORECASE):
|
|
sre_compile.py(374): for op, av in pattern.data:
|
|
sre_compile.py(375): if op is LITERAL:
|
|
sre_compile.py(376): if len(prefix) == prefix_skip:
|
|
sre_compile.py(377): prefix_skip = prefix_skip + 1
|
|
sre_compile.py(378): prefixappend(av)
|
|
sre_compile.py(374): for op, av in pattern.data:
|
|
sre_compile.py(375): if op is LITERAL:
|
|
sre_compile.py(376): if len(prefix) == prefix_skip:
|
|
sre_compile.py(377): prefix_skip = prefix_skip + 1
|
|
sre_compile.py(378): prefixappend(av)
|
|
sre_compile.py(374): for op, av in pattern.data:
|
|
sre_compile.py(375): if op is LITERAL:
|
|
sre_compile.py(379): elif op is SUBPATTERN and len(av[1]) == 1:
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
sre_compile.py(380): op, av = av[1][0]
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(381): if op is LITERAL:
|
|
sre_compile.py(384): break
|
|
sre_compile.py(388): if not prefix and pattern.data:
|
|
sre_compile.py(427): emit = code.append
|
|
sre_compile.py(428): emit(OPCODES[INFO])
|
|
sre_compile.py(429): skip = len(code); emit(0)
|
|
sre_compile.py(431): mask = 0
|
|
sre_compile.py(432): if prefix:
|
|
sre_compile.py(433): mask = SRE_INFO_PREFIX
|
|
sre_compile.py(434): if len(prefix) == prefix_skip == len(pattern.data):
|
|
sre_compile.py(438): emit(mask)
|
|
sre_compile.py(440): if lo < MAXCODE:
|
|
sre_compile.py(441): emit(lo)
|
|
sre_compile.py(445): if hi < MAXCODE:
|
|
sre_compile.py(448): emit(0)
|
|
sre_compile.py(450): if prefix:
|
|
sre_compile.py(451): emit(len(prefix)) # length
|
|
sre_compile.py(452): emit(prefix_skip) # skip
|
|
sre_compile.py(453): code.extend(prefix)
|
|
sre_compile.py(455): table = [-1] + ([0]*len(prefix))
|
|
sre_compile.py(456): for i in xrange(len(prefix)):
|
|
sre_compile.py(457): table[i+1] = table[i]+1
|
|
sre_compile.py(458): while table[i+1] > 0 and prefix[i] != prefix[table[i+1]-1]:
|
|
sre_compile.py(456): for i in xrange(len(prefix)):
|
|
sre_compile.py(457): table[i+1] = table[i]+1
|
|
sre_compile.py(458): while table[i+1] > 0 and prefix[i] != prefix[table[i+1]-1]:
|
|
sre_compile.py(459): table[i+1] = table[table[i+1]-1]+1
|
|
sre_compile.py(458): while table[i+1] > 0 and prefix[i] != prefix[table[i+1]-1]:
|
|
sre_compile.py(456): for i in xrange(len(prefix)):
|
|
sre_compile.py(460): code.extend(table[1:]) # don't store first entry
|
|
sre_compile.py(463): code[skip] = len(code) - skip
|
|
sre_compile.py(487): _compile(code, p.data, flags)
|
|
--- modulename: sre_compile, funcname: _compile
|
|
sre_compile.py(34): emit = code.append
|
|
sre_compile.py(35): _len = len
|
|
sre_compile.py(36): LITERAL_CODES = _LITERAL_CODES
|
|
sre_compile.py(37): REPEATING_CODES = _REPEATING_CODES
|
|
sre_compile.py(38): SUCCESS_CODES = _SUCCESS_CODES
|
|
sre_compile.py(39): ASSERT_CODES = _ASSERT_CODES
|
|
sre_compile.py(40): for op, av in pattern:
|
|
sre_compile.py(41): if op in LITERAL_CODES:
|
|
sre_compile.py(42): if flags & SRE_FLAG_IGNORECASE:
|
|
sre_compile.py(46): emit(OPCODES[op])
|
|
sre_compile.py(47): emit(av)
|
|
sre_compile.py(40): for op, av in pattern:
|
|
sre_compile.py(41): if op in LITERAL_CODES:
|
|
sre_compile.py(42): if flags & SRE_FLAG_IGNORECASE:
|
|
sre_compile.py(46): emit(OPCODES[op])
|
|
sre_compile.py(47): emit(av)
|
|
sre_compile.py(40): for op, av in pattern:
|
|
sre_compile.py(41): if op in LITERAL_CODES:
|
|
sre_compile.py(48): elif op is IN:
|
|
sre_compile.py(59): elif op is ANY:
|
|
sre_compile.py(64): elif op in REPEATING_CODES:
|
|
sre_compile.py(96): elif op is SUBPATTERN:
|
|
sre_compile.py(97): if av[0]:
|
|
sre_compile.py(98): emit(OPCODES[MARK])
|
|
sre_compile.py(99): emit((av[0]-1)*2)
|
|
sre_compile.py(101): _compile(code, av[1], flags)
|
|
--- modulename: sre_compile, funcname: _compile
|
|
sre_compile.py(34): emit = code.append
|
|
sre_compile.py(35): _len = len
|
|
sre_compile.py(36): LITERAL_CODES = _LITERAL_CODES
|
|
sre_compile.py(37): REPEATING_CODES = _REPEATING_CODES
|
|
sre_compile.py(38): SUCCESS_CODES = _SUCCESS_CODES
|
|
sre_compile.py(39): ASSERT_CODES = _ASSERT_CODES
|
|
sre_compile.py(40): for op, av in pattern:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(41): if op in LITERAL_CODES:
|
|
sre_compile.py(48): elif op is IN:
|
|
sre_compile.py(59): elif op is ANY:
|
|
sre_compile.py(64): elif op in REPEATING_CODES:
|
|
sre_compile.py(65): if flags & SRE_FLAG_TEMPLATE:
|
|
sre_compile.py(74): elif _simple(av) and op is not REPEAT:
|
|
--- modulename: sre_compile, funcname: _simple
|
|
sre_compile.py(356): lo, hi = av[2].getwidth()
|
|
--- modulename: sre_parse, funcname: getwidth
|
|
sre_parse.py(142): if self.width:
|
|
sre_parse.py(143): return self.width
|
|
sre_compile.py(357): return lo == hi == 1 and av[2][0][0] != SUBPATTERN
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(75): if op is MAX_REPEAT:
|
|
sre_compile.py(76): emit(OPCODES[REPEAT_ONE])
|
|
sre_compile.py(79): skip = _len(code); emit(0)
|
|
sre_compile.py(80): emit(av[0])
|
|
sre_compile.py(81): emit(av[1])
|
|
sre_compile.py(82): _compile(code, av[2], flags)
|
|
--- modulename: sre_compile, funcname: _compile
|
|
sre_compile.py(34): emit = code.append
|
|
sre_compile.py(35): _len = len
|
|
sre_compile.py(36): LITERAL_CODES = _LITERAL_CODES
|
|
sre_compile.py(37): REPEATING_CODES = _REPEATING_CODES
|
|
sre_compile.py(38): SUCCESS_CODES = _SUCCESS_CODES
|
|
sre_compile.py(39): ASSERT_CODES = _ASSERT_CODES
|
|
sre_compile.py(40): for op, av in pattern:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(41): if op in LITERAL_CODES:
|
|
sre_compile.py(42): if flags & SRE_FLAG_IGNORECASE:
|
|
sre_compile.py(46): emit(OPCODES[op])
|
|
sre_compile.py(47): emit(av)
|
|
sre_compile.py(40): for op, av in pattern:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(83): emit(OPCODES[SUCCESS])
|
|
sre_compile.py(84): code[skip] = _len(code) - skip
|
|
sre_compile.py(40): for op, av in pattern:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(102): if av[0]:
|
|
sre_compile.py(103): emit(OPCODES[MARK])
|
|
sre_compile.py(104): emit((av[0]-1)*2+1)
|
|
sre_compile.py(40): for op, av in pattern:
|
|
sre_compile.py(41): if op in LITERAL_CODES:
|
|
sre_compile.py(42): if flags & SRE_FLAG_IGNORECASE:
|
|
sre_compile.py(46): emit(OPCODES[op])
|
|
sre_compile.py(47): emit(av)
|
|
sre_compile.py(40): for op, av in pattern:
|
|
sre_compile.py(41): if op in LITERAL_CODES:
|
|
sre_compile.py(42): if flags & SRE_FLAG_IGNORECASE:
|
|
sre_compile.py(46): emit(OPCODES[op])
|
|
sre_compile.py(47): emit(av)
|
|
sre_compile.py(40): for op, av in pattern:
|
|
sre_compile.py(489): code.append(OPCODES[SUCCESS])
|
|
sre_compile.py(491): return code
|
|
sre_compile.py(507): if p.pattern.groups > 100:
|
|
sre_compile.py(513): groupindex = p.pattern.groupdict
|
|
sre_compile.py(514): indexgroup = [None] * p.pattern.groups
|
|
sre_compile.py(515): for k, i in groupindex.items():
|
|
sre_compile.py(518): return _sre.compile(
|
|
sre_compile.py(519): pattern, flags | p.pattern.flags, code,
|
|
sre_compile.py(520): p.pattern.groups-1,
|
|
sre_compile.py(521): groupindex, indexgroup
|
|
re.py(245): if not bypass_cache:
|
|
re.py(246): if len(_cache) >= _MAXCACHE:
|
|
re.py(248): _cache[cachekey] = p
|
|
re.py(249): return p
|
|
ConfigParser.py(696): def _interpolate_some(self, option, accum, rest, section, map, depth):
|
|
ConfigParser.py(734): def set(self, section, option, value=None):
|
|
testing.py(10): import mtproto
|
|
--- modulename: mtproto, funcname: <module>
|
|
mtproto.py(7): """
|
|
mtproto.py(8): from binascii import crc32 as originalcrc32
|
|
mtproto.py(9): from time import time
|
|
mtproto.py(10): import io
|
|
mtproto.py(11): import os.path
|
|
mtproto.py(12): import socket
|
|
--- modulename: socket, funcname: <module>
|
|
socket.py(45): """
|
|
socket.py(47): import _socket
|
|
socket.py(48): from _socket import *
|
|
socket.py(49): from functools import partial
|
|
--- modulename: functools, funcname: <module>
|
|
functools.py(2): """
|
|
functools.py(10): from _functools import partial, reduce
|
|
functools.py(15): WRAPPER_ASSIGNMENTS = ('__module__', '__name__', '__doc__')
|
|
functools.py(16): WRAPPER_UPDATES = ('__dict__',)
|
|
functools.py(19): assigned = WRAPPER_ASSIGNMENTS,
|
|
functools.py(20): updated = WRAPPER_UPDATES):
|
|
functools.py(40): assigned = WRAPPER_ASSIGNMENTS,
|
|
functools.py(41): updated = WRAPPER_UPDATES):
|
|
functools.py(53): def total_ordering(cls):
|
|
functools.py(80): def cmp_to_key(mycmp):
|
|
socket.py(50): from types import MethodType
|
|
socket.py(52): try:
|
|
socket.py(53): import _ssl
|
|
socket.py(58): def ssl(sock, keyfile=None, certfile=None):
|
|
socket.py(67): from _ssl import SSLError as sslerror
|
|
socket.py(68): from _ssl import \
|
|
socket.py(82): import os, sys, warnings
|
|
socket.py(84): try:
|
|
socket.py(85): from cStringIO import StringIO
|
|
socket.py(89): try:
|
|
socket.py(90): import errno
|
|
socket.py(93): EBADF = getattr(errno, 'EBADF', 9)
|
|
socket.py(94): EINTR = getattr(errno, 'EINTR', 4)
|
|
socket.py(96): __all__ = ["getfqdn", "create_connection"]
|
|
socket.py(97): __all__.extend(os._get_exports_list(_socket))
|
|
--- modulename: os, funcname: _get_exports_list
|
|
os.py(36): try:
|
|
os.py(37): return list(module.__all__)
|
|
os.py(38): except AttributeError:
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
os.py(39): return [n for n in dir(module) if n[0] != '_']
|
|
socket.py(100): _realsocket = socket
|
|
socket.py(103): if sys.platform.lower().startswith("win"):
|
|
socket.py(124): def getfqdn(name=''):
|
|
socket.py(151): 'bind', 'connect', 'connect_ex', 'fileno', 'listen',
|
|
socket.py(152): 'getpeername', 'getsockname', 'getsockopt', 'setsockopt',
|
|
socket.py(153): 'sendall', 'setblocking',
|
|
socket.py(154): 'settimeout', 'gettimeout', 'shutdown')
|
|
socket.py(156): if os.name == "nt":
|
|
socket.py(159): if sys.platform == "riscos":
|
|
socket.py(164): _delegate_methods = ("recv", "recvfrom", "recv_into", "recvfrom_into",
|
|
socket.py(165): "send", "sendto")
|
|
socket.py(167): class _closedsocket(object):
|
|
--- modulename: socket, funcname: _closedsocket
|
|
socket.py(167): class _closedsocket(object):
|
|
socket.py(168): __slots__ = []
|
|
socket.py(169): def _dummy(*args):
|
|
socket.py(172): send = recv = recv_into = sendto = recvfrom = recvfrom_into = _dummy
|
|
socket.py(173): __getattr__ = _dummy
|
|
socket.py(179): class _socketobject(object):
|
|
--- modulename: socket, funcname: _socketobject
|
|
socket.py(179): class _socketobject(object):
|
|
socket.py(181): __doc__ = _realsocket.__doc__
|
|
socket.py(183): __slots__ = ["_sock", "__weakref__"] + list(_delegate_methods)
|
|
socket.py(185): def __init__(self, family=AF_INET, type=SOCK_STREAM, proto=0, _sock=None):
|
|
socket.py(192): def close(self, _closedsocket=_closedsocket,
|
|
socket.py(193): _delegate_methods=_delegate_methods, setattr=setattr):
|
|
socket.py(199): close.__doc__ = _realsocket.close.__doc__
|
|
socket.py(201): def accept(self):
|
|
socket.py(204): accept.__doc__ = _realsocket.accept.__doc__
|
|
socket.py(206): def dup(self):
|
|
socket.py(212): def makefile(self, mode='r', bufsize=-1):
|
|
socket.py(219): family = property(lambda self: self._sock.family, doc="the socket family")
|
|
socket.py(220): type = property(lambda self: self._sock.type, doc="the socket type")
|
|
socket.py(221): proto = property(lambda self: self._sock.proto, doc="the socket protocol")
|
|
socket.py(223): def meth(name,self,*args):
|
|
socket.py(226): for _m in _socketmethods:
|
|
socket.py(227): p = partial(meth,_m)
|
|
socket.py(228): p.__name__ = _m
|
|
socket.py(229): p.__doc__ = getattr(_realsocket,_m).__doc__
|
|
socket.py(230): m = MethodType(p,None,_socketobject)
|
|
socket.py(231): setattr(_socketobject,_m,m)
|
|
socket.py(226): for _m in _socketmethods:
|
|
socket.py(227): p = partial(meth,_m)
|
|
socket.py(228): p.__name__ = _m
|
|
socket.py(229): p.__doc__ = getattr(_realsocket,_m).__doc__
|
|
socket.py(230): m = MethodType(p,None,_socketobject)
|
|
socket.py(231): setattr(_socketobject,_m,m)
|
|
socket.py(226): for _m in _socketmethods:
|
|
socket.py(227): p = partial(meth,_m)
|
|
socket.py(228): p.__name__ = _m
|
|
socket.py(229): p.__doc__ = getattr(_realsocket,_m).__doc__
|
|
socket.py(230): m = MethodType(p,None,_socketobject)
|
|
socket.py(231): setattr(_socketobject,_m,m)
|
|
socket.py(226): for _m in _socketmethods:
|
|
socket.py(227): p = partial(meth,_m)
|
|
socket.py(228): p.__name__ = _m
|
|
socket.py(229): p.__doc__ = getattr(_realsocket,_m).__doc__
|
|
socket.py(230): m = MethodType(p,None,_socketobject)
|
|
socket.py(231): setattr(_socketobject,_m,m)
|
|
socket.py(226): for _m in _socketmethods:
|
|
socket.py(227): p = partial(meth,_m)
|
|
socket.py(228): p.__name__ = _m
|
|
socket.py(229): p.__doc__ = getattr(_realsocket,_m).__doc__
|
|
socket.py(230): m = MethodType(p,None,_socketobject)
|
|
socket.py(231): setattr(_socketobject,_m,m)
|
|
socket.py(226): for _m in _socketmethods:
|
|
socket.py(227): p = partial(meth,_m)
|
|
socket.py(228): p.__name__ = _m
|
|
socket.py(229): p.__doc__ = getattr(_realsocket,_m).__doc__
|
|
socket.py(230): m = MethodType(p,None,_socketobject)
|
|
socket.py(231): setattr(_socketobject,_m,m)
|
|
socket.py(226): for _m in _socketmethods:
|
|
socket.py(227): p = partial(meth,_m)
|
|
socket.py(228): p.__name__ = _m
|
|
socket.py(229): p.__doc__ = getattr(_realsocket,_m).__doc__
|
|
socket.py(230): m = MethodType(p,None,_socketobject)
|
|
socket.py(231): setattr(_socketobject,_m,m)
|
|
socket.py(226): for _m in _socketmethods:
|
|
socket.py(227): p = partial(meth,_m)
|
|
socket.py(228): p.__name__ = _m
|
|
socket.py(229): p.__doc__ = getattr(_realsocket,_m).__doc__
|
|
socket.py(230): m = MethodType(p,None,_socketobject)
|
|
socket.py(231): setattr(_socketobject,_m,m)
|
|
socket.py(226): for _m in _socketmethods:
|
|
socket.py(227): p = partial(meth,_m)
|
|
socket.py(228): p.__name__ = _m
|
|
socket.py(229): p.__doc__ = getattr(_realsocket,_m).__doc__
|
|
socket.py(230): m = MethodType(p,None,_socketobject)
|
|
socket.py(231): setattr(_socketobject,_m,m)
|
|
socket.py(226): for _m in _socketmethods:
|
|
socket.py(227): p = partial(meth,_m)
|
|
socket.py(228): p.__name__ = _m
|
|
socket.py(229): p.__doc__ = getattr(_realsocket,_m).__doc__
|
|
socket.py(230): m = MethodType(p,None,_socketobject)
|
|
socket.py(231): setattr(_socketobject,_m,m)
|
|
socket.py(226): for _m in _socketmethods:
|
|
socket.py(227): p = partial(meth,_m)
|
|
socket.py(228): p.__name__ = _m
|
|
socket.py(229): p.__doc__ = getattr(_realsocket,_m).__doc__
|
|
socket.py(230): m = MethodType(p,None,_socketobject)
|
|
socket.py(231): setattr(_socketobject,_m,m)
|
|
socket.py(226): for _m in _socketmethods:
|
|
socket.py(227): p = partial(meth,_m)
|
|
socket.py(228): p.__name__ = _m
|
|
socket.py(229): p.__doc__ = getattr(_realsocket,_m).__doc__
|
|
socket.py(230): m = MethodType(p,None,_socketobject)
|
|
socket.py(231): setattr(_socketobject,_m,m)
|
|
socket.py(226): for _m in _socketmethods:
|
|
socket.py(227): p = partial(meth,_m)
|
|
socket.py(228): p.__name__ = _m
|
|
socket.py(229): p.__doc__ = getattr(_realsocket,_m).__doc__
|
|
socket.py(230): m = MethodType(p,None,_socketobject)
|
|
socket.py(231): setattr(_socketobject,_m,m)
|
|
socket.py(226): for _m in _socketmethods:
|
|
socket.py(227): p = partial(meth,_m)
|
|
socket.py(228): p.__name__ = _m
|
|
socket.py(229): p.__doc__ = getattr(_realsocket,_m).__doc__
|
|
socket.py(230): m = MethodType(p,None,_socketobject)
|
|
socket.py(231): setattr(_socketobject,_m,m)
|
|
socket.py(226): for _m in _socketmethods:
|
|
socket.py(233): socket = SocketType = _socketobject
|
|
socket.py(235): class _fileobject(object):
|
|
--- modulename: socket, funcname: _fileobject
|
|
socket.py(235): class _fileobject(object):
|
|
socket.py(236): """Faux file object attached to a socket object."""
|
|
socket.py(238): default_bufsize = 8192
|
|
socket.py(239): name = "<socket>"
|
|
socket.py(241): __slots__ = ["mode", "bufsize", "softspace",
|
|
socket.py(243): "_sock", "_rbufsize", "_wbufsize", "_rbuf", "_wbuf", "_wbuf_len",
|
|
socket.py(244): "_close"]
|
|
socket.py(246): def __init__(self, sock, mode='rb', bufsize=-1, close=False):
|
|
socket.py(272): def _getclosed(self):
|
|
socket.py(274): closed = property(_getclosed, doc="True if the file is closed")
|
|
socket.py(276): def close(self):
|
|
socket.py(285): def __del__(self):
|
|
socket.py(292): def flush(self):
|
|
socket.py(312): def fileno(self):
|
|
socket.py(315): def write(self, data):
|
|
socket.py(326): def writelines(self, list):
|
|
socket.py(336): def read(self, size=-1):
|
|
socket.py(406): def readline(self, size=-1):
|
|
socket.py(511): def readlines(self, sizehint=0):
|
|
socket.py(526): def __iter__(self):
|
|
socket.py(529): def next(self):
|
|
socket.py(535): _GLOBAL_DEFAULT_TIMEOUT = object()
|
|
socket.py(537): def create_connection(address, timeout=_GLOBAL_DEFAULT_TIMEOUT,
|
|
socket.py(538): source_address=None):
|
|
mtproto.py(13): import struct
|
|
mtproto.py(16): from Crypto.Hash import SHA
|
|
--- modulename: __init__, funcname: <module>
|
|
__init__.py(42): """
|
|
__init__.py(44): __all__ = ['Cipher', 'Hash', 'Protocol', 'PublicKey', 'Util', 'Signature']
|
|
__init__.py(46): __version__ = '2.6.1' # See also below and setup.py
|
|
__init__.py(47): __revision__ = "$Id$"
|
|
__init__.py(50): version_info = (2, 6, 1, 'final', 0) # See also above and setup.py
|
|
--- modulename: __init__, funcname: <module>
|
|
__init__.py(50): """
|
|
__init__.py(52): __all__ = ['HMAC', 'MD2', 'MD4', 'MD5', 'RIPEMD', 'SHA',
|
|
__init__.py(53): 'SHA224', 'SHA256', 'SHA384', 'SHA512']
|
|
__init__.py(54): __revision__ = "$Id$"
|
|
--- modulename: SHA, funcname: <module>
|
|
SHA.py(36): """
|
|
SHA.py(38): _revision__ = "$Id$"
|
|
SHA.py(40): __all__ = ['new', 'digest_size', 'SHA1Hash' ]
|
|
SHA.py(42): from Crypto.Util.py3compat import *
|
|
--- modulename: __init__, funcname: <module>
|
|
__init__.py(32): """
|
|
__init__.py(34): __all__ = ['randpool', 'RFC1751', 'number', 'strxor', 'asn1' ]
|
|
__init__.py(36): __revision__ = "$Id$"
|
|
--- modulename: py3compat, funcname: <module>
|
|
py3compat.py(59): """
|
|
py3compat.py(61): __revision__ = "$Id$"
|
|
py3compat.py(63): import sys
|
|
py3compat.py(65): if sys.version_info[0] == 2:
|
|
py3compat.py(66): def b(s):
|
|
py3compat.py(68): def bchr(s):
|
|
py3compat.py(70): def bstr(s):
|
|
py3compat.py(72): def bord(s):
|
|
py3compat.py(74): if sys.version_info[1] == 1:
|
|
py3compat.py(81): def tobytes(s):
|
|
SHA.py(43): from Crypto.Hash.hashalgo import HashAlgo
|
|
--- modulename: hashalgo, funcname: <module>
|
|
hashalgo.py(21): from binascii import hexlify
|
|
hashalgo.py(23): class HashAlgo:
|
|
--- modulename: hashalgo, funcname: HashAlgo
|
|
hashalgo.py(23): class HashAlgo:
|
|
hashalgo.py(27): """
|
|
hashalgo.py(30): digest_size = None
|
|
hashalgo.py(32): block_size = None
|
|
hashalgo.py(34): def __init__(self, hashFactory, data=None):
|
|
hashalgo.py(53): def update(self, data):
|
|
hashalgo.py(71): def digest(self):
|
|
hashalgo.py(82): def hexdigest(self):
|
|
hashalgo.py(92): def copy(self):
|
|
hashalgo.py(104): def new(self, data=None):
|
|
SHA.py(45): try:
|
|
SHA.py(47): import hashlib
|
|
--- modulename: hashlib, funcname: <module>
|
|
hashlib.py(55): """
|
|
hashlib.py(59): __always_supported = ('md5', 'sha1', 'sha224', 'sha256', 'sha384', 'sha512')
|
|
hashlib.py(61): algorithms = __always_supported
|
|
hashlib.py(63): __all__ = __always_supported + ('new', 'algorithms')
|
|
hashlib.py(66): def __get_builtin_constructor(name):
|
|
hashlib.py(94): def __get_openssl_constructor(name):
|
|
hashlib.py(106): def __py_new(name, string=''):
|
|
hashlib.py(113): def __hash_new(name, string=''):
|
|
hashlib.py(127): try:
|
|
hashlib.py(128): import _hashlib
|
|
hashlib.py(129): new = __hash_new
|
|
hashlib.py(130): __get_hash = __get_openssl_constructor
|
|
hashlib.py(135): for __func_name in __always_supported:
|
|
hashlib.py(138): try:
|
|
hashlib.py(139): globals()[__func_name] = __get_hash(__func_name)
|
|
--- modulename: hashlib, funcname: __get_openssl_constructor
|
|
hashlib.py(95): try:
|
|
hashlib.py(96): f = getattr(_hashlib, 'openssl_' + name)
|
|
hashlib.py(99): f()
|
|
hashlib.py(101): return f
|
|
hashlib.py(135): for __func_name in __always_supported:
|
|
hashlib.py(138): try:
|
|
hashlib.py(139): globals()[__func_name] = __get_hash(__func_name)
|
|
--- modulename: hashlib, funcname: __get_openssl_constructor
|
|
hashlib.py(95): try:
|
|
hashlib.py(96): f = getattr(_hashlib, 'openssl_' + name)
|
|
hashlib.py(99): f()
|
|
hashlib.py(101): return f
|
|
hashlib.py(135): for __func_name in __always_supported:
|
|
hashlib.py(138): try:
|
|
hashlib.py(139): globals()[__func_name] = __get_hash(__func_name)
|
|
--- modulename: hashlib, funcname: __get_openssl_constructor
|
|
hashlib.py(95): try:
|
|
hashlib.py(96): f = getattr(_hashlib, 'openssl_' + name)
|
|
hashlib.py(99): f()
|
|
hashlib.py(101): return f
|
|
hashlib.py(135): for __func_name in __always_supported:
|
|
hashlib.py(138): try:
|
|
hashlib.py(139): globals()[__func_name] = __get_hash(__func_name)
|
|
--- modulename: hashlib, funcname: __get_openssl_constructor
|
|
hashlib.py(95): try:
|
|
hashlib.py(96): f = getattr(_hashlib, 'openssl_' + name)
|
|
hashlib.py(99): f()
|
|
hashlib.py(101): return f
|
|
hashlib.py(135): for __func_name in __always_supported:
|
|
hashlib.py(138): try:
|
|
hashlib.py(139): globals()[__func_name] = __get_hash(__func_name)
|
|
--- modulename: hashlib, funcname: __get_openssl_constructor
|
|
hashlib.py(95): try:
|
|
hashlib.py(96): f = getattr(_hashlib, 'openssl_' + name)
|
|
hashlib.py(99): f()
|
|
hashlib.py(101): return f
|
|
hashlib.py(135): for __func_name in __always_supported:
|
|
hashlib.py(138): try:
|
|
hashlib.py(139): globals()[__func_name] = __get_hash(__func_name)
|
|
--- modulename: hashlib, funcname: __get_openssl_constructor
|
|
hashlib.py(95): try:
|
|
hashlib.py(96): f = getattr(_hashlib, 'openssl_' + name)
|
|
hashlib.py(99): f()
|
|
hashlib.py(101): return f
|
|
hashlib.py(135): for __func_name in __always_supported:
|
|
hashlib.py(145): del __always_supported, __func_name, __get_hash
|
|
hashlib.py(146): del __py_new, __hash_new, __get_openssl_constructor
|
|
SHA.py(48): hashFactory = hashlib.sha1
|
|
SHA.py(54): class SHA1Hash(HashAlgo):
|
|
--- modulename: SHA, funcname: SHA1Hash
|
|
SHA.py(54): class SHA1Hash(HashAlgo):
|
|
SHA.py(58): """
|
|
SHA.py(68): oid = b('\x06\x05\x2b\x0e\x03\x02\x1a')
|
|
--- modulename: py3compat, funcname: b
|
|
py3compat.py(67): return s
|
|
SHA.py(70): digest_size = 20
|
|
SHA.py(71): block_size = 64
|
|
SHA.py(73): def __init__(self, data=None):
|
|
SHA.py(76): def new(self, data=None):
|
|
SHA.py(79): def new(data=None):
|
|
SHA.py(93): digest_size = SHA1Hash.digest_size
|
|
SHA.py(96): block_size = SHA1Hash.block_size
|
|
mtproto.py(17): from Crypto.PublicKey import RSA
|
|
--- modulename: __init__, funcname: <module>
|
|
__init__.py(37): """
|
|
__init__.py(39): __all__ = ['RSA', 'DSA', 'ElGamal']
|
|
__init__.py(40): __revision__ = "$Id$"
|
|
--- modulename: RSA, funcname: <module>
|
|
RSA.py(64): """
|
|
RSA.py(66): __revision__ = "$Id$"
|
|
RSA.py(68): __all__ = ['generate', 'construct', 'error', 'importKey', 'RSAImplementation', '_RSAobj']
|
|
RSA.py(70): import sys
|
|
RSA.py(71): if sys.version_info[0] == 2 and sys.version_info[1] == 1:
|
|
RSA.py(73): from Crypto.Util.py3compat import *
|
|
RSA.py(75): from Crypto.Util.number import getRandomRange, bytes_to_long, long_to_bytes
|
|
--- modulename: number, funcname: <module>
|
|
number.py(27): __revision__ = "$Id$"
|
|
number.py(29): from Crypto.pct_warnings import GetRandomNumber_DeprecationWarning, PowmInsecureWarning
|
|
--- modulename: pct_warnings, funcname: <module>
|
|
pct_warnings.py(30): class CryptoWarning(Warning):
|
|
--- modulename: pct_warnings, funcname: CryptoWarning
|
|
pct_warnings.py(30): class CryptoWarning(Warning):
|
|
pct_warnings.py(31): """Base class for PyCrypto warnings"""
|
|
pct_warnings.py(33): class CryptoDeprecationWarning(DeprecationWarning, CryptoWarning):
|
|
--- modulename: pct_warnings, funcname: CryptoDeprecationWarning
|
|
pct_warnings.py(33): class CryptoDeprecationWarning(DeprecationWarning, CryptoWarning):
|
|
pct_warnings.py(34): """Base PyCrypto DeprecationWarning class"""
|
|
pct_warnings.py(36): class CryptoRuntimeWarning(RuntimeWarning, CryptoWarning):
|
|
--- modulename: pct_warnings, funcname: CryptoRuntimeWarning
|
|
pct_warnings.py(36): class CryptoRuntimeWarning(RuntimeWarning, CryptoWarning):
|
|
pct_warnings.py(37): """Base PyCrypto RuntimeWarning class"""
|
|
pct_warnings.py(43): class RandomPool_DeprecationWarning(CryptoDeprecationWarning):
|
|
--- modulename: pct_warnings, funcname: RandomPool_DeprecationWarning
|
|
pct_warnings.py(43): class RandomPool_DeprecationWarning(CryptoDeprecationWarning):
|
|
pct_warnings.py(44): """Issued when Crypto.Util.randpool.RandomPool is instantiated."""
|
|
pct_warnings.py(46): class ClockRewindWarning(CryptoRuntimeWarning):
|
|
--- modulename: pct_warnings, funcname: ClockRewindWarning
|
|
pct_warnings.py(46): class ClockRewindWarning(CryptoRuntimeWarning):
|
|
pct_warnings.py(47): """Warning for when the system clock moves backwards."""
|
|
pct_warnings.py(49): class GetRandomNumber_DeprecationWarning(CryptoDeprecationWarning):
|
|
--- modulename: pct_warnings, funcname: GetRandomNumber_DeprecationWarning
|
|
pct_warnings.py(49): class GetRandomNumber_DeprecationWarning(CryptoDeprecationWarning):
|
|
pct_warnings.py(50): """Issued when Crypto.Util.number.getRandomNumber is invoked."""
|
|
pct_warnings.py(52): class PowmInsecureWarning(CryptoRuntimeWarning):
|
|
--- modulename: pct_warnings, funcname: PowmInsecureWarning
|
|
pct_warnings.py(52): class PowmInsecureWarning(CryptoRuntimeWarning):
|
|
pct_warnings.py(53): """Warning for when _fastmath is built without mpz_powm_sec"""
|
|
pct_warnings.py(57): import warnings as _warnings
|
|
pct_warnings.py(58): _warnings.filterwarnings('always', category=ClockRewindWarning, append=1)
|
|
--- modulename: warnings, funcname: filterwarnings
|
|
warnings.py(57): import re
|
|
warnings.py(58): assert action in ("error", "ignore", "always", "default", "module",
|
|
warnings.py(59): "once"), "invalid action: %r" % (action,)
|
|
warnings.py(60): assert isinstance(message, basestring), "message must be a string"
|
|
warnings.py(61): assert isinstance(category, (type, types.ClassType)), \
|
|
warnings.py(63): assert issubclass(category, Warning), "category must be a Warning subclass"
|
|
warnings.py(64): assert isinstance(module, basestring), "module must be a string"
|
|
warnings.py(65): assert isinstance(lineno, int) and lineno >= 0, \
|
|
warnings.py(67): item = (action, re.compile(message, re.I), category,
|
|
--- modulename: re, funcname: compile
|
|
re.py(190): return _compile(pattern, flags)
|
|
--- modulename: re, funcname: _compile
|
|
re.py(228): pattern, flags = key
|
|
re.py(229): bypass_cache = flags & DEBUG
|
|
re.py(230): if not bypass_cache:
|
|
re.py(231): cachekey = (type(key[0]),) + key
|
|
re.py(232): p = _cache.get(cachekey)
|
|
re.py(233): if p is not None:
|
|
re.py(235): if isinstance(pattern, _pattern_type):
|
|
re.py(239): if not sre_compile.isstring(pattern):
|
|
--- modulename: sre_compile, funcname: isstring
|
|
sre_compile.py(473): for tp in STRING_TYPES:
|
|
sre_compile.py(474): if isinstance(obj, tp):
|
|
sre_compile.py(475): return 1
|
|
re.py(241): try:
|
|
re.py(242): p = sre_compile.compile(pattern, flags)
|
|
--- modulename: sre_compile, funcname: compile
|
|
sre_compile.py(496): if isstring(p):
|
|
--- modulename: sre_compile, funcname: isstring
|
|
sre_compile.py(473): for tp in STRING_TYPES:
|
|
sre_compile.py(474): if isinstance(obj, tp):
|
|
sre_compile.py(475): return 1
|
|
sre_compile.py(497): pattern = p
|
|
sre_compile.py(498): p = sre_parse.parse(p, flags)
|
|
--- modulename: sre_parse, funcname: parse
|
|
sre_parse.py(678): source = Tokenizer(str)
|
|
--- modulename: sre_parse, funcname: __init__
|
|
sre_parse.py(179): self.string = string
|
|
sre_parse.py(180): self.index = 0
|
|
sre_parse.py(181): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(184): self.next = None
|
|
sre_parse.py(185): return
|
|
sre_parse.py(680): if pattern is None:
|
|
sre_parse.py(681): pattern = Pattern()
|
|
--- modulename: sre_parse, funcname: __init__
|
|
sre_parse.py(68): self.flags = 0
|
|
sre_parse.py(69): self.open = []
|
|
sre_parse.py(70): self.groups = 1
|
|
sre_parse.py(71): self.groupdict = {}
|
|
sre_parse.py(682): pattern.flags = flags
|
|
sre_parse.py(683): pattern.str = str
|
|
sre_parse.py(685): p = _parse_sub(source, pattern, 0)
|
|
--- modulename: sre_parse, funcname: _parse_sub
|
|
sre_parse.py(304): items = []
|
|
sre_parse.py(305): itemsappend = items.append
|
|
sre_parse.py(306): sourcematch = source.match
|
|
sre_parse.py(307): while 1:
|
|
sre_parse.py(308): itemsappend(_parse(source, state))
|
|
--- modulename: sre_parse, funcname: _parse
|
|
sre_parse.py(381): subpattern = SubPattern(state)
|
|
--- modulename: sre_parse, funcname: __init__
|
|
sre_parse.py(91): self.pattern = pattern
|
|
sre_parse.py(92): if data is None:
|
|
sre_parse.py(93): data = []
|
|
sre_parse.py(94): self.data = data
|
|
sre_parse.py(95): self.width = None
|
|
sre_parse.py(384): subpatternappend = subpattern.append
|
|
sre_parse.py(385): sourceget = source.get
|
|
sre_parse.py(386): sourcematch = source.match
|
|
sre_parse.py(387): _len = len
|
|
sre_parse.py(388): PATTERNENDERS = _PATTERNENDERS
|
|
sre_parse.py(389): ASSERTCHARS = _ASSERTCHARS
|
|
sre_parse.py(390): LOOKBEHINDASSERTCHARS = _LOOKBEHINDASSERTCHARS
|
|
sre_parse.py(391): REPEATCODES = _REPEATCODES
|
|
sre_parse.py(393): while 1:
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(397): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(184): self.next = None
|
|
sre_parse.py(185): return
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(398): if this is None:
|
|
sre_parse.py(399): break # end of pattern
|
|
sre_parse.py(673): return subpattern
|
|
sre_parse.py(309): if sourcematch("|"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(311): if not nested:
|
|
sre_parse.py(312): break
|
|
sre_parse.py(318): if len(items) == 1:
|
|
sre_parse.py(319): return items[0]
|
|
sre_parse.py(687): tail = source.get()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(184): self.next = None
|
|
sre_parse.py(185): return
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(688): if tail == ")":
|
|
sre_parse.py(690): elif tail:
|
|
sre_parse.py(693): if flags & SRE_FLAG_DEBUG:
|
|
sre_parse.py(696): if not (flags & SRE_FLAG_VERBOSE) and p.pattern.flags & SRE_FLAG_VERBOSE:
|
|
sre_parse.py(701): return p
|
|
sre_compile.py(502): code = _code(p, flags)
|
|
--- modulename: sre_compile, funcname: _code
|
|
sre_compile.py(480): flags = p.pattern.flags | flags
|
|
sre_compile.py(481): code = []
|
|
sre_compile.py(484): _compile_info(code, p, flags)
|
|
--- modulename: sre_compile, funcname: _compile_info
|
|
sre_compile.py(363): lo, hi = pattern.getwidth()
|
|
--- modulename: sre_parse, funcname: getwidth
|
|
sre_parse.py(142): if self.width:
|
|
sre_parse.py(144): lo = hi = 0
|
|
sre_parse.py(145): UNITCODES = (ANY, RANGE, IN, LITERAL, NOT_LITERAL, CATEGORY)
|
|
sre_parse.py(146): REPEATCODES = (MIN_REPEAT, MAX_REPEAT)
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(174): self.width = min(lo, MAXREPEAT - 1), min(hi, MAXREPEAT)
|
|
sre_parse.py(175): return self.width
|
|
sre_compile.py(364): if lo == 0:
|
|
sre_compile.py(365): return # not worth it
|
|
sre_compile.py(487): _compile(code, p.data, flags)
|
|
--- modulename: sre_compile, funcname: _compile
|
|
sre_compile.py(34): emit = code.append
|
|
sre_compile.py(35): _len = len
|
|
sre_compile.py(36): LITERAL_CODES = _LITERAL_CODES
|
|
sre_compile.py(37): REPEATING_CODES = _REPEATING_CODES
|
|
sre_compile.py(38): SUCCESS_CODES = _SUCCESS_CODES
|
|
sre_compile.py(39): ASSERT_CODES = _ASSERT_CODES
|
|
sre_compile.py(40): for op, av in pattern:
|
|
sre_compile.py(489): code.append(OPCODES[SUCCESS])
|
|
sre_compile.py(491): return code
|
|
sre_compile.py(507): if p.pattern.groups > 100:
|
|
sre_compile.py(513): groupindex = p.pattern.groupdict
|
|
sre_compile.py(514): indexgroup = [None] * p.pattern.groups
|
|
sre_compile.py(515): for k, i in groupindex.items():
|
|
sre_compile.py(518): return _sre.compile(
|
|
sre_compile.py(519): pattern, flags | p.pattern.flags, code,
|
|
sre_compile.py(520): p.pattern.groups-1,
|
|
sre_compile.py(521): groupindex, indexgroup
|
|
re.py(245): if not bypass_cache:
|
|
re.py(246): if len(_cache) >= _MAXCACHE:
|
|
re.py(248): _cache[cachekey] = p
|
|
re.py(249): return p
|
|
warnings.py(68): re.compile(module), lineno)
|
|
--- modulename: re, funcname: compile
|
|
re.py(190): return _compile(pattern, flags)
|
|
--- modulename: re, funcname: _compile
|
|
re.py(228): pattern, flags = key
|
|
re.py(229): bypass_cache = flags & DEBUG
|
|
re.py(230): if not bypass_cache:
|
|
re.py(231): cachekey = (type(key[0]),) + key
|
|
re.py(232): p = _cache.get(cachekey)
|
|
re.py(233): if p is not None:
|
|
re.py(235): if isinstance(pattern, _pattern_type):
|
|
re.py(239): if not sre_compile.isstring(pattern):
|
|
--- modulename: sre_compile, funcname: isstring
|
|
sre_compile.py(473): for tp in STRING_TYPES:
|
|
sre_compile.py(474): if isinstance(obj, tp):
|
|
sre_compile.py(475): return 1
|
|
re.py(241): try:
|
|
re.py(242): p = sre_compile.compile(pattern, flags)
|
|
--- modulename: sre_compile, funcname: compile
|
|
sre_compile.py(496): if isstring(p):
|
|
--- modulename: sre_compile, funcname: isstring
|
|
sre_compile.py(473): for tp in STRING_TYPES:
|
|
sre_compile.py(474): if isinstance(obj, tp):
|
|
sre_compile.py(475): return 1
|
|
sre_compile.py(497): pattern = p
|
|
sre_compile.py(498): p = sre_parse.parse(p, flags)
|
|
--- modulename: sre_parse, funcname: parse
|
|
sre_parse.py(678): source = Tokenizer(str)
|
|
--- modulename: sre_parse, funcname: __init__
|
|
sre_parse.py(179): self.string = string
|
|
sre_parse.py(180): self.index = 0
|
|
sre_parse.py(181): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(184): self.next = None
|
|
sre_parse.py(185): return
|
|
sre_parse.py(680): if pattern is None:
|
|
sre_parse.py(681): pattern = Pattern()
|
|
--- modulename: sre_parse, funcname: __init__
|
|
sre_parse.py(68): self.flags = 0
|
|
sre_parse.py(69): self.open = []
|
|
sre_parse.py(70): self.groups = 1
|
|
sre_parse.py(71): self.groupdict = {}
|
|
sre_parse.py(682): pattern.flags = flags
|
|
sre_parse.py(683): pattern.str = str
|
|
sre_parse.py(685): p = _parse_sub(source, pattern, 0)
|
|
--- modulename: sre_parse, funcname: _parse_sub
|
|
sre_parse.py(304): items = []
|
|
sre_parse.py(305): itemsappend = items.append
|
|
sre_parse.py(306): sourcematch = source.match
|
|
sre_parse.py(307): while 1:
|
|
sre_parse.py(308): itemsappend(_parse(source, state))
|
|
--- modulename: sre_parse, funcname: _parse
|
|
sre_parse.py(381): subpattern = SubPattern(state)
|
|
--- modulename: sre_parse, funcname: __init__
|
|
sre_parse.py(91): self.pattern = pattern
|
|
sre_parse.py(92): if data is None:
|
|
sre_parse.py(93): data = []
|
|
sre_parse.py(94): self.data = data
|
|
sre_parse.py(95): self.width = None
|
|
sre_parse.py(384): subpatternappend = subpattern.append
|
|
sre_parse.py(385): sourceget = source.get
|
|
sre_parse.py(386): sourcematch = source.match
|
|
sre_parse.py(387): _len = len
|
|
sre_parse.py(388): PATTERNENDERS = _PATTERNENDERS
|
|
sre_parse.py(389): ASSERTCHARS = _ASSERTCHARS
|
|
sre_parse.py(390): LOOKBEHINDASSERTCHARS = _LOOKBEHINDASSERTCHARS
|
|
sre_parse.py(391): REPEATCODES = _REPEATCODES
|
|
sre_parse.py(393): while 1:
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(397): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(184): self.next = None
|
|
sre_parse.py(185): return
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(398): if this is None:
|
|
sre_parse.py(399): break # end of pattern
|
|
sre_parse.py(673): return subpattern
|
|
sre_parse.py(309): if sourcematch("|"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(311): if not nested:
|
|
sre_parse.py(312): break
|
|
sre_parse.py(318): if len(items) == 1:
|
|
sre_parse.py(319): return items[0]
|
|
sre_parse.py(687): tail = source.get()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(184): self.next = None
|
|
sre_parse.py(185): return
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(688): if tail == ")":
|
|
sre_parse.py(690): elif tail:
|
|
sre_parse.py(693): if flags & SRE_FLAG_DEBUG:
|
|
sre_parse.py(696): if not (flags & SRE_FLAG_VERBOSE) and p.pattern.flags & SRE_FLAG_VERBOSE:
|
|
sre_parse.py(701): return p
|
|
sre_compile.py(502): code = _code(p, flags)
|
|
--- modulename: sre_compile, funcname: _code
|
|
sre_compile.py(480): flags = p.pattern.flags | flags
|
|
sre_compile.py(481): code = []
|
|
sre_compile.py(484): _compile_info(code, p, flags)
|
|
--- modulename: sre_compile, funcname: _compile_info
|
|
sre_compile.py(363): lo, hi = pattern.getwidth()
|
|
--- modulename: sre_parse, funcname: getwidth
|
|
sre_parse.py(142): if self.width:
|
|
sre_parse.py(144): lo = hi = 0
|
|
sre_parse.py(145): UNITCODES = (ANY, RANGE, IN, LITERAL, NOT_LITERAL, CATEGORY)
|
|
sre_parse.py(146): REPEATCODES = (MIN_REPEAT, MAX_REPEAT)
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(174): self.width = min(lo, MAXREPEAT - 1), min(hi, MAXREPEAT)
|
|
sre_parse.py(175): return self.width
|
|
sre_compile.py(364): if lo == 0:
|
|
sre_compile.py(365): return # not worth it
|
|
sre_compile.py(487): _compile(code, p.data, flags)
|
|
--- modulename: sre_compile, funcname: _compile
|
|
sre_compile.py(34): emit = code.append
|
|
sre_compile.py(35): _len = len
|
|
sre_compile.py(36): LITERAL_CODES = _LITERAL_CODES
|
|
sre_compile.py(37): REPEATING_CODES = _REPEATING_CODES
|
|
sre_compile.py(38): SUCCESS_CODES = _SUCCESS_CODES
|
|
sre_compile.py(39): ASSERT_CODES = _ASSERT_CODES
|
|
sre_compile.py(40): for op, av in pattern:
|
|
sre_compile.py(489): code.append(OPCODES[SUCCESS])
|
|
sre_compile.py(491): return code
|
|
sre_compile.py(507): if p.pattern.groups > 100:
|
|
sre_compile.py(513): groupindex = p.pattern.groupdict
|
|
sre_compile.py(514): indexgroup = [None] * p.pattern.groups
|
|
sre_compile.py(515): for k, i in groupindex.items():
|
|
sre_compile.py(518): return _sre.compile(
|
|
sre_compile.py(519): pattern, flags | p.pattern.flags, code,
|
|
sre_compile.py(520): p.pattern.groups-1,
|
|
sre_compile.py(521): groupindex, indexgroup
|
|
re.py(245): if not bypass_cache:
|
|
re.py(246): if len(_cache) >= _MAXCACHE:
|
|
re.py(248): _cache[cachekey] = p
|
|
re.py(249): return p
|
|
warnings.py(69): if append:
|
|
warnings.py(70): filters.append(item)
|
|
number.py(30): from warnings import warn as _warn
|
|
number.py(31): import math
|
|
number.py(32): import sys
|
|
number.py(33): from Crypto.Util.py3compat import *
|
|
number.py(35): bignum = long
|
|
number.py(36): try:
|
|
number.py(37): from Crypto.PublicKey import _fastmath
|
|
number.py(38): except ImportError:
|
|
number.py(53): _fastmath = None
|
|
number.py(56): if _fastmath is not None and not _fastmath.HAVE_DECL_MPZ_POWM_SEC:
|
|
number.py(60): from _number_new import *
|
|
--- modulename: _number_new, funcname: <module>
|
|
_number_new.py(27): __revision__ = "$Id$"
|
|
_number_new.py(28): __all__ = ['ceil_shift', 'ceil_div', 'floor_div', 'exact_log2', 'exact_div']
|
|
_number_new.py(30): import sys
|
|
_number_new.py(31): if sys.version_info[0] == 2 and sys.version_info[1] == 1:
|
|
_number_new.py(34): def ceil_shift(n, b):
|
|
_number_new.py(50): def ceil_div(a, b):
|
|
_number_new.py(62): def floor_div(a, b):
|
|
_number_new.py(69): def exact_log2(num):
|
|
_number_new.py(93): def exact_div(p, d, allow_divzero=False):
|
|
number.py(75): def size (N):
|
|
number.py(84): def getRandomNumber(N, randfunc=None):
|
|
number.py(91): def getRandomInteger(N, randfunc=None):
|
|
number.py(112): def getRandomRange(a, b, randfunc=None):
|
|
number.py(128): def getRandomNBitInteger(N, randfunc=None):
|
|
number.py(143): def GCD(x,y):
|
|
number.py(152): def inverse(u, v):
|
|
number.py(169): def getPrime(N, randfunc=None):
|
|
number.py(185): def _rabinMillerTest(n, rounds, randfunc=None):
|
|
number.py(233): def getStrongPrime(N, e=0, false_positive_prob=1e-6, randfunc=None):
|
|
number.py(355): def isPrime(N, false_positive_prob=1e-6, randfunc=None):
|
|
number.py(385): import struct
|
|
number.py(387): def long_to_bytes(n, blocksize=0):
|
|
number.py(417): def bytes_to_long(s):
|
|
number.py(435): import warnings
|
|
number.py(436): def long2str(n, blocksize=0):
|
|
number.py(439): def str2long(s):
|
|
number.py(443): def _import_Random():
|
|
number.py(1455): 104677, 104681, 104683, 104693, 104701, 104707, 104711, 104717, 104723, 104729,
|
|
RSA.py(77): from Crypto.PublicKey import _RSA, _slowmath, pubkey
|
|
--- modulename: _RSA, funcname: <module>
|
|
_RSA.py(27): __revision__ = "$Id$"
|
|
_RSA.py(29): from Crypto.PublicKey import pubkey
|
|
--- modulename: pubkey, funcname: <module>
|
|
pubkey.py(27): __revision__ = "$Id$"
|
|
pubkey.py(29): import types, warnings
|
|
pubkey.py(30): from Crypto.Util.number import *
|
|
pubkey.py(33): class pubkey:
|
|
--- modulename: pubkey, funcname: pubkey
|
|
pubkey.py(33): class pubkey:
|
|
pubkey.py(37): """
|
|
pubkey.py(38): def __init__(self):
|
|
pubkey.py(41): def __getstate__(self):
|
|
pubkey.py(51): def __setstate__(self, d):
|
|
pubkey.py(58): def encrypt(self, plaintext, K):
|
|
pubkey.py(79): def decrypt(self, ciphertext):
|
|
pubkey.py(97): def sign(self, M, K):
|
|
pubkey.py(114): def verify (self, M, signature):
|
|
pubkey.py(129): def validate (self, M, signature):
|
|
pubkey.py(133): def blind(self, M, B):
|
|
pubkey.py(152): def unblind(self, M, B):
|
|
pubkey.py(173): def can_sign (self):
|
|
pubkey.py(184): def can_encrypt (self):
|
|
pubkey.py(195): def can_blind (self):
|
|
pubkey.py(209): def size (self):
|
|
pubkey.py(216): def has_private (self):
|
|
pubkey.py(223): def publickey (self):
|
|
pubkey.py(230): def __eq__ (self, other):
|
|
pubkey.py(236): def __ne__ (self, other):
|
|
_RSA.py(30): from Crypto.Util import number
|
|
_RSA.py(32): def generate_py(bits, randfunc, progress_func=None, e=65537):
|
|
_RSA.py(74): class RSAobj(pubkey.pubkey):
|
|
--- modulename: _RSA, funcname: RSAobj
|
|
_RSA.py(74): class RSAobj(pubkey.pubkey):
|
|
_RSA.py(76): def size(self):
|
|
--- modulename: _slowmath, funcname: <module>
|
|
_slowmath.py(25): """Pure Python implementation of the RSA-related portions of Crypto.PublicKey._fastmath."""
|
|
_slowmath.py(27): __revision__ = "$Id$"
|
|
_slowmath.py(29): __all__ = ['rsa_construct']
|
|
_slowmath.py(31): import sys
|
|
_slowmath.py(33): if sys.version_info[0] == 2 and sys.version_info[1] == 1:
|
|
_slowmath.py(35): from Crypto.Util.number import size, inverse, GCD
|
|
_slowmath.py(37): class error(Exception):
|
|
--- modulename: _slowmath, funcname: error
|
|
_slowmath.py(37): class error(Exception):
|
|
_slowmath.py(38): pass
|
|
_slowmath.py(40): class _RSAKey(object):
|
|
--- modulename: _slowmath, funcname: _RSAKey
|
|
_slowmath.py(40): class _RSAKey(object):
|
|
_slowmath.py(41): def _blind(self, m, r):
|
|
_slowmath.py(45): def _unblind(self, m, r):
|
|
_slowmath.py(49): def _decrypt(self, c):
|
|
_slowmath.py(63): def _encrypt(self, m):
|
|
_slowmath.py(67): def _sign(self, m): # alias for _decrypt
|
|
_slowmath.py(72): def _verify(self, m, sig):
|
|
_slowmath.py(75): def has_private(self):
|
|
_slowmath.py(78): def size(self):
|
|
_slowmath.py(82): def rsa_construct(n, e, d=None, p=None, q=None, u=None):
|
|
_slowmath.py(142): class _DSAKey(object):
|
|
--- modulename: _slowmath, funcname: _DSAKey
|
|
_slowmath.py(142): class _DSAKey(object):
|
|
_slowmath.py(143): def size(self):
|
|
_slowmath.py(147): def has_private(self):
|
|
_slowmath.py(150): def _sign(self, m, k): # alias for _decrypt
|
|
_slowmath.py(161): def _verify(self, m, r, s):
|
|
_slowmath.py(171): def dsa_construct(y, g, p, q, x=None):
|
|
RSA.py(78): from Crypto import Random
|
|
--- modulename: __init__, funcname: <module>
|
|
__init__.py(25): __revision__ = "$Id$"
|
|
__init__.py(26): __all__ = ['new']
|
|
__init__.py(28): from Crypto.Random import OSRNG
|
|
--- modulename: __init__, funcname: <module>
|
|
__init__.py(25): supplied by various operating systems."""
|
|
__init__.py(27): __revision__ = "$Id$"
|
|
__init__.py(29): import os
|
|
__init__.py(31): if os.name == 'posix':
|
|
__init__.py(32): from Crypto.Random.OSRNG.posix import new
|
|
--- modulename: posix, funcname: <module>
|
|
posix.py(25): __revision__ = "$Id$"
|
|
posix.py(26): __all__ = ['DevURandomRNG']
|
|
posix.py(28): import errno
|
|
posix.py(29): import os
|
|
posix.py(30): import stat
|
|
posix.py(32): from rng_base import BaseRNG
|
|
--- modulename: rng_base, funcname: <module>
|
|
rng_base.py(24): __revision__ = "$Id$"
|
|
rng_base.py(26): import sys
|
|
rng_base.py(27): if sys.version_info[0] == 2 and sys.version_info[1] == 1:
|
|
rng_base.py(30): class BaseRNG(object):
|
|
--- modulename: rng_base, funcname: BaseRNG
|
|
rng_base.py(30): class BaseRNG(object):
|
|
rng_base.py(32): def __init__(self):
|
|
rng_base.py(36): def __del__(self):
|
|
rng_base.py(39): def _selftest(self):
|
|
rng_base.py(52): def __enter__(self):
|
|
rng_base.py(54): def __exit__(self):
|
|
rng_base.py(58): def close(self):
|
|
rng_base.py(63): def flush(self):
|
|
rng_base.py(66): def read(self, N=-1):
|
|
rng_base.py(81): def _close(self):
|
|
rng_base.py(84): def _read(self, N):
|
|
posix.py(33): from Crypto.Util.py3compat import b
|
|
posix.py(35): class DevURandomRNG(BaseRNG):
|
|
--- modulename: posix, funcname: DevURandomRNG
|
|
posix.py(35): class DevURandomRNG(BaseRNG):
|
|
posix.py(37): def __init__(self, devname=None):
|
|
posix.py(54): def _close(self):
|
|
posix.py(57): def _read(self, N):
|
|
posix.py(82): def new(*args, **kwargs):
|
|
__init__.py(29): from Crypto.Random import _UserFriendlyRNG
|
|
--- modulename: _UserFriendlyRNG, funcname: <module>
|
|
_UserFriendlyRNG.py(25): __revision__ = "$Id$"
|
|
_UserFriendlyRNG.py(27): import sys
|
|
_UserFriendlyRNG.py(28): if sys.version_info[0] == 2 and sys.version_info[1] == 1:
|
|
_UserFriendlyRNG.py(31): import os
|
|
_UserFriendlyRNG.py(32): import threading
|
|
_UserFriendlyRNG.py(33): import struct
|
|
_UserFriendlyRNG.py(34): import time
|
|
_UserFriendlyRNG.py(35): from math import floor
|
|
_UserFriendlyRNG.py(37): from Crypto.Random import OSRNG
|
|
_UserFriendlyRNG.py(38): from Crypto.Random.Fortuna import FortunaAccumulator
|
|
--- modulename: __init__, funcname: <module>
|
|
__init__.py(1): --- modulename: FortunaAccumulator, funcname: <module>
|
|
FortunaAccumulator.py(25): __revision__ = "$Id$"
|
|
FortunaAccumulator.py(27): import sys
|
|
FortunaAccumulator.py(28): if sys.version_info[0] == 2 and sys.version_info[1] == 1:
|
|
FortunaAccumulator.py(30): from Crypto.Util.py3compat import *
|
|
FortunaAccumulator.py(32): from binascii import b2a_hex
|
|
FortunaAccumulator.py(33): import time
|
|
FortunaAccumulator.py(34): import warnings
|
|
FortunaAccumulator.py(36): from Crypto.pct_warnings import ClockRewindWarning
|
|
FortunaAccumulator.py(37): import SHAd256
|
|
--- modulename: SHAd256, funcname: <module>
|
|
SHAd256.py(29): """
|
|
SHAd256.py(31): __revision__ = "$Id$"
|
|
SHAd256.py(32): __all__ = ['new', 'digest_size']
|
|
SHAd256.py(34): import sys
|
|
SHAd256.py(35): if sys.version_info[0] == 2 and sys.version_info[1] == 1:
|
|
SHAd256.py(37): from Crypto.Util.py3compat import *
|
|
SHAd256.py(39): from binascii import b2a_hex
|
|
SHAd256.py(41): from Crypto.Hash import SHA256
|
|
--- modulename: SHA256, funcname: <module>
|
|
SHA256.py(35): """
|
|
SHA256.py(37): _revision__ = "$Id$"
|
|
SHA256.py(39): __all__ = ['new', 'digest_size', 'SHA256Hash' ]
|
|
SHA256.py(41): from Crypto.Util.py3compat import *
|
|
SHA256.py(42): from Crypto.Hash.hashalgo import HashAlgo
|
|
SHA256.py(44): try:
|
|
SHA256.py(45): import hashlib
|
|
SHA256.py(46): hashFactory = hashlib.sha256
|
|
SHA256.py(52): class SHA256Hash(HashAlgo):
|
|
--- modulename: SHA256, funcname: SHA256Hash
|
|
SHA256.py(52): class SHA256Hash(HashAlgo):
|
|
SHA256.py(56): """
|
|
SHA256.py(66): oid = b('\x06\x09\x60\x86\x48\x01\x65\x03\x04\x02\x01')
|
|
--- modulename: py3compat, funcname: b
|
|
py3compat.py(67): return s
|
|
SHA256.py(68): digest_size = 32
|
|
SHA256.py(69): block_size = 64
|
|
SHA256.py(71): def __init__(self, data=None):
|
|
SHA256.py(74): def new(self, data=None):
|
|
SHA256.py(77): def new(data=None):
|
|
SHA256.py(91): digest_size = SHA256Hash.digest_size
|
|
SHA256.py(94): block_size = SHA256Hash.block_size
|
|
SHAd256.py(43): assert SHA256.digest_size == 32
|
|
SHAd256.py(45): class _SHAd256(object):
|
|
--- modulename: SHAd256, funcname: _SHAd256
|
|
SHAd256.py(45): class _SHAd256(object):
|
|
SHAd256.py(49): """
|
|
SHAd256.py(51): digest_size = SHA256.digest_size
|
|
SHAd256.py(53): _internal = object()
|
|
SHAd256.py(55): def __init__(self, internal_api_check, sha256_hash_obj):
|
|
SHAd256.py(61): def copy(self):
|
|
SHAd256.py(66): def digest(self):
|
|
SHAd256.py(73): def hexdigest(self):
|
|
SHAd256.py(83): def update(self, data):
|
|
SHAd256.py(87): digest_size = _SHAd256.digest_size
|
|
SHAd256.py(90): def new(data=None):
|
|
FortunaAccumulator.py(39): import FortunaGenerator
|
|
--- modulename: FortunaGenerator, funcname: <module>
|
|
FortunaGenerator.py(25): __revision__ = "$Id$"
|
|
FortunaGenerator.py(27): import sys
|
|
FortunaGenerator.py(28): if sys.version_info[0] is 2 and sys.version_info[1] is 1:
|
|
FortunaGenerator.py(30): from Crypto.Util.py3compat import *
|
|
FortunaGenerator.py(32): import struct
|
|
FortunaGenerator.py(34): from Crypto.Util.number import ceil_shift, exact_log2, exact_div
|
|
FortunaGenerator.py(35): from Crypto.Util import Counter
|
|
--- modulename: Counter, funcname: <module>
|
|
Counter.py(53): """
|
|
Counter.py(54): import sys
|
|
Counter.py(55): if sys.version_info[0] == 2 and sys.version_info[1] == 1:
|
|
Counter.py(57): from Crypto.Util.py3compat import *
|
|
Counter.py(59): from Crypto.Util import _counter
|
|
Counter.py(60): import struct
|
|
Counter.py(63): def new(nbits, prefix=b(""), suffix=b(""), initial_value=1, overflow=0, little_endian=False, allow_wraparound=False, disable_shortcut=False):
|
|
--- modulename: py3compat, funcname: b
|
|
py3compat.py(67): return s
|
|
--- modulename: py3compat, funcname: b
|
|
py3compat.py(67): return s
|
|
Counter.py(116): def _encode(n, nbytes, little_endian=False):
|
|
FortunaGenerator.py(36): from Crypto.Cipher import AES
|
|
--- modulename: __init__, funcname: <module>
|
|
__init__.py(73): """
|
|
__init__.py(75): __all__ = ['AES', 'ARC2', 'ARC4',
|
|
__init__.py(76): 'Blowfish', 'CAST', 'DES', 'DES3',
|
|
__init__.py(77): 'XOR',
|
|
__init__.py(78): 'PKCS1_v1_5', 'PKCS1_OAEP'
|
|
__init__.py(81): __revision__ = "$Id$"
|
|
--- modulename: AES, funcname: <module>
|
|
AES.py(45): """
|
|
AES.py(47): __revision__ = "$Id$"
|
|
AES.py(49): from Crypto.Cipher import blockalgo
|
|
--- modulename: blockalgo, funcname: <module>
|
|
blockalgo.py(22): """Module with definitions common to all block ciphers."""
|
|
blockalgo.py(24): import sys
|
|
blockalgo.py(25): if sys.version_info[0] == 2 and sys.version_info[1] == 1:
|
|
blockalgo.py(27): from Crypto.Util.py3compat import *
|
|
blockalgo.py(38): MODE_ECB = 1
|
|
blockalgo.py(51): MODE_CBC = 2
|
|
blockalgo.py(69): MODE_CFB = 3
|
|
blockalgo.py(72): MODE_PGP = 4
|
|
blockalgo.py(87): MODE_OFB = 5
|
|
blockalgo.py(111): MODE_CTR = 6
|
|
blockalgo.py(122): MODE_OPENPGP = 7
|
|
blockalgo.py(124): def _getParameter(name, index, args, kwargs, default=None):
|
|
blockalgo.py(133): class BlockAlgo:
|
|
--- modulename: blockalgo, funcname: BlockAlgo
|
|
blockalgo.py(133): class BlockAlgo:
|
|
blockalgo.py(134): """Class modelling an abstract block cipher."""
|
|
blockalgo.py(136): def __init__(self, factory, key, *args, **kwargs):
|
|
blockalgo.py(187): def encrypt(self, plaintext):
|
|
blockalgo.py(246): def decrypt(self, ciphertext):
|
|
AES.py(50): from Crypto.Cipher import _AES
|
|
AES.py(52): class AESCipher (blockalgo.BlockAlgo):
|
|
--- modulename: AES, funcname: AESCipher
|
|
AES.py(52): class AESCipher (blockalgo.BlockAlgo):
|
|
AES.py(53): """AES cipher object"""
|
|
AES.py(55): def __init__(self, key, *args, **kwargs):
|
|
AES.py(61): def new(key, *args, **kwargs):
|
|
AES.py(98): MODE_ECB = 1
|
|
AES.py(100): MODE_CBC = 2
|
|
AES.py(102): MODE_CFB = 3
|
|
AES.py(104): MODE_PGP = 4
|
|
AES.py(106): MODE_OFB = 5
|
|
AES.py(108): MODE_CTR = 6
|
|
AES.py(110): MODE_OPENPGP = 7
|
|
AES.py(112): block_size = 16
|
|
AES.py(114): key_size = ( 16, 24, 32 )
|
|
FortunaGenerator.py(38): import SHAd256
|
|
FortunaGenerator.py(40): class AESGenerator(object):
|
|
--- modulename: FortunaGenerator, funcname: AESGenerator
|
|
FortunaGenerator.py(40): class AESGenerator(object):
|
|
FortunaGenerator.py(48): """
|
|
FortunaGenerator.py(50): block_size = AES.block_size # output block size in octets (128 bits)
|
|
FortunaGenerator.py(51): key_size = 32 # key size in octets (256 bits)
|
|
FortunaGenerator.py(61): max_blocks_per_request = 2**16 # Allow no more than this number of blocks per _pseudo_random_data request
|
|
FortunaGenerator.py(63): _four_kiblocks_of_zeros = b("\0") * block_size * 4096
|
|
--- modulename: py3compat, funcname: b
|
|
py3compat.py(67): return s
|
|
FortunaGenerator.py(65): def __init__(self):
|
|
FortunaGenerator.py(78): def reseed(self, seed):
|
|
FortunaGenerator.py(86): def pseudo_random_data(self, bytes):
|
|
FortunaGenerator.py(99): def _set_key(self, key):
|
|
FortunaGenerator.py(103): def _pseudo_random_data(self, bytes):
|
|
FortunaGenerator.py(121): def _generate_blocks(self, num_blocks):
|
|
FortunaAccumulator.py(41): class FortunaPool(object):
|
|
--- modulename: FortunaAccumulator, funcname: FortunaPool
|
|
FortunaAccumulator.py(41): class FortunaPool(object):
|
|
FortunaAccumulator.py(50): """
|
|
FortunaAccumulator.py(52): digest_size = SHAd256.digest_size
|
|
FortunaAccumulator.py(54): def __init__(self):
|
|
FortunaAccumulator.py(57): def append(self, data):
|
|
FortunaAccumulator.py(61): def digest(self):
|
|
FortunaAccumulator.py(64): def hexdigest(self):
|
|
FortunaAccumulator.py(70): def reset(self):
|
|
FortunaAccumulator.py(74): def which_pools(r):
|
|
FortunaAccumulator.py(95): class FortunaAccumulator(object):
|
|
--- modulename: FortunaAccumulator, funcname: FortunaAccumulator
|
|
FortunaAccumulator.py(95): class FortunaAccumulator(object):
|
|
FortunaAccumulator.py(102): min_pool_size = 64 # size in bytes
|
|
FortunaAccumulator.py(115): reseed_interval = 0.100 # time in seconds
|
|
FortunaAccumulator.py(117): def __init__(self):
|
|
FortunaAccumulator.py(129): def _forget_last_reseed(self):
|
|
FortunaAccumulator.py(138): def random_data(self, bytes):
|
|
FortunaAccumulator.py(150): def _reseed(self, current_time=None):
|
|
FortunaAccumulator.py(163): def add_random_event(self, source_number, pool_number, data):
|
|
_UserFriendlyRNG.py(40): class _EntropySource(object):
|
|
--- modulename: _UserFriendlyRNG, funcname: _EntropySource
|
|
_UserFriendlyRNG.py(40): class _EntropySource(object):
|
|
_UserFriendlyRNG.py(41): def __init__(self, accumulator, src_num):
|
|
_UserFriendlyRNG.py(46): def feed(self, data):
|
|
_UserFriendlyRNG.py(50): class _EntropyCollector(object):
|
|
--- modulename: _UserFriendlyRNG, funcname: _EntropyCollector
|
|
_UserFriendlyRNG.py(50): class _EntropyCollector(object):
|
|
_UserFriendlyRNG.py(52): def __init__(self, accumulator):
|
|
_UserFriendlyRNG.py(58): def reinit(self):
|
|
_UserFriendlyRNG.py(68): def collect(self):
|
|
_UserFriendlyRNG.py(81): class _UserFriendlyRNG(object):
|
|
--- modulename: _UserFriendlyRNG, funcname: _UserFriendlyRNG
|
|
_UserFriendlyRNG.py(81): class _UserFriendlyRNG(object):
|
|
_UserFriendlyRNG.py(83): def __init__(self):
|
|
_UserFriendlyRNG.py(89): def reinit(self):
|
|
_UserFriendlyRNG.py(111): def close(self):
|
|
_UserFriendlyRNG.py(116): def flush(self):
|
|
_UserFriendlyRNG.py(119): def read(self, N):
|
|
_UserFriendlyRNG.py(142): def _check_pid(self):
|
|
_UserFriendlyRNG.py(156): class _LockingUserFriendlyRNG(_UserFriendlyRNG):
|
|
--- modulename: _UserFriendlyRNG, funcname: _LockingUserFriendlyRNG
|
|
_UserFriendlyRNG.py(156): class _LockingUserFriendlyRNG(_UserFriendlyRNG):
|
|
_UserFriendlyRNG.py(157): def __init__(self):
|
|
_UserFriendlyRNG.py(161): def close(self):
|
|
_UserFriendlyRNG.py(168): def reinit(self):
|
|
_UserFriendlyRNG.py(175): def read(self, bytes):
|
|
_UserFriendlyRNG.py(182): class RNGFile(object):
|
|
--- modulename: _UserFriendlyRNG, funcname: RNGFile
|
|
_UserFriendlyRNG.py(182): class RNGFile(object):
|
|
_UserFriendlyRNG.py(183): def __init__(self, singleton):
|
|
_UserFriendlyRNG.py(188): def __enter__(self):
|
|
_UserFriendlyRNG.py(190): def __exit__(self):
|
|
_UserFriendlyRNG.py(194): def close(self):
|
|
_UserFriendlyRNG.py(199): def read(self, bytes):
|
|
_UserFriendlyRNG.py(204): def flush(self):
|
|
_UserFriendlyRNG.py(208): _singleton_lock = threading.Lock()
|
|
_UserFriendlyRNG.py(209): _singleton = None
|
|
_UserFriendlyRNG.py(210): def _get_singleton():
|
|
_UserFriendlyRNG.py(220): def new():
|
|
_UserFriendlyRNG.py(223): def reinit():
|
|
_UserFriendlyRNG.py(226): def get_random_bytes(n):
|
|
__init__.py(31): def new(*args, **kwargs):
|
|
__init__.py(35): def atfork():
|
|
__init__.py(39): def get_random_bytes(n):
|
|
RSA.py(80): from Crypto.Util.asn1 import DerObject, DerSequence, DerNull
|
|
--- modulename: asn1, funcname: <module>
|
|
asn1.py(23): from Crypto.Util.number import long_to_bytes, bytes_to_long
|
|
asn1.py(24): import sys
|
|
asn1.py(25): from Crypto.Util.py3compat import *
|
|
asn1.py(27): __all__ = [ 'DerObject', 'DerInteger', 'DerOctetString', 'DerNull', 'DerSequence', 'DerObjectId' ]
|
|
asn1.py(29): class DerObject:
|
|
--- modulename: asn1, funcname: DerObject
|
|
asn1.py(29): class DerObject:
|
|
asn1.py(33): """
|
|
asn1.py(36): typeTags = { 'SEQUENCE': 0x30, 'BIT STRING': 0x03, 'INTEGER': 0x02,
|
|
asn1.py(37): 'OCTET STRING': 0x04, 'NULL': 0x05, 'OBJECT IDENTIFIER': 0x06 }
|
|
asn1.py(39): def __init__(self, ASN1Type=None, payload=b('')):
|
|
--- modulename: py3compat, funcname: b
|
|
py3compat.py(67): return s
|
|
asn1.py(54): def isType(self, ASN1Type):
|
|
asn1.py(57): def _lengthOctets(self, payloadLen):
|
|
asn1.py(66): def encode(self):
|
|
asn1.py(70): def _decodeLen(self, idx, der):
|
|
asn1.py(86): def decode(self, derEle, noLeftOvers=0):
|
|
asn1.py(112): class DerInteger(DerObject):
|
|
--- modulename: asn1, funcname: DerInteger
|
|
asn1.py(112): class DerInteger(DerObject):
|
|
asn1.py(113): def __init__(self, value = 0):
|
|
asn1.py(121): def encode(self):
|
|
asn1.py(128): def decode(self, derEle, noLeftOvers=0):
|
|
asn1.py(151): class DerSequence(DerObject):
|
|
--- modulename: asn1, funcname: DerSequence
|
|
asn1.py(151): class DerSequence(DerObject):
|
|
asn1.py(158): """
|
|
asn1.py(160): def __init__(self, startSeq=None):
|
|
asn1.py(171): def __delitem__(self, n):
|
|
asn1.py(173): def __getitem__(self, n):
|
|
asn1.py(175): def __setitem__(self, key, value):
|
|
asn1.py(177): def __setslice__(self,i,j,sequence):
|
|
asn1.py(179): def __delslice__(self,i,j):
|
|
asn1.py(181): def __getslice__(self, i, j):
|
|
asn1.py(183): def __len__(self):
|
|
asn1.py(185): def append(self, item):
|
|
asn1.py(188): def hasInts(self):
|
|
asn1.py(192): def hasOnlyInts(self):
|
|
asn1.py(196): def encode(self):
|
|
asn1.py(214): def decode(self, derEle, noLeftOvers=0):
|
|
asn1.py(254): class DerOctetString(DerObject):
|
|
--- modulename: asn1, funcname: DerOctetString
|
|
asn1.py(254): class DerOctetString(DerObject):
|
|
asn1.py(255): def __init__(self, value = b('')):
|
|
--- modulename: py3compat, funcname: b
|
|
py3compat.py(67): return s
|
|
asn1.py(259): def decode(self, derEle, noLeftOvers=0):
|
|
asn1.py(265): class DerNull(DerObject):
|
|
--- modulename: asn1, funcname: DerNull
|
|
asn1.py(265): class DerNull(DerObject):
|
|
asn1.py(266): def __init__(self):
|
|
asn1.py(269): class DerObjectId(DerObject):
|
|
--- modulename: asn1, funcname: DerObjectId
|
|
asn1.py(269): class DerObjectId(DerObject):
|
|
asn1.py(270): def __init__(self):
|
|
asn1.py(273): def decode(self, derEle, noLeftOvers=0):
|
|
asn1.py(279): def isInt(x):
|
|
RSA.py(81): import binascii
|
|
RSA.py(82): import struct
|
|
RSA.py(84): from Crypto.Util.number import inverse
|
|
RSA.py(86): from Crypto.Util.number import inverse
|
|
RSA.py(88): try:
|
|
RSA.py(89): from Crypto.PublicKey import _fastmath
|
|
RSA.py(90): except ImportError:
|
|
RSA.py(91): _fastmath = None
|
|
RSA.py(93): class _RSAobj(pubkey.pubkey):
|
|
--- modulename: RSA, funcname: _RSAobj
|
|
RSA.py(93): class _RSAobj(pubkey.pubkey):
|
|
RSA.py(97): """
|
|
RSA.py(111): keydata = ['n', 'e', 'd', 'p', 'q', 'u']
|
|
RSA.py(113): def __init__(self, implementation, key, randfunc=None):
|
|
RSA.py(120): def __getattr__(self, attrname):
|
|
RSA.py(128): def encrypt(self, plaintext, K):
|
|
RSA.py(152): def decrypt(self, ciphertext):
|
|
RSA.py(176): def sign(self, M, K):
|
|
RSA.py(201): def verify(self, M, signature):
|
|
RSA.py(223): def _encrypt(self, c, K):
|
|
RSA.py(226): def _decrypt(self, c):
|
|
RSA.py(243): def _blind(self, m, r):
|
|
RSA.py(246): def _unblind(self, m, r):
|
|
RSA.py(249): def _sign(self, m, K=None):
|
|
RSA.py(252): def _verify(self, m, sig):
|
|
RSA.py(259): def has_private(self):
|
|
RSA.py(262): def size(self):
|
|
RSA.py(265): def can_blind(self):
|
|
RSA.py(268): def can_encrypt(self):
|
|
RSA.py(271): def can_sign(self):
|
|
RSA.py(274): def publickey(self):
|
|
RSA.py(277): def __getstate__(self):
|
|
RSA.py(286): def __setstate__(self, d):
|
|
RSA.py(296): def __repr__(self):
|
|
RSA.py(308): def exportKey(self, format='PEM', passphrase=None, pkcs=1):
|
|
RSA.py(405): class RSAImplementation(object):
|
|
--- modulename: RSA, funcname: RSAImplementation
|
|
RSA.py(405): class RSAImplementation(object):
|
|
RSA.py(413): """
|
|
RSA.py(415): def __init__(self, **kwargs):
|
|
RSA.py(454): def _get_randfunc(self, randfunc):
|
|
RSA.py(461): def generate(self, bits, randfunc=None, progress_func=None, e=65537):
|
|
RSA.py(512): def construct(self, tup):
|
|
RSA.py(542): def _importKeyDER(self, externKey):
|
|
RSA.py(590): def importKey(self, externKey, passphrase=None):
|
|
RSA.py(692): algorithmIdentifier = DerSequence(
|
|
RSA.py(693): [ b('\x06\x09\x2A\x86\x48\x86\xF7\x0D\x01\x01\x01'),
|
|
--- modulename: py3compat, funcname: b
|
|
py3compat.py(67): return s
|
|
RSA.py(694): DerNull().encode() ]
|
|
--- modulename: asn1, funcname: __init__
|
|
asn1.py(267): DerObject.__init__(self, 'NULL')
|
|
--- modulename: asn1, funcname: __init__
|
|
asn1.py(45): if isInt(ASN1Type) or ASN1Type is None:
|
|
--- modulename: asn1, funcname: isInt
|
|
asn1.py(280): test = 0
|
|
asn1.py(281): try:
|
|
asn1.py(282): test += x
|
|
asn1.py(283): except TypeError:
|
|
asn1.py(284): return 0
|
|
asn1.py(48): if len(ASN1Type)==1:
|
|
asn1.py(51): self.typeTag = self.typeTags.get(ASN1Type)
|
|
asn1.py(52): self.payload = payload
|
|
--- modulename: asn1, funcname: encode
|
|
asn1.py(68): return bchr(self.typeTag) + self._lengthOctets(len(self.payload)) + self.payload
|
|
--- modulename: py3compat, funcname: bchr
|
|
py3compat.py(69): return chr(s)
|
|
--- modulename: asn1, funcname: _lengthOctets
|
|
asn1.py(61): if payloadLen>127:
|
|
asn1.py(64): return bchr(payloadLen)
|
|
--- modulename: py3compat, funcname: bchr
|
|
py3compat.py(69): return chr(s)
|
|
--- modulename: asn1, funcname: __init__
|
|
asn1.py(163): DerObject.__init__(self, 'SEQUENCE')
|
|
--- modulename: asn1, funcname: __init__
|
|
asn1.py(45): if isInt(ASN1Type) or ASN1Type is None:
|
|
--- modulename: asn1, funcname: isInt
|
|
asn1.py(280): test = 0
|
|
asn1.py(281): try:
|
|
asn1.py(282): test += x
|
|
asn1.py(283): except TypeError:
|
|
asn1.py(284): return 0
|
|
asn1.py(48): if len(ASN1Type)==1:
|
|
asn1.py(51): self.typeTag = self.typeTags.get(ASN1Type)
|
|
asn1.py(52): self.payload = payload
|
|
asn1.py(164): if startSeq==None:
|
|
asn1.py(167): self._seq = startSeq
|
|
--- modulename: asn1, funcname: encode
|
|
asn1.py(203): self.payload = b('')
|
|
--- modulename: py3compat, funcname: b
|
|
py3compat.py(67): return s
|
|
asn1.py(204): for item in self._seq:
|
|
asn1.py(205): try:
|
|
asn1.py(206): self.payload += item
|
|
asn1.py(204): for item in self._seq:
|
|
asn1.py(205): try:
|
|
asn1.py(206): self.payload += item
|
|
asn1.py(204): for item in self._seq:
|
|
asn1.py(212): return DerObject.encode(self)
|
|
--- modulename: asn1, funcname: encode
|
|
asn1.py(68): return bchr(self.typeTag) + self._lengthOctets(len(self.payload)) + self.payload
|
|
--- modulename: py3compat, funcname: bchr
|
|
py3compat.py(69): return chr(s)
|
|
--- modulename: asn1, funcname: _lengthOctets
|
|
asn1.py(61): if payloadLen>127:
|
|
asn1.py(64): return bchr(payloadLen)
|
|
--- modulename: py3compat, funcname: bchr
|
|
py3compat.py(69): return chr(s)
|
|
RSA.py(697): _impl = RSAImplementation()
|
|
--- modulename: RSA, funcname: __init__
|
|
RSA.py(433): use_fast_math = kwargs.get('use_fast_math', None)
|
|
RSA.py(434): if use_fast_math is None: # Automatic
|
|
RSA.py(435): if _fastmath is not None:
|
|
RSA.py(438): self._math = _slowmath
|
|
RSA.py(449): self.error = self._math.error
|
|
RSA.py(451): self._default_randfunc = kwargs.get('default_randfunc', None)
|
|
RSA.py(452): self._current_randfunc = None
|
|
RSA.py(703): generate = _impl.generate
|
|
RSA.py(709): construct = _impl.construct
|
|
RSA.py(715): importKey = _impl.importKey
|
|
RSA.py(716): error = _impl.error
|
|
mtproto.py(18): from Crypto.Util.strxor import strxor
|
|
mtproto.py(19): from Crypto.Util.number import long_to_bytes, bytes_to_long
|
|
mtproto.py(22): import crypt
|
|
--- modulename: crypt, funcname: <module>
|
|
crypt.py(9): from __future__ import print_function
|
|
--- modulename: __future__, funcname: <module>
|
|
__future__.py(48): """
|
|
__future__.py(51): "nested_scopes",
|
|
__future__.py(52): "generators",
|
|
__future__.py(53): "division",
|
|
__future__.py(54): "absolute_import",
|
|
__future__.py(55): "with_statement",
|
|
__future__.py(56): "print_function",
|
|
__future__.py(57): "unicode_literals",
|
|
__future__.py(60): __all__ = ["all_feature_names"] + all_feature_names
|
|
__future__.py(66): CO_NESTED = 0x0010 # nested_scopes
|
|
__future__.py(67): CO_GENERATOR_ALLOWED = 0 # generators (obsolete, was 0x1000)
|
|
__future__.py(68): CO_FUTURE_DIVISION = 0x2000 # division
|
|
__future__.py(69): CO_FUTURE_ABSOLUTE_IMPORT = 0x4000 # perform absolute imports by default
|
|
__future__.py(70): CO_FUTURE_WITH_STATEMENT = 0x8000 # with statement
|
|
__future__.py(71): CO_FUTURE_PRINT_FUNCTION = 0x10000 # print function
|
|
__future__.py(72): CO_FUTURE_UNICODE_LITERALS = 0x20000 # unicode string literals
|
|
__future__.py(74): class _Feature:
|
|
--- modulename: __future__, funcname: _Feature
|
|
__future__.py(74): class _Feature:
|
|
__future__.py(75): def __init__(self, optionalRelease, mandatoryRelease, compiler_flag):
|
|
__future__.py(80): def getOptionalRelease(self):
|
|
__future__.py(88): def getMandatoryRelease(self):
|
|
__future__.py(97): def __repr__(self):
|
|
__future__.py(102): nested_scopes = _Feature((2, 1, 0, "beta", 1),
|
|
__future__.py(103): (2, 2, 0, "alpha", 0),
|
|
__future__.py(104): CO_NESTED)
|
|
--- modulename: __future__, funcname: __init__
|
|
__future__.py(76): self.optional = optionalRelease
|
|
__future__.py(77): self.mandatory = mandatoryRelease
|
|
__future__.py(78): self.compiler_flag = compiler_flag
|
|
__future__.py(106): generators = _Feature((2, 2, 0, "alpha", 1),
|
|
__future__.py(107): (2, 3, 0, "final", 0),
|
|
__future__.py(108): CO_GENERATOR_ALLOWED)
|
|
--- modulename: __future__, funcname: __init__
|
|
__future__.py(76): self.optional = optionalRelease
|
|
__future__.py(77): self.mandatory = mandatoryRelease
|
|
__future__.py(78): self.compiler_flag = compiler_flag
|
|
__future__.py(110): division = _Feature((2, 2, 0, "alpha", 2),
|
|
__future__.py(111): (3, 0, 0, "alpha", 0),
|
|
__future__.py(112): CO_FUTURE_DIVISION)
|
|
--- modulename: __future__, funcname: __init__
|
|
__future__.py(76): self.optional = optionalRelease
|
|
__future__.py(77): self.mandatory = mandatoryRelease
|
|
__future__.py(78): self.compiler_flag = compiler_flag
|
|
__future__.py(114): absolute_import = _Feature((2, 5, 0, "alpha", 1),
|
|
__future__.py(115): (3, 0, 0, "alpha", 0),
|
|
__future__.py(116): CO_FUTURE_ABSOLUTE_IMPORT)
|
|
--- modulename: __future__, funcname: __init__
|
|
__future__.py(76): self.optional = optionalRelease
|
|
__future__.py(77): self.mandatory = mandatoryRelease
|
|
__future__.py(78): self.compiler_flag = compiler_flag
|
|
__future__.py(118): with_statement = _Feature((2, 5, 0, "alpha", 1),
|
|
__future__.py(119): (2, 6, 0, "alpha", 0),
|
|
__future__.py(120): CO_FUTURE_WITH_STATEMENT)
|
|
--- modulename: __future__, funcname: __init__
|
|
__future__.py(76): self.optional = optionalRelease
|
|
__future__.py(77): self.mandatory = mandatoryRelease
|
|
__future__.py(78): self.compiler_flag = compiler_flag
|
|
__future__.py(122): print_function = _Feature((2, 6, 0, "alpha", 2),
|
|
__future__.py(123): (3, 0, 0, "alpha", 0),
|
|
__future__.py(124): CO_FUTURE_PRINT_FUNCTION)
|
|
--- modulename: __future__, funcname: __init__
|
|
__future__.py(76): self.optional = optionalRelease
|
|
__future__.py(77): self.mandatory = mandatoryRelease
|
|
__future__.py(78): self.compiler_flag = compiler_flag
|
|
__future__.py(126): unicode_literals = _Feature((2, 6, 0, "alpha", 2),
|
|
__future__.py(127): (3, 0, 0, "alpha", 0),
|
|
__future__.py(128): CO_FUTURE_UNICODE_LITERALS)
|
|
--- modulename: __future__, funcname: __init__
|
|
__future__.py(76): self.optional = optionalRelease
|
|
__future__.py(77): self.mandatory = mandatoryRelease
|
|
__future__.py(78): self.compiler_flag = compiler_flag
|
|
crypt.py(10): from Crypto.Util.strxor import strxor
|
|
crypt.py(11): from Crypto.Cipher import AES
|
|
crypt.py(15): def ige_encrypt(message, key, iv):
|
|
crypt.py(18): def ige_decrypt(message, key, iv):
|
|
crypt.py(21): def _ige(message, key, iv, operation="decrypt"):
|
|
mtproto.py(23): import prime
|
|
--- modulename: prime, funcname: <module>
|
|
prime.py(3): import random
|
|
--- modulename: random, funcname: <module>
|
|
random.py(40): """
|
|
random.py(42): from __future__ import division
|
|
random.py(43): from warnings import warn as _warn
|
|
random.py(44): from types import MethodType as _MethodType, BuiltinMethodType as _BuiltinMethodType
|
|
random.py(45): from math import log as _log, exp as _exp, pi as _pi, e as _e, ceil as _ceil
|
|
random.py(46): from math import sqrt as _sqrt, acos as _acos, cos as _cos, sin as _sin
|
|
random.py(47): from os import urandom as _urandom
|
|
random.py(48): from binascii import hexlify as _hexlify
|
|
random.py(49): import hashlib as _hashlib
|
|
random.py(51): __all__ = ["Random","seed","random","uniform","randint","choice","sample",
|
|
random.py(52): "randrange","shuffle","normalvariate","lognormvariate",
|
|
random.py(53): "expovariate","vonmisesvariate","gammavariate","triangular",
|
|
random.py(54): "gauss","betavariate","paretovariate","weibullvariate",
|
|
random.py(55): "getstate","setstate","jumpahead", "WichmannHill", "getrandbits",
|
|
random.py(56): "SystemRandom"]
|
|
random.py(58): NV_MAGICCONST = 4 * _exp(-0.5)/_sqrt(2.0)
|
|
random.py(59): TWOPI = 2.0*_pi
|
|
random.py(60): LOG4 = _log(4.0)
|
|
random.py(61): SG_MAGICCONST = 1.0 + _log(4.5)
|
|
random.py(62): BPF = 53 # Number of bits in a float
|
|
random.py(63): RECIP_BPF = 2**-BPF
|
|
random.py(70): import _random
|
|
random.py(72): class Random(_random.Random):
|
|
--- modulename: random, funcname: Random
|
|
random.py(72): class Random(_random.Random):
|
|
random.py(87): """
|
|
random.py(89): VERSION = 3 # used by getstate/setstate
|
|
random.py(91): def __init__(self, x=None):
|
|
random.py(100): def seed(self, a=None):
|
|
random.py(119): def getstate(self):
|
|
random.py(123): def setstate(self, state):
|
|
random.py(145): def jumpahead(self, n):
|
|
random.py(162): def __getstate__(self): # for pickle
|
|
random.py(165): def __setstate__(self, state): # for pickle
|
|
random.py(168): def __reduce__(self):
|
|
random.py(173): def randrange(self, start, stop=None, step=1, _int=int, _maxwidth=1L<<BPF):
|
|
random.py(236): def randint(self, a, b):
|
|
random.py(242): def _randbelow(self, n, _log=_log, _int=int, _maxwidth=1L<<BPF,
|
|
random.py(243): _Method=_MethodType, _BuiltinMethod=_BuiltinMethodType):
|
|
random.py(271): def choice(self, seq):
|
|
random.py(275): def shuffle(self, x, random=None):
|
|
random.py(291): def sample(self, population, k):
|
|
random.py(356): def uniform(self, a, b):
|
|
random.py(362): def triangular(self, low=0.0, high=1.0, mode=None):
|
|
random.py(381): def normalvariate(self, mu, sigma):
|
|
random.py(406): def lognormvariate(self, mu, sigma):
|
|
random.py(418): def expovariate(self, lambd):
|
|
random.py(437): def vonmisesvariate(self, mu, kappa):
|
|
random.py(485): def gammavariate(self, alpha, beta):
|
|
random.py(557): def gauss(self, mu, sigma):
|
|
random.py(610): def betavariate(self, alpha, beta):
|
|
random.py(628): def paretovariate(self, alpha):
|
|
random.py(637): def weibullvariate(self, alpha, beta):
|
|
random.py(650): class WichmannHill(Random):
|
|
--- modulename: random, funcname: WichmannHill
|
|
random.py(650): class WichmannHill(Random):
|
|
random.py(652): VERSION = 1 # used by getstate/setstate
|
|
random.py(654): def seed(self, a=None):
|
|
random.py(685): def random(self):
|
|
random.py(716): def getstate(self):
|
|
random.py(720): def setstate(self, state):
|
|
random.py(730): def jumpahead(self, n):
|
|
random.py(752): def __whseed(self, x=0, y=0, z=0):
|
|
random.py(775): def whseed(self, a=None):
|
|
random.py(800): class SystemRandom(Random):
|
|
--- modulename: random, funcname: SystemRandom
|
|
random.py(800): class SystemRandom(Random):
|
|
random.py(806): """
|
|
random.py(808): def random(self):
|
|
random.py(812): def getrandbits(self, k):
|
|
random.py(822): def _stub(self, *args, **kwds):
|
|
random.py(825): seed = jumpahead = _stub
|
|
random.py(827): def _notimplemented(self, *args, **kwds):
|
|
random.py(830): getstate = setstate = _notimplemented
|
|
random.py(834): def _test_generator(n, func, args):
|
|
random.py(856): def _test(N=2000):
|
|
random.py(880): _inst = Random()
|
|
--- modulename: random, funcname: __init__
|
|
random.py(97): self.seed(x)
|
|
--- modulename: random, funcname: seed
|
|
random.py(109): if a is None:
|
|
random.py(110): try:
|
|
random.py(111): a = long(_hexlify(_urandom(32)), 16)
|
|
random.py(116): super(Random, self).seed(a)
|
|
random.py(117): self.gauss_next = None
|
|
random.py(98): self.gauss_next = None
|
|
random.py(881): seed = _inst.seed
|
|
random.py(882): random = _inst.random
|
|
random.py(883): uniform = _inst.uniform
|
|
random.py(884): triangular = _inst.triangular
|
|
random.py(885): randint = _inst.randint
|
|
random.py(886): choice = _inst.choice
|
|
random.py(887): randrange = _inst.randrange
|
|
random.py(888): sample = _inst.sample
|
|
random.py(889): shuffle = _inst.shuffle
|
|
random.py(890): normalvariate = _inst.normalvariate
|
|
random.py(891): lognormvariate = _inst.lognormvariate
|
|
random.py(892): expovariate = _inst.expovariate
|
|
random.py(893): vonmisesvariate = _inst.vonmisesvariate
|
|
random.py(894): gammavariate = _inst.gammavariate
|
|
random.py(895): gauss = _inst.gauss
|
|
random.py(896): betavariate = _inst.betavariate
|
|
random.py(897): paretovariate = _inst.paretovariate
|
|
random.py(898): weibullvariate = _inst.weibullvariate
|
|
random.py(899): getstate = _inst.getstate
|
|
random.py(900): setstate = _inst.setstate
|
|
random.py(901): jumpahead = _inst.jumpahead
|
|
random.py(902): getrandbits = _inst.getrandbits
|
|
random.py(904): if __name__ == '__main__':
|
|
prime.py(5): def primesbelow(N):
|
|
prime.py(19): smallprimeset = set(primesbelow(100000))
|
|
--- modulename: prime, funcname: primesbelow
|
|
prime.py(8): correction = N % 6 > 1
|
|
prime.py(9): N = {0:N, 1:N-1, 2:N+4, 3:N+3, 4:N+2, 5:N+1}[N%6]
|
|
prime.py(10): sieve = [True] * (N // 3)
|
|
prime.py(11): sieve[0] = False
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(14): k = (3 * i + 1) | 1
|
|
prime.py(15): sieve[k*k // 3::2*k] = [False] * ((N//6 - (k*k)//6 - 1)//k + 1)
|
|
prime.py(16): sieve[(k*k + 4*k - 2*k*(i%2)) // 3::2*k] = [False] * ((N // 6 - (k*k + 4*k - 2*k*(i%2))//6 - 1) // k + 1)
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(14): k = (3 * i + 1) | 1
|
|
prime.py(15): sieve[k*k // 3::2*k] = [False] * ((N//6 - (k*k)//6 - 1)//k + 1)
|
|
prime.py(16): sieve[(k*k + 4*k - 2*k*(i%2)) // 3::2*k] = [False] * ((N // 6 - (k*k + 4*k - 2*k*(i%2))//6 - 1) // k + 1)
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(14): k = (3 * i + 1) | 1
|
|
prime.py(15): sieve[k*k // 3::2*k] = [False] * ((N//6 - (k*k)//6 - 1)//k + 1)
|
|
prime.py(16): sieve[(k*k + 4*k - 2*k*(i%2)) // 3::2*k] = [False] * ((N // 6 - (k*k + 4*k - 2*k*(i%2))//6 - 1) // k + 1)
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(14): k = (3 * i + 1) | 1
|
|
prime.py(15): sieve[k*k // 3::2*k] = [False] * ((N//6 - (k*k)//6 - 1)//k + 1)
|
|
prime.py(16): sieve[(k*k + 4*k - 2*k*(i%2)) // 3::2*k] = [False] * ((N // 6 - (k*k + 4*k - 2*k*(i%2))//6 - 1) // k + 1)
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(14): k = (3 * i + 1) | 1
|
|
prime.py(15): sieve[k*k // 3::2*k] = [False] * ((N//6 - (k*k)//6 - 1)//k + 1)
|
|
prime.py(16): sieve[(k*k + 4*k - 2*k*(i%2)) // 3::2*k] = [False] * ((N // 6 - (k*k + 4*k - 2*k*(i%2))//6 - 1) // k + 1)
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(14): k = (3 * i + 1) | 1
|
|
prime.py(15): sieve[k*k // 3::2*k] = [False] * ((N//6 - (k*k)//6 - 1)//k + 1)
|
|
prime.py(16): sieve[(k*k + 4*k - 2*k*(i%2)) // 3::2*k] = [False] * ((N // 6 - (k*k + 4*k - 2*k*(i%2))//6 - 1) // k + 1)
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(14): k = (3 * i + 1) | 1
|
|
prime.py(15): sieve[k*k // 3::2*k] = [False] * ((N//6 - (k*k)//6 - 1)//k + 1)
|
|
prime.py(16): sieve[(k*k + 4*k - 2*k*(i%2)) // 3::2*k] = [False] * ((N // 6 - (k*k + 4*k - 2*k*(i%2))//6 - 1) // k + 1)
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(14): k = (3 * i + 1) | 1
|
|
prime.py(15): sieve[k*k // 3::2*k] = [False] * ((N//6 - (k*k)//6 - 1)//k + 1)
|
|
prime.py(16): sieve[(k*k + 4*k - 2*k*(i%2)) // 3::2*k] = [False] * ((N // 6 - (k*k + 4*k - 2*k*(i%2))//6 - 1) // k + 1)
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(14): k = (3 * i + 1) | 1
|
|
prime.py(15): sieve[k*k // 3::2*k] = [False] * ((N//6 - (k*k)//6 - 1)//k + 1)
|
|
prime.py(16): sieve[(k*k + 4*k - 2*k*(i%2)) // 3::2*k] = [False] * ((N // 6 - (k*k + 4*k - 2*k*(i%2))//6 - 1) // k + 1)
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(14): k = (3 * i + 1) | 1
|
|
prime.py(15): sieve[k*k // 3::2*k] = [False] * ((N//6 - (k*k)//6 - 1)//k + 1)
|
|
prime.py(16): sieve[(k*k + 4*k - 2*k*(i%2)) // 3::2*k] = [False] * ((N // 6 - (k*k + 4*k - 2*k*(i%2))//6 - 1) // k + 1)
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(14): k = (3 * i + 1) | 1
|
|
prime.py(15): sieve[k*k // 3::2*k] = [False] * ((N//6 - (k*k)//6 - 1)//k + 1)
|
|
prime.py(16): sieve[(k*k + 4*k - 2*k*(i%2)) // 3::2*k] = [False] * ((N // 6 - (k*k + 4*k - 2*k*(i%2))//6 - 1) // k + 1)
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(14): k = (3 * i + 1) | 1
|
|
prime.py(15): sieve[k*k // 3::2*k] = [False] * ((N//6 - (k*k)//6 - 1)//k + 1)
|
|
prime.py(16): sieve[(k*k + 4*k - 2*k*(i%2)) // 3::2*k] = [False] * ((N // 6 - (k*k + 4*k - 2*k*(i%2))//6 - 1) // k + 1)
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(14): k = (3 * i + 1) | 1
|
|
prime.py(15): sieve[k*k // 3::2*k] = [False] * ((N//6 - (k*k)//6 - 1)//k + 1)
|
|
prime.py(16): sieve[(k*k + 4*k - 2*k*(i%2)) // 3::2*k] = [False] * ((N // 6 - (k*k + 4*k - 2*k*(i%2))//6 - 1) // k + 1)
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(14): k = (3 * i + 1) | 1
|
|
prime.py(15): sieve[k*k // 3::2*k] = [False] * ((N//6 - (k*k)//6 - 1)//k + 1)
|
|
prime.py(16): sieve[(k*k + 4*k - 2*k*(i%2)) // 3::2*k] = [False] * ((N // 6 - (k*k + 4*k - 2*k*(i%2))//6 - 1) // k + 1)
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(14): k = (3 * i + 1) | 1
|
|
prime.py(15): sieve[k*k // 3::2*k] = [False] * ((N//6 - (k*k)//6 - 1)//k + 1)
|
|
prime.py(16): sieve[(k*k + 4*k - 2*k*(i%2)) // 3::2*k] = [False] * ((N // 6 - (k*k + 4*k - 2*k*(i%2))//6 - 1) // k + 1)
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(14): k = (3 * i + 1) | 1
|
|
prime.py(15): sieve[k*k // 3::2*k] = [False] * ((N//6 - (k*k)//6 - 1)//k + 1)
|
|
prime.py(16): sieve[(k*k + 4*k - 2*k*(i%2)) // 3::2*k] = [False] * ((N // 6 - (k*k + 4*k - 2*k*(i%2))//6 - 1) // k + 1)
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(14): k = (3 * i + 1) | 1
|
|
prime.py(15): sieve[k*k // 3::2*k] = [False] * ((N//6 - (k*k)//6 - 1)//k + 1)
|
|
prime.py(16): sieve[(k*k + 4*k - 2*k*(i%2)) // 3::2*k] = [False] * ((N // 6 - (k*k + 4*k - 2*k*(i%2))//6 - 1) // k + 1)
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(14): k = (3 * i + 1) | 1
|
|
prime.py(15): sieve[k*k // 3::2*k] = [False] * ((N//6 - (k*k)//6 - 1)//k + 1)
|
|
prime.py(16): sieve[(k*k + 4*k - 2*k*(i%2)) // 3::2*k] = [False] * ((N // 6 - (k*k + 4*k - 2*k*(i%2))//6 - 1) // k + 1)
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(14): k = (3 * i + 1) | 1
|
|
prime.py(15): sieve[k*k // 3::2*k] = [False] * ((N//6 - (k*k)//6 - 1)//k + 1)
|
|
prime.py(16): sieve[(k*k + 4*k - 2*k*(i%2)) // 3::2*k] = [False] * ((N // 6 - (k*k + 4*k - 2*k*(i%2))//6 - 1) // k + 1)
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(14): k = (3 * i + 1) | 1
|
|
prime.py(15): sieve[k*k // 3::2*k] = [False] * ((N//6 - (k*k)//6 - 1)//k + 1)
|
|
prime.py(16): sieve[(k*k + 4*k - 2*k*(i%2)) // 3::2*k] = [False] * ((N // 6 - (k*k + 4*k - 2*k*(i%2))//6 - 1) // k + 1)
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(14): k = (3 * i + 1) | 1
|
|
prime.py(15): sieve[k*k // 3::2*k] = [False] * ((N//6 - (k*k)//6 - 1)//k + 1)
|
|
prime.py(16): sieve[(k*k + 4*k - 2*k*(i%2)) // 3::2*k] = [False] * ((N // 6 - (k*k + 4*k - 2*k*(i%2))//6 - 1) // k + 1)
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(14): k = (3 * i + 1) | 1
|
|
prime.py(15): sieve[k*k // 3::2*k] = [False] * ((N//6 - (k*k)//6 - 1)//k + 1)
|
|
prime.py(16): sieve[(k*k + 4*k - 2*k*(i%2)) // 3::2*k] = [False] * ((N // 6 - (k*k + 4*k - 2*k*(i%2))//6 - 1) // k + 1)
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(14): k = (3 * i + 1) | 1
|
|
prime.py(15): sieve[k*k // 3::2*k] = [False] * ((N//6 - (k*k)//6 - 1)//k + 1)
|
|
prime.py(16): sieve[(k*k + 4*k - 2*k*(i%2)) // 3::2*k] = [False] * ((N // 6 - (k*k + 4*k - 2*k*(i%2))//6 - 1) // k + 1)
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(14): k = (3 * i + 1) | 1
|
|
prime.py(15): sieve[k*k // 3::2*k] = [False] * ((N//6 - (k*k)//6 - 1)//k + 1)
|
|
prime.py(16): sieve[(k*k + 4*k - 2*k*(i%2)) // 3::2*k] = [False] * ((N // 6 - (k*k + 4*k - 2*k*(i%2))//6 - 1) // k + 1)
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(14): k = (3 * i + 1) | 1
|
|
prime.py(15): sieve[k*k // 3::2*k] = [False] * ((N//6 - (k*k)//6 - 1)//k + 1)
|
|
prime.py(16): sieve[(k*k + 4*k - 2*k*(i%2)) // 3::2*k] = [False] * ((N // 6 - (k*k + 4*k - 2*k*(i%2))//6 - 1) // k + 1)
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(14): k = (3 * i + 1) | 1
|
|
prime.py(15): sieve[k*k // 3::2*k] = [False] * ((N//6 - (k*k)//6 - 1)//k + 1)
|
|
prime.py(16): sieve[(k*k + 4*k - 2*k*(i%2)) // 3::2*k] = [False] * ((N // 6 - (k*k + 4*k - 2*k*(i%2))//6 - 1) // k + 1)
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(14): k = (3 * i + 1) | 1
|
|
prime.py(15): sieve[k*k // 3::2*k] = [False] * ((N//6 - (k*k)//6 - 1)//k + 1)
|
|
prime.py(16): sieve[(k*k + 4*k - 2*k*(i%2)) // 3::2*k] = [False] * ((N // 6 - (k*k + 4*k - 2*k*(i%2))//6 - 1) // k + 1)
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(14): k = (3 * i + 1) | 1
|
|
prime.py(15): sieve[k*k // 3::2*k] = [False] * ((N//6 - (k*k)//6 - 1)//k + 1)
|
|
prime.py(16): sieve[(k*k + 4*k - 2*k*(i%2)) // 3::2*k] = [False] * ((N // 6 - (k*k + 4*k - 2*k*(i%2))//6 - 1) // k + 1)
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(14): k = (3 * i + 1) | 1
|
|
prime.py(15): sieve[k*k // 3::2*k] = [False] * ((N//6 - (k*k)//6 - 1)//k + 1)
|
|
prime.py(16): sieve[(k*k + 4*k - 2*k*(i%2)) // 3::2*k] = [False] * ((N // 6 - (k*k + 4*k - 2*k*(i%2))//6 - 1) // k + 1)
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(14): k = (3 * i + 1) | 1
|
|
prime.py(15): sieve[k*k // 3::2*k] = [False] * ((N//6 - (k*k)//6 - 1)//k + 1)
|
|
prime.py(16): sieve[(k*k + 4*k - 2*k*(i%2)) // 3::2*k] = [False] * ((N // 6 - (k*k + 4*k - 2*k*(i%2))//6 - 1) // k + 1)
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(14): k = (3 * i + 1) | 1
|
|
prime.py(15): sieve[k*k // 3::2*k] = [False] * ((N//6 - (k*k)//6 - 1)//k + 1)
|
|
prime.py(16): sieve[(k*k + 4*k - 2*k*(i%2)) // 3::2*k] = [False] * ((N // 6 - (k*k + 4*k - 2*k*(i%2))//6 - 1) // k + 1)
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(14): k = (3 * i + 1) | 1
|
|
prime.py(15): sieve[k*k // 3::2*k] = [False] * ((N//6 - (k*k)//6 - 1)//k + 1)
|
|
prime.py(16): sieve[(k*k + 4*k - 2*k*(i%2)) // 3::2*k] = [False] * ((N // 6 - (k*k + 4*k - 2*k*(i%2))//6 - 1) // k + 1)
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(14): k = (3 * i + 1) | 1
|
|
prime.py(15): sieve[k*k // 3::2*k] = [False] * ((N//6 - (k*k)//6 - 1)//k + 1)
|
|
prime.py(16): sieve[(k*k + 4*k - 2*k*(i%2)) // 3::2*k] = [False] * ((N // 6 - (k*k + 4*k - 2*k*(i%2))//6 - 1) // k + 1)
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(14): k = (3 * i + 1) | 1
|
|
prime.py(15): sieve[k*k // 3::2*k] = [False] * ((N//6 - (k*k)//6 - 1)//k + 1)
|
|
prime.py(16): sieve[(k*k + 4*k - 2*k*(i%2)) // 3::2*k] = [False] * ((N // 6 - (k*k + 4*k - 2*k*(i%2))//6 - 1) // k + 1)
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(14): k = (3 * i + 1) | 1
|
|
prime.py(15): sieve[k*k // 3::2*k] = [False] * ((N//6 - (k*k)//6 - 1)//k + 1)
|
|
prime.py(16): sieve[(k*k + 4*k - 2*k*(i%2)) // 3::2*k] = [False] * ((N // 6 - (k*k + 4*k - 2*k*(i%2))//6 - 1) // k + 1)
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(14): k = (3 * i + 1) | 1
|
|
prime.py(15): sieve[k*k // 3::2*k] = [False] * ((N//6 - (k*k)//6 - 1)//k + 1)
|
|
prime.py(16): sieve[(k*k + 4*k - 2*k*(i%2)) // 3::2*k] = [False] * ((N // 6 - (k*k + 4*k - 2*k*(i%2))//6 - 1) // k + 1)
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(14): k = (3 * i + 1) | 1
|
|
prime.py(15): sieve[k*k // 3::2*k] = [False] * ((N//6 - (k*k)//6 - 1)//k + 1)
|
|
prime.py(16): sieve[(k*k + 4*k - 2*k*(i%2)) // 3::2*k] = [False] * ((N // 6 - (k*k + 4*k - 2*k*(i%2))//6 - 1) // k + 1)
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(14): k = (3 * i + 1) | 1
|
|
prime.py(15): sieve[k*k // 3::2*k] = [False] * ((N//6 - (k*k)//6 - 1)//k + 1)
|
|
prime.py(16): sieve[(k*k + 4*k - 2*k*(i%2)) // 3::2*k] = [False] * ((N // 6 - (k*k + 4*k - 2*k*(i%2))//6 - 1) // k + 1)
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(14): k = (3 * i + 1) | 1
|
|
prime.py(15): sieve[k*k // 3::2*k] = [False] * ((N//6 - (k*k)//6 - 1)//k + 1)
|
|
prime.py(16): sieve[(k*k + 4*k - 2*k*(i%2)) // 3::2*k] = [False] * ((N // 6 - (k*k + 4*k - 2*k*(i%2))//6 - 1) // k + 1)
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(14): k = (3 * i + 1) | 1
|
|
prime.py(15): sieve[k*k // 3::2*k] = [False] * ((N//6 - (k*k)//6 - 1)//k + 1)
|
|
prime.py(16): sieve[(k*k + 4*k - 2*k*(i%2)) // 3::2*k] = [False] * ((N // 6 - (k*k + 4*k - 2*k*(i%2))//6 - 1) // k + 1)
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(14): k = (3 * i + 1) | 1
|
|
prime.py(15): sieve[k*k // 3::2*k] = [False] * ((N//6 - (k*k)//6 - 1)//k + 1)
|
|
prime.py(16): sieve[(k*k + 4*k - 2*k*(i%2)) // 3::2*k] = [False] * ((N // 6 - (k*k + 4*k - 2*k*(i%2))//6 - 1) // k + 1)
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(14): k = (3 * i + 1) | 1
|
|
prime.py(15): sieve[k*k // 3::2*k] = [False] * ((N//6 - (k*k)//6 - 1)//k + 1)
|
|
prime.py(16): sieve[(k*k + 4*k - 2*k*(i%2)) // 3::2*k] = [False] * ((N // 6 - (k*k + 4*k - 2*k*(i%2))//6 - 1) // k + 1)
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(14): k = (3 * i + 1) | 1
|
|
prime.py(15): sieve[k*k // 3::2*k] = [False] * ((N//6 - (k*k)//6 - 1)//k + 1)
|
|
prime.py(16): sieve[(k*k + 4*k - 2*k*(i%2)) // 3::2*k] = [False] * ((N // 6 - (k*k + 4*k - 2*k*(i%2))//6 - 1) // k + 1)
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(14): k = (3 * i + 1) | 1
|
|
prime.py(15): sieve[k*k // 3::2*k] = [False] * ((N//6 - (k*k)//6 - 1)//k + 1)
|
|
prime.py(16): sieve[(k*k + 4*k - 2*k*(i%2)) // 3::2*k] = [False] * ((N // 6 - (k*k + 4*k - 2*k*(i%2))//6 - 1) // k + 1)
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(14): k = (3 * i + 1) | 1
|
|
prime.py(15): sieve[k*k // 3::2*k] = [False] * ((N//6 - (k*k)//6 - 1)//k + 1)
|
|
prime.py(16): sieve[(k*k + 4*k - 2*k*(i%2)) // 3::2*k] = [False] * ((N // 6 - (k*k + 4*k - 2*k*(i%2))//6 - 1) // k + 1)
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(14): k = (3 * i + 1) | 1
|
|
prime.py(15): sieve[k*k // 3::2*k] = [False] * ((N//6 - (k*k)//6 - 1)//k + 1)
|
|
prime.py(16): sieve[(k*k + 4*k - 2*k*(i%2)) // 3::2*k] = [False] * ((N // 6 - (k*k + 4*k - 2*k*(i%2))//6 - 1) // k + 1)
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(14): k = (3 * i + 1) | 1
|
|
prime.py(15): sieve[k*k // 3::2*k] = [False] * ((N//6 - (k*k)//6 - 1)//k + 1)
|
|
prime.py(16): sieve[(k*k + 4*k - 2*k*(i%2)) // 3::2*k] = [False] * ((N // 6 - (k*k + 4*k - 2*k*(i%2))//6 - 1) // k + 1)
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(14): k = (3 * i + 1) | 1
|
|
prime.py(15): sieve[k*k // 3::2*k] = [False] * ((N//6 - (k*k)//6 - 1)//k + 1)
|
|
prime.py(16): sieve[(k*k + 4*k - 2*k*(i%2)) // 3::2*k] = [False] * ((N // 6 - (k*k + 4*k - 2*k*(i%2))//6 - 1) // k + 1)
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(14): k = (3 * i + 1) | 1
|
|
prime.py(15): sieve[k*k // 3::2*k] = [False] * ((N//6 - (k*k)//6 - 1)//k + 1)
|
|
prime.py(16): sieve[(k*k + 4*k - 2*k*(i%2)) // 3::2*k] = [False] * ((N // 6 - (k*k + 4*k - 2*k*(i%2))//6 - 1) // k + 1)
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(14): k = (3 * i + 1) | 1
|
|
prime.py(15): sieve[k*k // 3::2*k] = [False] * ((N//6 - (k*k)//6 - 1)//k + 1)
|
|
prime.py(16): sieve[(k*k + 4*k - 2*k*(i%2)) // 3::2*k] = [False] * ((N // 6 - (k*k + 4*k - 2*k*(i%2))//6 - 1) // k + 1)
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(14): k = (3 * i + 1) | 1
|
|
prime.py(15): sieve[k*k // 3::2*k] = [False] * ((N//6 - (k*k)//6 - 1)//k + 1)
|
|
prime.py(16): sieve[(k*k + 4*k - 2*k*(i%2)) // 3::2*k] = [False] * ((N // 6 - (k*k + 4*k - 2*k*(i%2))//6 - 1) // k + 1)
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(14): k = (3 * i + 1) | 1
|
|
prime.py(15): sieve[k*k // 3::2*k] = [False] * ((N//6 - (k*k)//6 - 1)//k + 1)
|
|
prime.py(16): sieve[(k*k + 4*k - 2*k*(i%2)) // 3::2*k] = [False] * ((N // 6 - (k*k + 4*k - 2*k*(i%2))//6 - 1) // k + 1)
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(14): k = (3 * i + 1) | 1
|
|
prime.py(15): sieve[k*k // 3::2*k] = [False] * ((N//6 - (k*k)//6 - 1)//k + 1)
|
|
prime.py(16): sieve[(k*k + 4*k - 2*k*(i%2)) // 3::2*k] = [False] * ((N // 6 - (k*k + 4*k - 2*k*(i%2))//6 - 1) // k + 1)
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(14): k = (3 * i + 1) | 1
|
|
prime.py(15): sieve[k*k // 3::2*k] = [False] * ((N//6 - (k*k)//6 - 1)//k + 1)
|
|
prime.py(16): sieve[(k*k + 4*k - 2*k*(i%2)) // 3::2*k] = [False] * ((N // 6 - (k*k + 4*k - 2*k*(i%2))//6 - 1) // k + 1)
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(14): k = (3 * i + 1) | 1
|
|
prime.py(15): sieve[k*k // 3::2*k] = [False] * ((N//6 - (k*k)//6 - 1)//k + 1)
|
|
prime.py(16): sieve[(k*k + 4*k - 2*k*(i%2)) // 3::2*k] = [False] * ((N // 6 - (k*k + 4*k - 2*k*(i%2))//6 - 1) // k + 1)
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(14): k = (3 * i + 1) | 1
|
|
prime.py(15): sieve[k*k // 3::2*k] = [False] * ((N//6 - (k*k)//6 - 1)//k + 1)
|
|
prime.py(16): sieve[(k*k + 4*k - 2*k*(i%2)) // 3::2*k] = [False] * ((N // 6 - (k*k + 4*k - 2*k*(i%2))//6 - 1) // k + 1)
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(14): k = (3 * i + 1) | 1
|
|
prime.py(15): sieve[k*k // 3::2*k] = [False] * ((N//6 - (k*k)//6 - 1)//k + 1)
|
|
prime.py(16): sieve[(k*k + 4*k - 2*k*(i%2)) // 3::2*k] = [False] * ((N // 6 - (k*k + 4*k - 2*k*(i%2))//6 - 1) // k + 1)
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(14): k = (3 * i + 1) | 1
|
|
prime.py(15): sieve[k*k // 3::2*k] = [False] * ((N//6 - (k*k)//6 - 1)//k + 1)
|
|
prime.py(16): sieve[(k*k + 4*k - 2*k*(i%2)) // 3::2*k] = [False] * ((N // 6 - (k*k + 4*k - 2*k*(i%2))//6 - 1) // k + 1)
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(14): k = (3 * i + 1) | 1
|
|
prime.py(15): sieve[k*k // 3::2*k] = [False] * ((N//6 - (k*k)//6 - 1)//k + 1)
|
|
prime.py(16): sieve[(k*k + 4*k - 2*k*(i%2)) // 3::2*k] = [False] * ((N // 6 - (k*k + 4*k - 2*k*(i%2))//6 - 1) // k + 1)
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(14): k = (3 * i + 1) | 1
|
|
prime.py(15): sieve[k*k // 3::2*k] = [False] * ((N//6 - (k*k)//6 - 1)//k + 1)
|
|
prime.py(16): sieve[(k*k + 4*k - 2*k*(i%2)) // 3::2*k] = [False] * ((N // 6 - (k*k + 4*k - 2*k*(i%2))//6 - 1) // k + 1)
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(14): k = (3 * i + 1) | 1
|
|
prime.py(15): sieve[k*k // 3::2*k] = [False] * ((N//6 - (k*k)//6 - 1)//k + 1)
|
|
prime.py(16): sieve[(k*k + 4*k - 2*k*(i%2)) // 3::2*k] = [False] * ((N // 6 - (k*k + 4*k - 2*k*(i%2))//6 - 1) // k + 1)
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(14): k = (3 * i + 1) | 1
|
|
prime.py(15): sieve[k*k // 3::2*k] = [False] * ((N//6 - (k*k)//6 - 1)//k + 1)
|
|
prime.py(16): sieve[(k*k + 4*k - 2*k*(i%2)) // 3::2*k] = [False] * ((N // 6 - (k*k + 4*k - 2*k*(i%2))//6 - 1) // k + 1)
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(14): k = (3 * i + 1) | 1
|
|
prime.py(15): sieve[k*k // 3::2*k] = [False] * ((N//6 - (k*k)//6 - 1)//k + 1)
|
|
prime.py(16): sieve[(k*k + 4*k - 2*k*(i%2)) // 3::2*k] = [False] * ((N // 6 - (k*k + 4*k - 2*k*(i%2))//6 - 1) // k + 1)
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(14): k = (3 * i + 1) | 1
|
|
prime.py(15): sieve[k*k // 3::2*k] = [False] * ((N//6 - (k*k)//6 - 1)//k + 1)
|
|
prime.py(16): sieve[(k*k + 4*k - 2*k*(i%2)) // 3::2*k] = [False] * ((N // 6 - (k*k + 4*k - 2*k*(i%2))//6 - 1) // k + 1)
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(20): _smallprimeset = 100000
|
|
prime.py(22): def isprime(n, precision=7):
|
|
prime.py(53): def pollard_brent(n):
|
|
prime.py(82): smallprimes = primesbelow(10000) # might seem low, but 1000*1000 = 1000000, so this will fully factor every composite < 1000000
|
|
--- modulename: prime, funcname: primesbelow
|
|
prime.py(8): correction = N % 6 > 1
|
|
prime.py(9): N = {0:N, 1:N-1, 2:N+4, 3:N+3, 4:N+2, 5:N+1}[N%6]
|
|
prime.py(10): sieve = [True] * (N // 3)
|
|
prime.py(11): sieve[0] = False
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(14): k = (3 * i + 1) | 1
|
|
prime.py(15): sieve[k*k // 3::2*k] = [False] * ((N//6 - (k*k)//6 - 1)//k + 1)
|
|
prime.py(16): sieve[(k*k + 4*k - 2*k*(i%2)) // 3::2*k] = [False] * ((N // 6 - (k*k + 4*k - 2*k*(i%2))//6 - 1) // k + 1)
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(14): k = (3 * i + 1) | 1
|
|
prime.py(15): sieve[k*k // 3::2*k] = [False] * ((N//6 - (k*k)//6 - 1)//k + 1)
|
|
prime.py(16): sieve[(k*k + 4*k - 2*k*(i%2)) // 3::2*k] = [False] * ((N // 6 - (k*k + 4*k - 2*k*(i%2))//6 - 1) // k + 1)
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(14): k = (3 * i + 1) | 1
|
|
prime.py(15): sieve[k*k // 3::2*k] = [False] * ((N//6 - (k*k)//6 - 1)//k + 1)
|
|
prime.py(16): sieve[(k*k + 4*k - 2*k*(i%2)) // 3::2*k] = [False] * ((N // 6 - (k*k + 4*k - 2*k*(i%2))//6 - 1) // k + 1)
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(14): k = (3 * i + 1) | 1
|
|
prime.py(15): sieve[k*k // 3::2*k] = [False] * ((N//6 - (k*k)//6 - 1)//k + 1)
|
|
prime.py(16): sieve[(k*k + 4*k - 2*k*(i%2)) // 3::2*k] = [False] * ((N // 6 - (k*k + 4*k - 2*k*(i%2))//6 - 1) // k + 1)
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(14): k = (3 * i + 1) | 1
|
|
prime.py(15): sieve[k*k // 3::2*k] = [False] * ((N//6 - (k*k)//6 - 1)//k + 1)
|
|
prime.py(16): sieve[(k*k + 4*k - 2*k*(i%2)) // 3::2*k] = [False] * ((N // 6 - (k*k + 4*k - 2*k*(i%2))//6 - 1) // k + 1)
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(14): k = (3 * i + 1) | 1
|
|
prime.py(15): sieve[k*k // 3::2*k] = [False] * ((N//6 - (k*k)//6 - 1)//k + 1)
|
|
prime.py(16): sieve[(k*k + 4*k - 2*k*(i%2)) // 3::2*k] = [False] * ((N // 6 - (k*k + 4*k - 2*k*(i%2))//6 - 1) // k + 1)
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(14): k = (3 * i + 1) | 1
|
|
prime.py(15): sieve[k*k // 3::2*k] = [False] * ((N//6 - (k*k)//6 - 1)//k + 1)
|
|
prime.py(16): sieve[(k*k + 4*k - 2*k*(i%2)) // 3::2*k] = [False] * ((N // 6 - (k*k + 4*k - 2*k*(i%2))//6 - 1) // k + 1)
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(14): k = (3 * i + 1) | 1
|
|
prime.py(15): sieve[k*k // 3::2*k] = [False] * ((N//6 - (k*k)//6 - 1)//k + 1)
|
|
prime.py(16): sieve[(k*k + 4*k - 2*k*(i%2)) // 3::2*k] = [False] * ((N // 6 - (k*k + 4*k - 2*k*(i%2))//6 - 1) // k + 1)
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(14): k = (3 * i + 1) | 1
|
|
prime.py(15): sieve[k*k // 3::2*k] = [False] * ((N//6 - (k*k)//6 - 1)//k + 1)
|
|
prime.py(16): sieve[(k*k + 4*k - 2*k*(i%2)) // 3::2*k] = [False] * ((N // 6 - (k*k + 4*k - 2*k*(i%2))//6 - 1) // k + 1)
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(14): k = (3 * i + 1) | 1
|
|
prime.py(15): sieve[k*k // 3::2*k] = [False] * ((N//6 - (k*k)//6 - 1)//k + 1)
|
|
prime.py(16): sieve[(k*k + 4*k - 2*k*(i%2)) // 3::2*k] = [False] * ((N // 6 - (k*k + 4*k - 2*k*(i%2))//6 - 1) // k + 1)
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(14): k = (3 * i + 1) | 1
|
|
prime.py(15): sieve[k*k // 3::2*k] = [False] * ((N//6 - (k*k)//6 - 1)//k + 1)
|
|
prime.py(16): sieve[(k*k + 4*k - 2*k*(i%2)) // 3::2*k] = [False] * ((N // 6 - (k*k + 4*k - 2*k*(i%2))//6 - 1) // k + 1)
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(14): k = (3 * i + 1) | 1
|
|
prime.py(15): sieve[k*k // 3::2*k] = [False] * ((N//6 - (k*k)//6 - 1)//k + 1)
|
|
prime.py(16): sieve[(k*k + 4*k - 2*k*(i%2)) // 3::2*k] = [False] * ((N // 6 - (k*k + 4*k - 2*k*(i%2))//6 - 1) // k + 1)
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(14): k = (3 * i + 1) | 1
|
|
prime.py(15): sieve[k*k // 3::2*k] = [False] * ((N//6 - (k*k)//6 - 1)//k + 1)
|
|
prime.py(16): sieve[(k*k + 4*k - 2*k*(i%2)) // 3::2*k] = [False] * ((N // 6 - (k*k + 4*k - 2*k*(i%2))//6 - 1) // k + 1)
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(14): k = (3 * i + 1) | 1
|
|
prime.py(15): sieve[k*k // 3::2*k] = [False] * ((N//6 - (k*k)//6 - 1)//k + 1)
|
|
prime.py(16): sieve[(k*k + 4*k - 2*k*(i%2)) // 3::2*k] = [False] * ((N // 6 - (k*k + 4*k - 2*k*(i%2))//6 - 1) // k + 1)
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(14): k = (3 * i + 1) | 1
|
|
prime.py(15): sieve[k*k // 3::2*k] = [False] * ((N//6 - (k*k)//6 - 1)//k + 1)
|
|
prime.py(16): sieve[(k*k + 4*k - 2*k*(i%2)) // 3::2*k] = [False] * ((N // 6 - (k*k + 4*k - 2*k*(i%2))//6 - 1) // k + 1)
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(14): k = (3 * i + 1) | 1
|
|
prime.py(15): sieve[k*k // 3::2*k] = [False] * ((N//6 - (k*k)//6 - 1)//k + 1)
|
|
prime.py(16): sieve[(k*k + 4*k - 2*k*(i%2)) // 3::2*k] = [False] * ((N // 6 - (k*k + 4*k - 2*k*(i%2))//6 - 1) // k + 1)
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(14): k = (3 * i + 1) | 1
|
|
prime.py(15): sieve[k*k // 3::2*k] = [False] * ((N//6 - (k*k)//6 - 1)//k + 1)
|
|
prime.py(16): sieve[(k*k + 4*k - 2*k*(i%2)) // 3::2*k] = [False] * ((N // 6 - (k*k + 4*k - 2*k*(i%2))//6 - 1) // k + 1)
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(14): k = (3 * i + 1) | 1
|
|
prime.py(15): sieve[k*k // 3::2*k] = [False] * ((N//6 - (k*k)//6 - 1)//k + 1)
|
|
prime.py(16): sieve[(k*k + 4*k - 2*k*(i%2)) // 3::2*k] = [False] * ((N // 6 - (k*k + 4*k - 2*k*(i%2))//6 - 1) // k + 1)
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(14): k = (3 * i + 1) | 1
|
|
prime.py(15): sieve[k*k // 3::2*k] = [False] * ((N//6 - (k*k)//6 - 1)//k + 1)
|
|
prime.py(16): sieve[(k*k + 4*k - 2*k*(i%2)) // 3::2*k] = [False] * ((N // 6 - (k*k + 4*k - 2*k*(i%2))//6 - 1) // k + 1)
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(14): k = (3 * i + 1) | 1
|
|
prime.py(15): sieve[k*k // 3::2*k] = [False] * ((N//6 - (k*k)//6 - 1)//k + 1)
|
|
prime.py(16): sieve[(k*k + 4*k - 2*k*(i%2)) // 3::2*k] = [False] * ((N // 6 - (k*k + 4*k - 2*k*(i%2))//6 - 1) // k + 1)
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(14): k = (3 * i + 1) | 1
|
|
prime.py(15): sieve[k*k // 3::2*k] = [False] * ((N//6 - (k*k)//6 - 1)//k + 1)
|
|
prime.py(16): sieve[(k*k + 4*k - 2*k*(i%2)) // 3::2*k] = [False] * ((N // 6 - (k*k + 4*k - 2*k*(i%2))//6 - 1) // k + 1)
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(14): k = (3 * i + 1) | 1
|
|
prime.py(15): sieve[k*k // 3::2*k] = [False] * ((N//6 - (k*k)//6 - 1)//k + 1)
|
|
prime.py(16): sieve[(k*k + 4*k - 2*k*(i%2)) // 3::2*k] = [False] * ((N // 6 - (k*k + 4*k - 2*k*(i%2))//6 - 1) // k + 1)
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(14): k = (3 * i + 1) | 1
|
|
prime.py(15): sieve[k*k // 3::2*k] = [False] * ((N//6 - (k*k)//6 - 1)//k + 1)
|
|
prime.py(16): sieve[(k*k + 4*k - 2*k*(i%2)) // 3::2*k] = [False] * ((N // 6 - (k*k + 4*k - 2*k*(i%2))//6 - 1) // k + 1)
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(13): if sieve[i]:
|
|
prime.py(14): k = (3 * i + 1) | 1
|
|
prime.py(15): sieve[k*k // 3::2*k] = [False] * ((N//6 - (k*k)//6 - 1)//k + 1)
|
|
prime.py(16): sieve[(k*k + 4*k - 2*k*(i%2)) // 3::2*k] = [False] * ((N // 6 - (k*k + 4*k - 2*k*(i%2))//6 - 1) // k + 1)
|
|
prime.py(12): for i in range(int(N ** .5) // 3 + 1):
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(17): return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]
|
|
prime.py(83): def primefactors(n, sort=False):
|
|
prime.py(109): def factorization(n):
|
|
prime.py(118): totients = {}
|
|
prime.py(119): def totient(n):
|
|
prime.py(132): def gcd(a, b):
|
|
prime.py(137): def lcm(a, b):
|
|
mtproto.py(24): import TL
|
|
--- modulename: TL, funcname: <module>
|
|
TL.py(1): __author__ = 'agrigoryev'
|
|
TL.py(2): import os
|
|
TL.py(3): import struct
|
|
TL.py(4): import json
|
|
--- modulename: __init__, funcname: <module>
|
|
__init__.py(99): """
|
|
__init__.py(100): __version__ = '2.0.9'
|
|
__init__.py(102): 'dump', 'dumps', 'load', 'loads',
|
|
__init__.py(103): 'JSONDecoder', 'JSONEncoder',
|
|
__init__.py(106): __author__ = 'Bob Ippolito <bob@redivi.com>'
|
|
__init__.py(108): from .decoder import JSONDecoder
|
|
--- modulename: decoder, funcname: <module>
|
|
decoder.py(2): """
|
|
decoder.py(3): import re
|
|
decoder.py(4): import sys
|
|
decoder.py(5): import struct
|
|
decoder.py(7): from json import scanner
|
|
--- modulename: scanner, funcname: <module>
|
|
scanner.py(2): """
|
|
scanner.py(3): import re
|
|
scanner.py(4): try:
|
|
scanner.py(5): from _json import make_scanner as c_make_scanner
|
|
scanner.py(9): __all__ = ['make_scanner']
|
|
scanner.py(11): NUMBER_RE = re.compile(
|
|
scanner.py(12): r'(-?(?:0|[1-9]\d*))(\.\d+)?([eE][-+]?\d+)?',
|
|
scanner.py(13): (re.VERBOSE | re.MULTILINE | re.DOTALL))
|
|
--- modulename: re, funcname: compile
|
|
re.py(190): return _compile(pattern, flags)
|
|
--- modulename: re, funcname: _compile
|
|
re.py(228): pattern, flags = key
|
|
re.py(229): bypass_cache = flags & DEBUG
|
|
re.py(230): if not bypass_cache:
|
|
re.py(231): cachekey = (type(key[0]),) + key
|
|
re.py(232): p = _cache.get(cachekey)
|
|
re.py(233): if p is not None:
|
|
re.py(235): if isinstance(pattern, _pattern_type):
|
|
re.py(239): if not sre_compile.isstring(pattern):
|
|
--- modulename: sre_compile, funcname: isstring
|
|
sre_compile.py(473): for tp in STRING_TYPES:
|
|
sre_compile.py(474): if isinstance(obj, tp):
|
|
sre_compile.py(475): return 1
|
|
re.py(241): try:
|
|
re.py(242): p = sre_compile.compile(pattern, flags)
|
|
--- modulename: sre_compile, funcname: compile
|
|
sre_compile.py(496): if isstring(p):
|
|
--- modulename: sre_compile, funcname: isstring
|
|
sre_compile.py(473): for tp in STRING_TYPES:
|
|
sre_compile.py(474): if isinstance(obj, tp):
|
|
sre_compile.py(475): return 1
|
|
sre_compile.py(497): pattern = p
|
|
sre_compile.py(498): p = sre_parse.parse(p, flags)
|
|
--- modulename: sre_parse, funcname: parse
|
|
sre_parse.py(678): source = Tokenizer(str)
|
|
--- modulename: sre_parse, funcname: __init__
|
|
sre_parse.py(179): self.string = string
|
|
sre_parse.py(180): self.index = 0
|
|
sre_parse.py(181): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(680): if pattern is None:
|
|
sre_parse.py(681): pattern = Pattern()
|
|
--- modulename: sre_parse, funcname: __init__
|
|
sre_parse.py(68): self.flags = 0
|
|
sre_parse.py(69): self.open = []
|
|
sre_parse.py(70): self.groups = 1
|
|
sre_parse.py(71): self.groupdict = {}
|
|
sre_parse.py(682): pattern.flags = flags
|
|
sre_parse.py(683): pattern.str = str
|
|
sre_parse.py(685): p = _parse_sub(source, pattern, 0)
|
|
--- modulename: sre_parse, funcname: _parse_sub
|
|
sre_parse.py(304): items = []
|
|
sre_parse.py(305): itemsappend = items.append
|
|
sre_parse.py(306): sourcematch = source.match
|
|
sre_parse.py(307): while 1:
|
|
sre_parse.py(308): itemsappend(_parse(source, state))
|
|
--- modulename: sre_parse, funcname: _parse
|
|
sre_parse.py(381): subpattern = SubPattern(state)
|
|
--- modulename: sre_parse, funcname: __init__
|
|
sre_parse.py(91): self.pattern = pattern
|
|
sre_parse.py(92): if data is None:
|
|
sre_parse.py(93): data = []
|
|
sre_parse.py(94): self.data = data
|
|
sre_parse.py(95): self.width = None
|
|
sre_parse.py(384): subpatternappend = subpattern.append
|
|
sre_parse.py(385): sourceget = source.get
|
|
sre_parse.py(386): sourcematch = source.match
|
|
sre_parse.py(387): _len = len
|
|
sre_parse.py(388): PATTERNENDERS = _PATTERNENDERS
|
|
sre_parse.py(389): ASSERTCHARS = _ASSERTCHARS
|
|
sre_parse.py(390): LOOKBEHINDASSERTCHARS = _LOOKBEHINDASSERTCHARS
|
|
sre_parse.py(391): REPEATCODES = _REPEATCODES
|
|
sre_parse.py(393): while 1:
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(397): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(398): if this is None:
|
|
sre_parse.py(401): if state.flags & SRE_FLAG_VERBOSE:
|
|
sre_parse.py(403): if this in WHITESPACE:
|
|
sre_parse.py(405): if this == "#":
|
|
sre_parse.py(412): if this and this[0] not in SPECIAL_CHARS:
|
|
sre_parse.py(415): elif this == "[":
|
|
sre_parse.py(472): elif this and this[0] in REPEAT_CHARS:
|
|
sre_parse.py(525): elif this == ".":
|
|
sre_parse.py(528): elif this == "(":
|
|
sre_parse.py(529): group = 1
|
|
sre_parse.py(530): name = None
|
|
sre_parse.py(531): condgroup = None
|
|
sre_parse.py(532): if sourcematch("?"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(635): if group:
|
|
sre_parse.py(637): if group == 2:
|
|
sre_parse.py(641): group = state.opengroup(name)
|
|
--- modulename: sre_parse, funcname: opengroup
|
|
sre_parse.py(73): gid = self.groups
|
|
sre_parse.py(74): self.groups = gid + 1
|
|
sre_parse.py(75): if name is not None:
|
|
sre_parse.py(81): self.open.append(gid)
|
|
sre_parse.py(82): return gid
|
|
sre_parse.py(642): if condgroup:
|
|
sre_parse.py(645): p = _parse_sub(source, state)
|
|
--- modulename: sre_parse, funcname: _parse_sub
|
|
sre_parse.py(304): items = []
|
|
sre_parse.py(305): itemsappend = items.append
|
|
sre_parse.py(306): sourcematch = source.match
|
|
sre_parse.py(307): while 1:
|
|
sre_parse.py(308): itemsappend(_parse(source, state))
|
|
--- modulename: sre_parse, funcname: _parse
|
|
sre_parse.py(381): subpattern = SubPattern(state)
|
|
--- modulename: sre_parse, funcname: __init__
|
|
sre_parse.py(91): self.pattern = pattern
|
|
sre_parse.py(92): if data is None:
|
|
sre_parse.py(93): data = []
|
|
sre_parse.py(94): self.data = data
|
|
sre_parse.py(95): self.width = None
|
|
sre_parse.py(384): subpatternappend = subpattern.append
|
|
sre_parse.py(385): sourceget = source.get
|
|
sre_parse.py(386): sourcematch = source.match
|
|
sre_parse.py(387): _len = len
|
|
sre_parse.py(388): PATTERNENDERS = _PATTERNENDERS
|
|
sre_parse.py(389): ASSERTCHARS = _ASSERTCHARS
|
|
sre_parse.py(390): LOOKBEHINDASSERTCHARS = _LOOKBEHINDASSERTCHARS
|
|
sre_parse.py(391): REPEATCODES = _REPEATCODES
|
|
sre_parse.py(393): while 1:
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(397): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(398): if this is None:
|
|
sre_parse.py(401): if state.flags & SRE_FLAG_VERBOSE:
|
|
sre_parse.py(403): if this in WHITESPACE:
|
|
sre_parse.py(405): if this == "#":
|
|
sre_parse.py(412): if this and this[0] not in SPECIAL_CHARS:
|
|
sre_parse.py(413): subpatternappend((LITERAL, ord(this)))
|
|
--- modulename: sre_parse, funcname: append
|
|
sre_parse.py(139): self.data.append(code)
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(397): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(398): if this is None:
|
|
sre_parse.py(401): if state.flags & SRE_FLAG_VERBOSE:
|
|
sre_parse.py(403): if this in WHITESPACE:
|
|
sre_parse.py(405): if this == "#":
|
|
sre_parse.py(412): if this and this[0] not in SPECIAL_CHARS:
|
|
sre_parse.py(415): elif this == "[":
|
|
sre_parse.py(472): elif this and this[0] in REPEAT_CHARS:
|
|
sre_parse.py(474): if this == "?":
|
|
sre_parse.py(475): min, max = 0, 1
|
|
sre_parse.py(512): if subpattern:
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
sre_parse.py(513): item = subpattern[-1:]
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(132): return SubPattern(self.pattern, self.data[index])
|
|
--- modulename: sre_parse, funcname: __init__
|
|
sre_parse.py(91): self.pattern = pattern
|
|
sre_parse.py(92): if data is None:
|
|
sre_parse.py(94): self.data = data
|
|
sre_parse.py(95): self.width = None
|
|
sre_parse.py(516): if not item or (_len(item) == 1 and item[0][0] == AT):
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_parse.py(518): if item[0][0] in REPEATCODES:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_parse.py(520): if sourcematch("?"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(523): subpattern[-1] = (MAX_REPEAT, (min, max, item))
|
|
--- modulename: sre_parse, funcname: __setitem__
|
|
sre_parse.py(135): self.data[index] = code
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(397): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(398): if this is None:
|
|
sre_parse.py(401): if state.flags & SRE_FLAG_VERBOSE:
|
|
sre_parse.py(403): if this in WHITESPACE:
|
|
sre_parse.py(405): if this == "#":
|
|
sre_parse.py(412): if this and this[0] not in SPECIAL_CHARS:
|
|
sre_parse.py(415): elif this == "[":
|
|
sre_parse.py(472): elif this and this[0] in REPEAT_CHARS:
|
|
sre_parse.py(525): elif this == ".":
|
|
sre_parse.py(528): elif this == "(":
|
|
sre_parse.py(529): group = 1
|
|
sre_parse.py(530): name = None
|
|
sre_parse.py(531): condgroup = None
|
|
sre_parse.py(532): if sourcematch("?"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(197): if skip:
|
|
sre_parse.py(198): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(199): return 1
|
|
sre_parse.py(533): group = 0
|
|
sre_parse.py(535): if sourcematch("P"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(578): elif sourcematch(":"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(197): if skip:
|
|
sre_parse.py(198): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(199): return 1
|
|
sre_parse.py(580): group = 2
|
|
sre_parse.py(635): if group:
|
|
sre_parse.py(637): if group == 2:
|
|
sre_parse.py(639): group = None
|
|
sre_parse.py(642): if condgroup:
|
|
sre_parse.py(645): p = _parse_sub(source, state)
|
|
--- modulename: sre_parse, funcname: _parse_sub
|
|
sre_parse.py(304): items = []
|
|
sre_parse.py(305): itemsappend = items.append
|
|
sre_parse.py(306): sourcematch = source.match
|
|
sre_parse.py(307): while 1:
|
|
sre_parse.py(308): itemsappend(_parse(source, state))
|
|
--- modulename: sre_parse, funcname: _parse
|
|
sre_parse.py(381): subpattern = SubPattern(state)
|
|
--- modulename: sre_parse, funcname: __init__
|
|
sre_parse.py(91): self.pattern = pattern
|
|
sre_parse.py(92): if data is None:
|
|
sre_parse.py(93): data = []
|
|
sre_parse.py(94): self.data = data
|
|
sre_parse.py(95): self.width = None
|
|
sre_parse.py(384): subpatternappend = subpattern.append
|
|
sre_parse.py(385): sourceget = source.get
|
|
sre_parse.py(386): sourcematch = source.match
|
|
sre_parse.py(387): _len = len
|
|
sre_parse.py(388): PATTERNENDERS = _PATTERNENDERS
|
|
sre_parse.py(389): ASSERTCHARS = _ASSERTCHARS
|
|
sre_parse.py(390): LOOKBEHINDASSERTCHARS = _LOOKBEHINDASSERTCHARS
|
|
sre_parse.py(391): REPEATCODES = _REPEATCODES
|
|
sre_parse.py(393): while 1:
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(397): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(398): if this is None:
|
|
sre_parse.py(401): if state.flags & SRE_FLAG_VERBOSE:
|
|
sre_parse.py(403): if this in WHITESPACE:
|
|
sre_parse.py(405): if this == "#":
|
|
sre_parse.py(412): if this and this[0] not in SPECIAL_CHARS:
|
|
sre_parse.py(413): subpatternappend((LITERAL, ord(this)))
|
|
--- modulename: sre_parse, funcname: append
|
|
sre_parse.py(139): self.data.append(code)
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(396): break # end of subpattern
|
|
sre_parse.py(673): return subpattern
|
|
sre_parse.py(309): if sourcematch("|"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(197): if skip:
|
|
sre_parse.py(198): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(199): return 1
|
|
sre_parse.py(310): continue
|
|
sre_parse.py(308): itemsappend(_parse(source, state))
|
|
--- modulename: sre_parse, funcname: _parse
|
|
sre_parse.py(381): subpattern = SubPattern(state)
|
|
--- modulename: sre_parse, funcname: __init__
|
|
sre_parse.py(91): self.pattern = pattern
|
|
sre_parse.py(92): if data is None:
|
|
sre_parse.py(93): data = []
|
|
sre_parse.py(94): self.data = data
|
|
sre_parse.py(95): self.width = None
|
|
sre_parse.py(384): subpatternappend = subpattern.append
|
|
sre_parse.py(385): sourceget = source.get
|
|
sre_parse.py(386): sourcematch = source.match
|
|
sre_parse.py(387): _len = len
|
|
sre_parse.py(388): PATTERNENDERS = _PATTERNENDERS
|
|
sre_parse.py(389): ASSERTCHARS = _ASSERTCHARS
|
|
sre_parse.py(390): LOOKBEHINDASSERTCHARS = _LOOKBEHINDASSERTCHARS
|
|
sre_parse.py(391): REPEATCODES = _REPEATCODES
|
|
sre_parse.py(393): while 1:
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(397): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(398): if this is None:
|
|
sre_parse.py(401): if state.flags & SRE_FLAG_VERBOSE:
|
|
sre_parse.py(403): if this in WHITESPACE:
|
|
sre_parse.py(405): if this == "#":
|
|
sre_parse.py(412): if this and this[0] not in SPECIAL_CHARS:
|
|
sre_parse.py(415): elif this == "[":
|
|
sre_parse.py(417): set = []
|
|
sre_parse.py(418): setappend = set.append
|
|
sre_parse.py(421): if sourcematch("^"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(424): start = set[:]
|
|
sre_parse.py(425): while 1:
|
|
sre_parse.py(426): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(427): if this == "]" and set != start:
|
|
sre_parse.py(429): elif this and this[0] == "\\":
|
|
sre_parse.py(431): elif this:
|
|
sre_parse.py(432): code1 = LITERAL, ord(this)
|
|
sre_parse.py(435): if sourcematch("-"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(197): if skip:
|
|
sre_parse.py(198): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(199): return 1
|
|
sre_parse.py(437): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(438): if this == "]":
|
|
sre_parse.py(444): elif this:
|
|
sre_parse.py(445): if this[0] == "\\":
|
|
sre_parse.py(448): code2 = LITERAL, ord(this)
|
|
sre_parse.py(449): if code1[0] != LITERAL or code2[0] != LITERAL:
|
|
sre_parse.py(451): lo = code1[1]
|
|
sre_parse.py(452): hi = code2[1]
|
|
sre_parse.py(453): if hi < lo:
|
|
sre_parse.py(455): setappend((RANGE, (lo, hi)))
|
|
sre_parse.py(426): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(188): try:
|
|
sre_parse.py(189): c = self.string[self.index + 1]
|
|
sre_parse.py(192): char = char + c
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(427): if this == "]" and set != start:
|
|
sre_parse.py(428): break
|
|
sre_parse.py(464): if _len(set)==1 and set[0][0] is LITERAL:
|
|
sre_parse.py(466): elif _len(set)==2 and set[0][0] is NEGATE and set[1][0] is LITERAL:
|
|
sre_parse.py(470): subpatternappend((IN, set))
|
|
--- modulename: sre_parse, funcname: append
|
|
sre_parse.py(139): self.data.append(code)
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(397): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(398): if this is None:
|
|
sre_parse.py(401): if state.flags & SRE_FLAG_VERBOSE:
|
|
sre_parse.py(403): if this in WHITESPACE:
|
|
sre_parse.py(405): if this == "#":
|
|
sre_parse.py(412): if this and this[0] not in SPECIAL_CHARS:
|
|
sre_parse.py(415): elif this == "[":
|
|
sre_parse.py(472): elif this and this[0] in REPEAT_CHARS:
|
|
sre_parse.py(525): elif this == ".":
|
|
sre_parse.py(528): elif this == "(":
|
|
sre_parse.py(660): elif this == "^":
|
|
sre_parse.py(663): elif this == "$":
|
|
sre_parse.py(666): elif this and this[0] == "\\":
|
|
sre_parse.py(667): code = _escape(source, this, state)
|
|
--- modulename: sre_parse, funcname: _escape
|
|
sre_parse.py(259): code = CATEGORIES.get(escape)
|
|
sre_parse.py(260): if code:
|
|
sre_parse.py(261): return code
|
|
sre_parse.py(668): subpatternappend(code)
|
|
--- modulename: sre_parse, funcname: append
|
|
sre_parse.py(139): self.data.append(code)
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(397): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(398): if this is None:
|
|
sre_parse.py(401): if state.flags & SRE_FLAG_VERBOSE:
|
|
sre_parse.py(403): if this in WHITESPACE:
|
|
sre_parse.py(405): if this == "#":
|
|
sre_parse.py(412): if this and this[0] not in SPECIAL_CHARS:
|
|
sre_parse.py(415): elif this == "[":
|
|
sre_parse.py(472): elif this and this[0] in REPEAT_CHARS:
|
|
sre_parse.py(474): if this == "?":
|
|
sre_parse.py(476): elif this == "*":
|
|
sre_parse.py(477): min, max = 0, MAXREPEAT
|
|
sre_parse.py(512): if subpattern:
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
sre_parse.py(513): item = subpattern[-1:]
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(132): return SubPattern(self.pattern, self.data[index])
|
|
--- modulename: sre_parse, funcname: __init__
|
|
sre_parse.py(91): self.pattern = pattern
|
|
sre_parse.py(92): if data is None:
|
|
sre_parse.py(94): self.data = data
|
|
sre_parse.py(95): self.width = None
|
|
sre_parse.py(516): if not item or (_len(item) == 1 and item[0][0] == AT):
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_parse.py(518): if item[0][0] in REPEATCODES:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_parse.py(520): if sourcematch("?"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(523): subpattern[-1] = (MAX_REPEAT, (min, max, item))
|
|
--- modulename: sre_parse, funcname: __setitem__
|
|
sre_parse.py(135): self.data[index] = code
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(396): break # end of subpattern
|
|
sre_parse.py(673): return subpattern
|
|
sre_parse.py(309): if sourcematch("|"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(311): if not nested:
|
|
sre_parse.py(313): if not source.next or sourcematch(")", 0):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(197): if skip:
|
|
sre_parse.py(199): return 1
|
|
sre_parse.py(314): break
|
|
sre_parse.py(318): if len(items) == 1:
|
|
sre_parse.py(321): subpattern = SubPattern(state)
|
|
--- modulename: sre_parse, funcname: __init__
|
|
sre_parse.py(91): self.pattern = pattern
|
|
sre_parse.py(92): if data is None:
|
|
sre_parse.py(93): data = []
|
|
sre_parse.py(94): self.data = data
|
|
sre_parse.py(95): self.width = None
|
|
sre_parse.py(322): subpatternappend = subpattern.append
|
|
sre_parse.py(325): while 1:
|
|
sre_parse.py(326): prefix = None
|
|
sre_parse.py(327): for item in items:
|
|
sre_parse.py(328): if not item:
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
sre_parse.py(330): if prefix is None:
|
|
sre_parse.py(331): prefix = item[0]
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_parse.py(327): for item in items:
|
|
sre_parse.py(328): if not item:
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
sre_parse.py(330): if prefix is None:
|
|
sre_parse.py(332): elif item[0] != prefix:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_parse.py(333): break
|
|
sre_parse.py(341): break
|
|
sre_parse.py(344): for item in items:
|
|
sre_parse.py(345): if len(item) != 1 or item[0][0] != LITERAL:
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_parse.py(344): for item in items:
|
|
sre_parse.py(345): if len(item) != 1 or item[0][0] != LITERAL:
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
sre_parse.py(346): break
|
|
sre_parse.py(357): subpattern.append((BRANCH, (None, items)))
|
|
--- modulename: sre_parse, funcname: append
|
|
sre_parse.py(139): self.data.append(code)
|
|
sre_parse.py(358): return subpattern
|
|
sre_parse.py(646): if not sourcematch(")"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(197): if skip:
|
|
sre_parse.py(198): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(199): return 1
|
|
sre_parse.py(648): if group is not None:
|
|
sre_parse.py(650): subpatternappend((SUBPATTERN, (group, p)))
|
|
--- modulename: sre_parse, funcname: append
|
|
sre_parse.py(139): self.data.append(code)
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(396): break # end of subpattern
|
|
sre_parse.py(673): return subpattern
|
|
sre_parse.py(309): if sourcematch("|"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(311): if not nested:
|
|
sre_parse.py(313): if not source.next or sourcematch(")", 0):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(197): if skip:
|
|
sre_parse.py(199): return 1
|
|
sre_parse.py(314): break
|
|
sre_parse.py(318): if len(items) == 1:
|
|
sre_parse.py(319): return items[0]
|
|
sre_parse.py(646): if not sourcematch(")"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(197): if skip:
|
|
sre_parse.py(198): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(199): return 1
|
|
sre_parse.py(648): if group is not None:
|
|
sre_parse.py(649): state.closegroup(group)
|
|
--- modulename: sre_parse, funcname: closegroup
|
|
sre_parse.py(84): self.open.remove(gid)
|
|
sre_parse.py(650): subpatternappend((SUBPATTERN, (group, p)))
|
|
--- modulename: sre_parse, funcname: append
|
|
sre_parse.py(139): self.data.append(code)
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(397): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(188): try:
|
|
sre_parse.py(189): c = self.string[self.index + 1]
|
|
sre_parse.py(192): char = char + c
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(398): if this is None:
|
|
sre_parse.py(401): if state.flags & SRE_FLAG_VERBOSE:
|
|
sre_parse.py(403): if this in WHITESPACE:
|
|
sre_parse.py(405): if this == "#":
|
|
sre_parse.py(412): if this and this[0] not in SPECIAL_CHARS:
|
|
sre_parse.py(415): elif this == "[":
|
|
sre_parse.py(472): elif this and this[0] in REPEAT_CHARS:
|
|
sre_parse.py(525): elif this == ".":
|
|
sre_parse.py(528): elif this == "(":
|
|
sre_parse.py(529): group = 1
|
|
sre_parse.py(530): name = None
|
|
sre_parse.py(531): condgroup = None
|
|
sre_parse.py(532): if sourcematch("?"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(635): if group:
|
|
sre_parse.py(637): if group == 2:
|
|
sre_parse.py(641): group = state.opengroup(name)
|
|
--- modulename: sre_parse, funcname: opengroup
|
|
sre_parse.py(73): gid = self.groups
|
|
sre_parse.py(74): self.groups = gid + 1
|
|
sre_parse.py(75): if name is not None:
|
|
sre_parse.py(81): self.open.append(gid)
|
|
sre_parse.py(82): return gid
|
|
sre_parse.py(642): if condgroup:
|
|
sre_parse.py(645): p = _parse_sub(source, state)
|
|
--- modulename: sre_parse, funcname: _parse_sub
|
|
sre_parse.py(304): items = []
|
|
sre_parse.py(305): itemsappend = items.append
|
|
sre_parse.py(306): sourcematch = source.match
|
|
sre_parse.py(307): while 1:
|
|
sre_parse.py(308): itemsappend(_parse(source, state))
|
|
--- modulename: sre_parse, funcname: _parse
|
|
sre_parse.py(381): subpattern = SubPattern(state)
|
|
--- modulename: sre_parse, funcname: __init__
|
|
sre_parse.py(91): self.pattern = pattern
|
|
sre_parse.py(92): if data is None:
|
|
sre_parse.py(93): data = []
|
|
sre_parse.py(94): self.data = data
|
|
sre_parse.py(95): self.width = None
|
|
sre_parse.py(384): subpatternappend = subpattern.append
|
|
sre_parse.py(385): sourceget = source.get
|
|
sre_parse.py(386): sourcematch = source.match
|
|
sre_parse.py(387): _len = len
|
|
sre_parse.py(388): PATTERNENDERS = _PATTERNENDERS
|
|
sre_parse.py(389): ASSERTCHARS = _ASSERTCHARS
|
|
sre_parse.py(390): LOOKBEHINDASSERTCHARS = _LOOKBEHINDASSERTCHARS
|
|
sre_parse.py(391): REPEATCODES = _REPEATCODES
|
|
sre_parse.py(393): while 1:
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(397): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(188): try:
|
|
sre_parse.py(189): c = self.string[self.index + 1]
|
|
sre_parse.py(192): char = char + c
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(398): if this is None:
|
|
sre_parse.py(401): if state.flags & SRE_FLAG_VERBOSE:
|
|
sre_parse.py(403): if this in WHITESPACE:
|
|
sre_parse.py(405): if this == "#":
|
|
sre_parse.py(412): if this and this[0] not in SPECIAL_CHARS:
|
|
sre_parse.py(415): elif this == "[":
|
|
sre_parse.py(472): elif this and this[0] in REPEAT_CHARS:
|
|
sre_parse.py(525): elif this == ".":
|
|
sre_parse.py(528): elif this == "(":
|
|
sre_parse.py(660): elif this == "^":
|
|
sre_parse.py(663): elif this == "$":
|
|
sre_parse.py(666): elif this and this[0] == "\\":
|
|
sre_parse.py(667): code = _escape(source, this, state)
|
|
--- modulename: sre_parse, funcname: _escape
|
|
sre_parse.py(259): code = CATEGORIES.get(escape)
|
|
sre_parse.py(260): if code:
|
|
sre_parse.py(262): code = ESCAPES.get(escape)
|
|
sre_parse.py(263): if code:
|
|
sre_parse.py(265): try:
|
|
sre_parse.py(266): c = escape[1:2]
|
|
sre_parse.py(267): if c == "x":
|
|
sre_parse.py(274): elif c == "0":
|
|
sre_parse.py(279): elif c in DIGITS:
|
|
sre_parse.py(295): if len(escape) == 2:
|
|
sre_parse.py(296): return LITERAL, ord(escape[1])
|
|
sre_parse.py(668): subpatternappend(code)
|
|
--- modulename: sre_parse, funcname: append
|
|
sre_parse.py(139): self.data.append(code)
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(397): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(398): if this is None:
|
|
sre_parse.py(401): if state.flags & SRE_FLAG_VERBOSE:
|
|
sre_parse.py(403): if this in WHITESPACE:
|
|
sre_parse.py(405): if this == "#":
|
|
sre_parse.py(412): if this and this[0] not in SPECIAL_CHARS:
|
|
sre_parse.py(415): elif this == "[":
|
|
sre_parse.py(472): elif this and this[0] in REPEAT_CHARS:
|
|
sre_parse.py(525): elif this == ".":
|
|
sre_parse.py(528): elif this == "(":
|
|
sre_parse.py(660): elif this == "^":
|
|
sre_parse.py(663): elif this == "$":
|
|
sre_parse.py(666): elif this and this[0] == "\\":
|
|
sre_parse.py(667): code = _escape(source, this, state)
|
|
--- modulename: sre_parse, funcname: _escape
|
|
sre_parse.py(259): code = CATEGORIES.get(escape)
|
|
sre_parse.py(260): if code:
|
|
sre_parse.py(261): return code
|
|
sre_parse.py(668): subpatternappend(code)
|
|
--- modulename: sre_parse, funcname: append
|
|
sre_parse.py(139): self.data.append(code)
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(397): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(398): if this is None:
|
|
sre_parse.py(401): if state.flags & SRE_FLAG_VERBOSE:
|
|
sre_parse.py(403): if this in WHITESPACE:
|
|
sre_parse.py(405): if this == "#":
|
|
sre_parse.py(412): if this and this[0] not in SPECIAL_CHARS:
|
|
sre_parse.py(415): elif this == "[":
|
|
sre_parse.py(472): elif this and this[0] in REPEAT_CHARS:
|
|
sre_parse.py(474): if this == "?":
|
|
sre_parse.py(476): elif this == "*":
|
|
sre_parse.py(479): elif this == "+":
|
|
sre_parse.py(480): min, max = 1, MAXREPEAT
|
|
sre_parse.py(512): if subpattern:
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
sre_parse.py(513): item = subpattern[-1:]
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(132): return SubPattern(self.pattern, self.data[index])
|
|
--- modulename: sre_parse, funcname: __init__
|
|
sre_parse.py(91): self.pattern = pattern
|
|
sre_parse.py(92): if data is None:
|
|
sre_parse.py(94): self.data = data
|
|
sre_parse.py(95): self.width = None
|
|
sre_parse.py(516): if not item or (_len(item) == 1 and item[0][0] == AT):
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_parse.py(518): if item[0][0] in REPEATCODES:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_parse.py(520): if sourcematch("?"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(523): subpattern[-1] = (MAX_REPEAT, (min, max, item))
|
|
--- modulename: sre_parse, funcname: __setitem__
|
|
sre_parse.py(135): self.data[index] = code
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(396): break # end of subpattern
|
|
sre_parse.py(673): return subpattern
|
|
sre_parse.py(309): if sourcematch("|"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(311): if not nested:
|
|
sre_parse.py(313): if not source.next or sourcematch(")", 0):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(197): if skip:
|
|
sre_parse.py(199): return 1
|
|
sre_parse.py(314): break
|
|
sre_parse.py(318): if len(items) == 1:
|
|
sre_parse.py(319): return items[0]
|
|
sre_parse.py(646): if not sourcematch(")"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(197): if skip:
|
|
sre_parse.py(198): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(199): return 1
|
|
sre_parse.py(648): if group is not None:
|
|
sre_parse.py(649): state.closegroup(group)
|
|
--- modulename: sre_parse, funcname: closegroup
|
|
sre_parse.py(84): self.open.remove(gid)
|
|
sre_parse.py(650): subpatternappend((SUBPATTERN, (group, p)))
|
|
--- modulename: sre_parse, funcname: append
|
|
sre_parse.py(139): self.data.append(code)
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(397): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(398): if this is None:
|
|
sre_parse.py(401): if state.flags & SRE_FLAG_VERBOSE:
|
|
sre_parse.py(403): if this in WHITESPACE:
|
|
sre_parse.py(405): if this == "#":
|
|
sre_parse.py(412): if this and this[0] not in SPECIAL_CHARS:
|
|
sre_parse.py(415): elif this == "[":
|
|
sre_parse.py(472): elif this and this[0] in REPEAT_CHARS:
|
|
sre_parse.py(474): if this == "?":
|
|
sre_parse.py(475): min, max = 0, 1
|
|
sre_parse.py(512): if subpattern:
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
sre_parse.py(513): item = subpattern[-1:]
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(132): return SubPattern(self.pattern, self.data[index])
|
|
--- modulename: sre_parse, funcname: __init__
|
|
sre_parse.py(91): self.pattern = pattern
|
|
sre_parse.py(92): if data is None:
|
|
sre_parse.py(94): self.data = data
|
|
sre_parse.py(95): self.width = None
|
|
sre_parse.py(516): if not item or (_len(item) == 1 and item[0][0] == AT):
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_parse.py(518): if item[0][0] in REPEATCODES:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_parse.py(520): if sourcematch("?"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(523): subpattern[-1] = (MAX_REPEAT, (min, max, item))
|
|
--- modulename: sre_parse, funcname: __setitem__
|
|
sre_parse.py(135): self.data[index] = code
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(397): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(398): if this is None:
|
|
sre_parse.py(401): if state.flags & SRE_FLAG_VERBOSE:
|
|
sre_parse.py(403): if this in WHITESPACE:
|
|
sre_parse.py(405): if this == "#":
|
|
sre_parse.py(412): if this and this[0] not in SPECIAL_CHARS:
|
|
sre_parse.py(415): elif this == "[":
|
|
sre_parse.py(472): elif this and this[0] in REPEAT_CHARS:
|
|
sre_parse.py(525): elif this == ".":
|
|
sre_parse.py(528): elif this == "(":
|
|
sre_parse.py(529): group = 1
|
|
sre_parse.py(530): name = None
|
|
sre_parse.py(531): condgroup = None
|
|
sre_parse.py(532): if sourcematch("?"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(635): if group:
|
|
sre_parse.py(637): if group == 2:
|
|
sre_parse.py(641): group = state.opengroup(name)
|
|
--- modulename: sre_parse, funcname: opengroup
|
|
sre_parse.py(73): gid = self.groups
|
|
sre_parse.py(74): self.groups = gid + 1
|
|
sre_parse.py(75): if name is not None:
|
|
sre_parse.py(81): self.open.append(gid)
|
|
sre_parse.py(82): return gid
|
|
sre_parse.py(642): if condgroup:
|
|
sre_parse.py(645): p = _parse_sub(source, state)
|
|
--- modulename: sre_parse, funcname: _parse_sub
|
|
sre_parse.py(304): items = []
|
|
sre_parse.py(305): itemsappend = items.append
|
|
sre_parse.py(306): sourcematch = source.match
|
|
sre_parse.py(307): while 1:
|
|
sre_parse.py(308): itemsappend(_parse(source, state))
|
|
--- modulename: sre_parse, funcname: _parse
|
|
sre_parse.py(381): subpattern = SubPattern(state)
|
|
--- modulename: sre_parse, funcname: __init__
|
|
sre_parse.py(91): self.pattern = pattern
|
|
sre_parse.py(92): if data is None:
|
|
sre_parse.py(93): data = []
|
|
sre_parse.py(94): self.data = data
|
|
sre_parse.py(95): self.width = None
|
|
sre_parse.py(384): subpatternappend = subpattern.append
|
|
sre_parse.py(385): sourceget = source.get
|
|
sre_parse.py(386): sourcematch = source.match
|
|
sre_parse.py(387): _len = len
|
|
sre_parse.py(388): PATTERNENDERS = _PATTERNENDERS
|
|
sre_parse.py(389): ASSERTCHARS = _ASSERTCHARS
|
|
sre_parse.py(390): LOOKBEHINDASSERTCHARS = _LOOKBEHINDASSERTCHARS
|
|
sre_parse.py(391): REPEATCODES = _REPEATCODES
|
|
sre_parse.py(393): while 1:
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(397): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(398): if this is None:
|
|
sre_parse.py(401): if state.flags & SRE_FLAG_VERBOSE:
|
|
sre_parse.py(403): if this in WHITESPACE:
|
|
sre_parse.py(405): if this == "#":
|
|
sre_parse.py(412): if this and this[0] not in SPECIAL_CHARS:
|
|
sre_parse.py(415): elif this == "[":
|
|
sre_parse.py(417): set = []
|
|
sre_parse.py(418): setappend = set.append
|
|
sre_parse.py(421): if sourcematch("^"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(424): start = set[:]
|
|
sre_parse.py(425): while 1:
|
|
sre_parse.py(426): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(427): if this == "]" and set != start:
|
|
sre_parse.py(429): elif this and this[0] == "\\":
|
|
sre_parse.py(431): elif this:
|
|
sre_parse.py(432): code1 = LITERAL, ord(this)
|
|
sre_parse.py(435): if sourcematch("-"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(459): if code1[0] is IN:
|
|
sre_parse.py(461): setappend(code1)
|
|
sre_parse.py(426): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(427): if this == "]" and set != start:
|
|
sre_parse.py(429): elif this and this[0] == "\\":
|
|
sre_parse.py(431): elif this:
|
|
sre_parse.py(432): code1 = LITERAL, ord(this)
|
|
sre_parse.py(435): if sourcematch("-"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(459): if code1[0] is IN:
|
|
sre_parse.py(461): setappend(code1)
|
|
sre_parse.py(426): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(427): if this == "]" and set != start:
|
|
sre_parse.py(428): break
|
|
sre_parse.py(464): if _len(set)==1 and set[0][0] is LITERAL:
|
|
sre_parse.py(466): elif _len(set)==2 and set[0][0] is NEGATE and set[1][0] is LITERAL:
|
|
sre_parse.py(470): subpatternappend((IN, set))
|
|
--- modulename: sre_parse, funcname: append
|
|
sre_parse.py(139): self.data.append(code)
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(397): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(398): if this is None:
|
|
sre_parse.py(401): if state.flags & SRE_FLAG_VERBOSE:
|
|
sre_parse.py(403): if this in WHITESPACE:
|
|
sre_parse.py(405): if this == "#":
|
|
sre_parse.py(412): if this and this[0] not in SPECIAL_CHARS:
|
|
sre_parse.py(415): elif this == "[":
|
|
sre_parse.py(417): set = []
|
|
sre_parse.py(418): setappend = set.append
|
|
sre_parse.py(421): if sourcematch("^"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(424): start = set[:]
|
|
sre_parse.py(425): while 1:
|
|
sre_parse.py(426): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(427): if this == "]" and set != start:
|
|
sre_parse.py(429): elif this and this[0] == "\\":
|
|
sre_parse.py(431): elif this:
|
|
sre_parse.py(432): code1 = LITERAL, ord(this)
|
|
sre_parse.py(435): if sourcematch("-"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(459): if code1[0] is IN:
|
|
sre_parse.py(461): setappend(code1)
|
|
sre_parse.py(426): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(427): if this == "]" and set != start:
|
|
sre_parse.py(429): elif this and this[0] == "\\":
|
|
sre_parse.py(431): elif this:
|
|
sre_parse.py(432): code1 = LITERAL, ord(this)
|
|
sre_parse.py(435): if sourcematch("-"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(459): if code1[0] is IN:
|
|
sre_parse.py(461): setappend(code1)
|
|
sre_parse.py(426): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(427): if this == "]" and set != start:
|
|
sre_parse.py(428): break
|
|
sre_parse.py(464): if _len(set)==1 and set[0][0] is LITERAL:
|
|
sre_parse.py(466): elif _len(set)==2 and set[0][0] is NEGATE and set[1][0] is LITERAL:
|
|
sre_parse.py(470): subpatternappend((IN, set))
|
|
--- modulename: sre_parse, funcname: append
|
|
sre_parse.py(139): self.data.append(code)
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(397): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(188): try:
|
|
sre_parse.py(189): c = self.string[self.index + 1]
|
|
sre_parse.py(192): char = char + c
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(398): if this is None:
|
|
sre_parse.py(401): if state.flags & SRE_FLAG_VERBOSE:
|
|
sre_parse.py(403): if this in WHITESPACE:
|
|
sre_parse.py(405): if this == "#":
|
|
sre_parse.py(412): if this and this[0] not in SPECIAL_CHARS:
|
|
sre_parse.py(415): elif this == "[":
|
|
sre_parse.py(472): elif this and this[0] in REPEAT_CHARS:
|
|
sre_parse.py(474): if this == "?":
|
|
sre_parse.py(475): min, max = 0, 1
|
|
sre_parse.py(512): if subpattern:
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
sre_parse.py(513): item = subpattern[-1:]
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(132): return SubPattern(self.pattern, self.data[index])
|
|
--- modulename: sre_parse, funcname: __init__
|
|
sre_parse.py(91): self.pattern = pattern
|
|
sre_parse.py(92): if data is None:
|
|
sre_parse.py(94): self.data = data
|
|
sre_parse.py(95): self.width = None
|
|
sre_parse.py(516): if not item or (_len(item) == 1 and item[0][0] == AT):
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_parse.py(518): if item[0][0] in REPEATCODES:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_parse.py(520): if sourcematch("?"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(523): subpattern[-1] = (MAX_REPEAT, (min, max, item))
|
|
--- modulename: sre_parse, funcname: __setitem__
|
|
sre_parse.py(135): self.data[index] = code
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(397): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(398): if this is None:
|
|
sre_parse.py(401): if state.flags & SRE_FLAG_VERBOSE:
|
|
sre_parse.py(403): if this in WHITESPACE:
|
|
sre_parse.py(405): if this == "#":
|
|
sre_parse.py(412): if this and this[0] not in SPECIAL_CHARS:
|
|
sre_parse.py(415): elif this == "[":
|
|
sre_parse.py(472): elif this and this[0] in REPEAT_CHARS:
|
|
sre_parse.py(525): elif this == ".":
|
|
sre_parse.py(528): elif this == "(":
|
|
sre_parse.py(660): elif this == "^":
|
|
sre_parse.py(663): elif this == "$":
|
|
sre_parse.py(666): elif this and this[0] == "\\":
|
|
sre_parse.py(667): code = _escape(source, this, state)
|
|
--- modulename: sre_parse, funcname: _escape
|
|
sre_parse.py(259): code = CATEGORIES.get(escape)
|
|
sre_parse.py(260): if code:
|
|
sre_parse.py(261): return code
|
|
sre_parse.py(668): subpatternappend(code)
|
|
--- modulename: sre_parse, funcname: append
|
|
sre_parse.py(139): self.data.append(code)
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(397): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(398): if this is None:
|
|
sre_parse.py(401): if state.flags & SRE_FLAG_VERBOSE:
|
|
sre_parse.py(403): if this in WHITESPACE:
|
|
sre_parse.py(405): if this == "#":
|
|
sre_parse.py(412): if this and this[0] not in SPECIAL_CHARS:
|
|
sre_parse.py(415): elif this == "[":
|
|
sre_parse.py(472): elif this and this[0] in REPEAT_CHARS:
|
|
sre_parse.py(474): if this == "?":
|
|
sre_parse.py(476): elif this == "*":
|
|
sre_parse.py(479): elif this == "+":
|
|
sre_parse.py(480): min, max = 1, MAXREPEAT
|
|
sre_parse.py(512): if subpattern:
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
sre_parse.py(513): item = subpattern[-1:]
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(132): return SubPattern(self.pattern, self.data[index])
|
|
--- modulename: sre_parse, funcname: __init__
|
|
sre_parse.py(91): self.pattern = pattern
|
|
sre_parse.py(92): if data is None:
|
|
sre_parse.py(94): self.data = data
|
|
sre_parse.py(95): self.width = None
|
|
sre_parse.py(516): if not item or (_len(item) == 1 and item[0][0] == AT):
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_parse.py(518): if item[0][0] in REPEATCODES:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_parse.py(520): if sourcematch("?"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(523): subpattern[-1] = (MAX_REPEAT, (min, max, item))
|
|
--- modulename: sre_parse, funcname: __setitem__
|
|
sre_parse.py(135): self.data[index] = code
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(396): break # end of subpattern
|
|
sre_parse.py(673): return subpattern
|
|
sre_parse.py(309): if sourcematch("|"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(311): if not nested:
|
|
sre_parse.py(313): if not source.next or sourcematch(")", 0):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(197): if skip:
|
|
sre_parse.py(199): return 1
|
|
sre_parse.py(314): break
|
|
sre_parse.py(318): if len(items) == 1:
|
|
sre_parse.py(319): return items[0]
|
|
sre_parse.py(646): if not sourcematch(")"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(197): if skip:
|
|
sre_parse.py(198): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(199): return 1
|
|
sre_parse.py(648): if group is not None:
|
|
sre_parse.py(649): state.closegroup(group)
|
|
--- modulename: sre_parse, funcname: closegroup
|
|
sre_parse.py(84): self.open.remove(gid)
|
|
sre_parse.py(650): subpatternappend((SUBPATTERN, (group, p)))
|
|
--- modulename: sre_parse, funcname: append
|
|
sre_parse.py(139): self.data.append(code)
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(397): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(184): self.next = None
|
|
sre_parse.py(185): return
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(398): if this is None:
|
|
sre_parse.py(401): if state.flags & SRE_FLAG_VERBOSE:
|
|
sre_parse.py(403): if this in WHITESPACE:
|
|
sre_parse.py(405): if this == "#":
|
|
sre_parse.py(412): if this and this[0] not in SPECIAL_CHARS:
|
|
sre_parse.py(415): elif this == "[":
|
|
sre_parse.py(472): elif this and this[0] in REPEAT_CHARS:
|
|
sre_parse.py(474): if this == "?":
|
|
sre_parse.py(475): min, max = 0, 1
|
|
sre_parse.py(512): if subpattern:
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
sre_parse.py(513): item = subpattern[-1:]
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(132): return SubPattern(self.pattern, self.data[index])
|
|
--- modulename: sre_parse, funcname: __init__
|
|
sre_parse.py(91): self.pattern = pattern
|
|
sre_parse.py(92): if data is None:
|
|
sre_parse.py(94): self.data = data
|
|
sre_parse.py(95): self.width = None
|
|
sre_parse.py(516): if not item or (_len(item) == 1 and item[0][0] == AT):
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_parse.py(518): if item[0][0] in REPEATCODES:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_parse.py(520): if sourcematch("?"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(523): subpattern[-1] = (MAX_REPEAT, (min, max, item))
|
|
--- modulename: sre_parse, funcname: __setitem__
|
|
sre_parse.py(135): self.data[index] = code
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(397): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(184): self.next = None
|
|
sre_parse.py(185): return
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(398): if this is None:
|
|
sre_parse.py(399): break # end of pattern
|
|
sre_parse.py(673): return subpattern
|
|
sre_parse.py(309): if sourcematch("|"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(311): if not nested:
|
|
sre_parse.py(312): break
|
|
sre_parse.py(318): if len(items) == 1:
|
|
sre_parse.py(319): return items[0]
|
|
sre_parse.py(687): tail = source.get()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(184): self.next = None
|
|
sre_parse.py(185): return
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(688): if tail == ")":
|
|
sre_parse.py(690): elif tail:
|
|
sre_parse.py(693): if flags & SRE_FLAG_DEBUG:
|
|
sre_parse.py(696): if not (flags & SRE_FLAG_VERBOSE) and p.pattern.flags & SRE_FLAG_VERBOSE:
|
|
sre_parse.py(701): return p
|
|
sre_compile.py(502): code = _code(p, flags)
|
|
--- modulename: sre_compile, funcname: _code
|
|
sre_compile.py(480): flags = p.pattern.flags | flags
|
|
sre_compile.py(481): code = []
|
|
sre_compile.py(484): _compile_info(code, p, flags)
|
|
--- modulename: sre_compile, funcname: _compile_info
|
|
sre_compile.py(363): lo, hi = pattern.getwidth()
|
|
--- modulename: sre_parse, funcname: getwidth
|
|
sre_parse.py(142): if self.width:
|
|
sre_parse.py(144): lo = hi = 0
|
|
sre_parse.py(145): UNITCODES = (ANY, RANGE, IN, LITERAL, NOT_LITERAL, CATEGORY)
|
|
sre_parse.py(146): REPEATCODES = (MIN_REPEAT, MAX_REPEAT)
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(148): if op is BRANCH:
|
|
sre_parse.py(157): elif op is CALL:
|
|
sre_parse.py(161): elif op is SUBPATTERN:
|
|
sre_parse.py(162): i, j = av[1].getwidth()
|
|
--- modulename: sre_parse, funcname: getwidth
|
|
sre_parse.py(142): if self.width:
|
|
sre_parse.py(144): lo = hi = 0
|
|
sre_parse.py(145): UNITCODES = (ANY, RANGE, IN, LITERAL, NOT_LITERAL, CATEGORY)
|
|
sre_parse.py(146): REPEATCODES = (MIN_REPEAT, MAX_REPEAT)
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(148): if op is BRANCH:
|
|
sre_parse.py(157): elif op is CALL:
|
|
sre_parse.py(161): elif op is SUBPATTERN:
|
|
sre_parse.py(165): elif op in REPEATCODES:
|
|
sre_parse.py(166): i, j = av[2].getwidth()
|
|
--- modulename: sre_parse, funcname: getwidth
|
|
sre_parse.py(142): if self.width:
|
|
sre_parse.py(144): lo = hi = 0
|
|
sre_parse.py(145): UNITCODES = (ANY, RANGE, IN, LITERAL, NOT_LITERAL, CATEGORY)
|
|
sre_parse.py(146): REPEATCODES = (MIN_REPEAT, MAX_REPEAT)
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(148): if op is BRANCH:
|
|
sre_parse.py(157): elif op is CALL:
|
|
sre_parse.py(161): elif op is SUBPATTERN:
|
|
sre_parse.py(165): elif op in REPEATCODES:
|
|
sre_parse.py(169): elif op in UNITCODES:
|
|
sre_parse.py(170): lo = lo + 1
|
|
sre_parse.py(171): hi = hi + 1
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(174): self.width = min(lo, MAXREPEAT - 1), min(hi, MAXREPEAT)
|
|
sre_parse.py(175): return self.width
|
|
sre_parse.py(167): lo = lo + i * av[0]
|
|
sre_parse.py(168): hi = hi + j * av[1]
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(148): if op is BRANCH:
|
|
sre_parse.py(157): elif op is CALL:
|
|
sre_parse.py(161): elif op is SUBPATTERN:
|
|
sre_parse.py(162): i, j = av[1].getwidth()
|
|
--- modulename: sre_parse, funcname: getwidth
|
|
sre_parse.py(142): if self.width:
|
|
sre_parse.py(144): lo = hi = 0
|
|
sre_parse.py(145): UNITCODES = (ANY, RANGE, IN, LITERAL, NOT_LITERAL, CATEGORY)
|
|
sre_parse.py(146): REPEATCODES = (MIN_REPEAT, MAX_REPEAT)
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(148): if op is BRANCH:
|
|
sre_parse.py(149): i = MAXREPEAT - 1
|
|
sre_parse.py(150): j = 0
|
|
sre_parse.py(151): for av in av[1]:
|
|
sre_parse.py(152): l, h = av.getwidth()
|
|
--- modulename: sre_parse, funcname: getwidth
|
|
sre_parse.py(142): if self.width:
|
|
sre_parse.py(144): lo = hi = 0
|
|
sre_parse.py(145): UNITCODES = (ANY, RANGE, IN, LITERAL, NOT_LITERAL, CATEGORY)
|
|
sre_parse.py(146): REPEATCODES = (MIN_REPEAT, MAX_REPEAT)
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(148): if op is BRANCH:
|
|
sre_parse.py(157): elif op is CALL:
|
|
sre_parse.py(161): elif op is SUBPATTERN:
|
|
sre_parse.py(165): elif op in REPEATCODES:
|
|
sre_parse.py(169): elif op in UNITCODES:
|
|
sre_parse.py(170): lo = lo + 1
|
|
sre_parse.py(171): hi = hi + 1
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(174): self.width = min(lo, MAXREPEAT - 1), min(hi, MAXREPEAT)
|
|
sre_parse.py(175): return self.width
|
|
sre_parse.py(153): i = min(i, l)
|
|
sre_parse.py(154): j = max(j, h)
|
|
sre_parse.py(151): for av in av[1]:
|
|
sre_parse.py(152): l, h = av.getwidth()
|
|
--- modulename: sre_parse, funcname: getwidth
|
|
sre_parse.py(142): if self.width:
|
|
sre_parse.py(144): lo = hi = 0
|
|
sre_parse.py(145): UNITCODES = (ANY, RANGE, IN, LITERAL, NOT_LITERAL, CATEGORY)
|
|
sre_parse.py(146): REPEATCODES = (MIN_REPEAT, MAX_REPEAT)
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(148): if op is BRANCH:
|
|
sre_parse.py(157): elif op is CALL:
|
|
sre_parse.py(161): elif op is SUBPATTERN:
|
|
sre_parse.py(165): elif op in REPEATCODES:
|
|
sre_parse.py(169): elif op in UNITCODES:
|
|
sre_parse.py(170): lo = lo + 1
|
|
sre_parse.py(171): hi = hi + 1
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(148): if op is BRANCH:
|
|
sre_parse.py(157): elif op is CALL:
|
|
sre_parse.py(161): elif op is SUBPATTERN:
|
|
sre_parse.py(165): elif op in REPEATCODES:
|
|
sre_parse.py(166): i, j = av[2].getwidth()
|
|
--- modulename: sre_parse, funcname: getwidth
|
|
sre_parse.py(142): if self.width:
|
|
sre_parse.py(144): lo = hi = 0
|
|
sre_parse.py(145): UNITCODES = (ANY, RANGE, IN, LITERAL, NOT_LITERAL, CATEGORY)
|
|
sre_parse.py(146): REPEATCODES = (MIN_REPEAT, MAX_REPEAT)
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(148): if op is BRANCH:
|
|
sre_parse.py(157): elif op is CALL:
|
|
sre_parse.py(161): elif op is SUBPATTERN:
|
|
sre_parse.py(165): elif op in REPEATCODES:
|
|
sre_parse.py(169): elif op in UNITCODES:
|
|
sre_parse.py(170): lo = lo + 1
|
|
sre_parse.py(171): hi = hi + 1
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(174): self.width = min(lo, MAXREPEAT - 1), min(hi, MAXREPEAT)
|
|
sre_parse.py(175): return self.width
|
|
sre_parse.py(167): lo = lo + i * av[0]
|
|
sre_parse.py(168): hi = hi + j * av[1]
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(174): self.width = min(lo, MAXREPEAT - 1), min(hi, MAXREPEAT)
|
|
sre_parse.py(175): return self.width
|
|
sre_parse.py(153): i = min(i, l)
|
|
sre_parse.py(154): j = max(j, h)
|
|
sre_parse.py(151): for av in av[1]:
|
|
sre_parse.py(155): lo = lo + i
|
|
sre_parse.py(156): hi = hi + j
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(174): self.width = min(lo, MAXREPEAT - 1), min(hi, MAXREPEAT)
|
|
sre_parse.py(175): return self.width
|
|
sre_parse.py(163): lo = lo + i
|
|
sre_parse.py(164): hi = hi + j
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(174): self.width = min(lo, MAXREPEAT - 1), min(hi, MAXREPEAT)
|
|
sre_parse.py(175): return self.width
|
|
sre_parse.py(163): lo = lo + i
|
|
sre_parse.py(164): hi = hi + j
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(148): if op is BRANCH:
|
|
sre_parse.py(157): elif op is CALL:
|
|
sre_parse.py(161): elif op is SUBPATTERN:
|
|
sre_parse.py(165): elif op in REPEATCODES:
|
|
sre_parse.py(166): i, j = av[2].getwidth()
|
|
--- modulename: sre_parse, funcname: getwidth
|
|
sre_parse.py(142): if self.width:
|
|
sre_parse.py(144): lo = hi = 0
|
|
sre_parse.py(145): UNITCODES = (ANY, RANGE, IN, LITERAL, NOT_LITERAL, CATEGORY)
|
|
sre_parse.py(146): REPEATCODES = (MIN_REPEAT, MAX_REPEAT)
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(148): if op is BRANCH:
|
|
sre_parse.py(157): elif op is CALL:
|
|
sre_parse.py(161): elif op is SUBPATTERN:
|
|
sre_parse.py(162): i, j = av[1].getwidth()
|
|
--- modulename: sre_parse, funcname: getwidth
|
|
sre_parse.py(142): if self.width:
|
|
sre_parse.py(144): lo = hi = 0
|
|
sre_parse.py(145): UNITCODES = (ANY, RANGE, IN, LITERAL, NOT_LITERAL, CATEGORY)
|
|
sre_parse.py(146): REPEATCODES = (MIN_REPEAT, MAX_REPEAT)
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(148): if op is BRANCH:
|
|
sre_parse.py(157): elif op is CALL:
|
|
sre_parse.py(161): elif op is SUBPATTERN:
|
|
sre_parse.py(165): elif op in REPEATCODES:
|
|
sre_parse.py(169): elif op in UNITCODES:
|
|
sre_parse.py(170): lo = lo + 1
|
|
sre_parse.py(171): hi = hi + 1
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(148): if op is BRANCH:
|
|
sre_parse.py(157): elif op is CALL:
|
|
sre_parse.py(161): elif op is SUBPATTERN:
|
|
sre_parse.py(165): elif op in REPEATCODES:
|
|
sre_parse.py(166): i, j = av[2].getwidth()
|
|
--- modulename: sre_parse, funcname: getwidth
|
|
sre_parse.py(142): if self.width:
|
|
sre_parse.py(144): lo = hi = 0
|
|
sre_parse.py(145): UNITCODES = (ANY, RANGE, IN, LITERAL, NOT_LITERAL, CATEGORY)
|
|
sre_parse.py(146): REPEATCODES = (MIN_REPEAT, MAX_REPEAT)
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(148): if op is BRANCH:
|
|
sre_parse.py(157): elif op is CALL:
|
|
sre_parse.py(161): elif op is SUBPATTERN:
|
|
sre_parse.py(165): elif op in REPEATCODES:
|
|
sre_parse.py(169): elif op in UNITCODES:
|
|
sre_parse.py(170): lo = lo + 1
|
|
sre_parse.py(171): hi = hi + 1
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(174): self.width = min(lo, MAXREPEAT - 1), min(hi, MAXREPEAT)
|
|
sre_parse.py(175): return self.width
|
|
sre_parse.py(167): lo = lo + i * av[0]
|
|
sre_parse.py(168): hi = hi + j * av[1]
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(174): self.width = min(lo, MAXREPEAT - 1), min(hi, MAXREPEAT)
|
|
sre_parse.py(175): return self.width
|
|
sre_parse.py(163): lo = lo + i
|
|
sre_parse.py(164): hi = hi + j
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(174): self.width = min(lo, MAXREPEAT - 1), min(hi, MAXREPEAT)
|
|
sre_parse.py(175): return self.width
|
|
sre_parse.py(167): lo = lo + i * av[0]
|
|
sre_parse.py(168): hi = hi + j * av[1]
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(148): if op is BRANCH:
|
|
sre_parse.py(157): elif op is CALL:
|
|
sre_parse.py(161): elif op is SUBPATTERN:
|
|
sre_parse.py(165): elif op in REPEATCODES:
|
|
sre_parse.py(166): i, j = av[2].getwidth()
|
|
--- modulename: sre_parse, funcname: getwidth
|
|
sre_parse.py(142): if self.width:
|
|
sre_parse.py(144): lo = hi = 0
|
|
sre_parse.py(145): UNITCODES = (ANY, RANGE, IN, LITERAL, NOT_LITERAL, CATEGORY)
|
|
sre_parse.py(146): REPEATCODES = (MIN_REPEAT, MAX_REPEAT)
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(148): if op is BRANCH:
|
|
sre_parse.py(157): elif op is CALL:
|
|
sre_parse.py(161): elif op is SUBPATTERN:
|
|
sre_parse.py(162): i, j = av[1].getwidth()
|
|
--- modulename: sre_parse, funcname: getwidth
|
|
sre_parse.py(142): if self.width:
|
|
sre_parse.py(144): lo = hi = 0
|
|
sre_parse.py(145): UNITCODES = (ANY, RANGE, IN, LITERAL, NOT_LITERAL, CATEGORY)
|
|
sre_parse.py(146): REPEATCODES = (MIN_REPEAT, MAX_REPEAT)
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(148): if op is BRANCH:
|
|
sre_parse.py(157): elif op is CALL:
|
|
sre_parse.py(161): elif op is SUBPATTERN:
|
|
sre_parse.py(165): elif op in REPEATCODES:
|
|
sre_parse.py(169): elif op in UNITCODES:
|
|
sre_parse.py(170): lo = lo + 1
|
|
sre_parse.py(171): hi = hi + 1
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(148): if op is BRANCH:
|
|
sre_parse.py(157): elif op is CALL:
|
|
sre_parse.py(161): elif op is SUBPATTERN:
|
|
sre_parse.py(165): elif op in REPEATCODES:
|
|
sre_parse.py(166): i, j = av[2].getwidth()
|
|
--- modulename: sre_parse, funcname: getwidth
|
|
sre_parse.py(142): if self.width:
|
|
sre_parse.py(144): lo = hi = 0
|
|
sre_parse.py(145): UNITCODES = (ANY, RANGE, IN, LITERAL, NOT_LITERAL, CATEGORY)
|
|
sre_parse.py(146): REPEATCODES = (MIN_REPEAT, MAX_REPEAT)
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(148): if op is BRANCH:
|
|
sre_parse.py(157): elif op is CALL:
|
|
sre_parse.py(161): elif op is SUBPATTERN:
|
|
sre_parse.py(165): elif op in REPEATCODES:
|
|
sre_parse.py(169): elif op in UNITCODES:
|
|
sre_parse.py(170): lo = lo + 1
|
|
sre_parse.py(171): hi = hi + 1
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(174): self.width = min(lo, MAXREPEAT - 1), min(hi, MAXREPEAT)
|
|
sre_parse.py(175): return self.width
|
|
sre_parse.py(167): lo = lo + i * av[0]
|
|
sre_parse.py(168): hi = hi + j * av[1]
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(148): if op is BRANCH:
|
|
sre_parse.py(157): elif op is CALL:
|
|
sre_parse.py(161): elif op is SUBPATTERN:
|
|
sre_parse.py(165): elif op in REPEATCODES:
|
|
sre_parse.py(166): i, j = av[2].getwidth()
|
|
--- modulename: sre_parse, funcname: getwidth
|
|
sre_parse.py(142): if self.width:
|
|
sre_parse.py(144): lo = hi = 0
|
|
sre_parse.py(145): UNITCODES = (ANY, RANGE, IN, LITERAL, NOT_LITERAL, CATEGORY)
|
|
sre_parse.py(146): REPEATCODES = (MIN_REPEAT, MAX_REPEAT)
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(148): if op is BRANCH:
|
|
sre_parse.py(157): elif op is CALL:
|
|
sre_parse.py(161): elif op is SUBPATTERN:
|
|
sre_parse.py(165): elif op in REPEATCODES:
|
|
sre_parse.py(169): elif op in UNITCODES:
|
|
sre_parse.py(170): lo = lo + 1
|
|
sre_parse.py(171): hi = hi + 1
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(174): self.width = min(lo, MAXREPEAT - 1), min(hi, MAXREPEAT)
|
|
sre_parse.py(175): return self.width
|
|
sre_parse.py(167): lo = lo + i * av[0]
|
|
sre_parse.py(168): hi = hi + j * av[1]
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(174): self.width = min(lo, MAXREPEAT - 1), min(hi, MAXREPEAT)
|
|
sre_parse.py(175): return self.width
|
|
sre_parse.py(163): lo = lo + i
|
|
sre_parse.py(164): hi = hi + j
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(174): self.width = min(lo, MAXREPEAT - 1), min(hi, MAXREPEAT)
|
|
sre_parse.py(175): return self.width
|
|
sre_parse.py(167): lo = lo + i * av[0]
|
|
sre_parse.py(168): hi = hi + j * av[1]
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(174): self.width = min(lo, MAXREPEAT - 1), min(hi, MAXREPEAT)
|
|
sre_parse.py(175): return self.width
|
|
sre_compile.py(364): if lo == 0:
|
|
sre_compile.py(367): prefix = []
|
|
sre_compile.py(368): prefixappend = prefix.append
|
|
sre_compile.py(369): prefix_skip = 0
|
|
sre_compile.py(370): charset = [] # not used
|
|
sre_compile.py(371): charsetappend = charset.append
|
|
sre_compile.py(372): if not (flags & SRE_FLAG_IGNORECASE):
|
|
sre_compile.py(374): for op, av in pattern.data:
|
|
sre_compile.py(375): if op is LITERAL:
|
|
sre_compile.py(379): elif op is SUBPATTERN and len(av[1]) == 1:
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
sre_compile.py(386): break
|
|
sre_compile.py(388): if not prefix and pattern.data:
|
|
sre_compile.py(389): op, av = pattern.data[0]
|
|
sre_compile.py(390): if op is SUBPATTERN and av[1]:
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
sre_compile.py(391): op, av = av[1][0]
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(392): if op is LITERAL:
|
|
sre_compile.py(394): elif op is BRANCH:
|
|
sre_compile.py(427): emit = code.append
|
|
sre_compile.py(428): emit(OPCODES[INFO])
|
|
sre_compile.py(429): skip = len(code); emit(0)
|
|
sre_compile.py(431): mask = 0
|
|
sre_compile.py(432): if prefix:
|
|
sre_compile.py(436): elif charset:
|
|
sre_compile.py(438): emit(mask)
|
|
sre_compile.py(440): if lo < MAXCODE:
|
|
sre_compile.py(441): emit(lo)
|
|
sre_compile.py(445): if hi < MAXCODE:
|
|
sre_compile.py(448): emit(0)
|
|
sre_compile.py(450): if prefix:
|
|
sre_compile.py(461): elif charset:
|
|
sre_compile.py(463): code[skip] = len(code) - skip
|
|
sre_compile.py(487): _compile(code, p.data, flags)
|
|
--- modulename: sre_compile, funcname: _compile
|
|
sre_compile.py(34): emit = code.append
|
|
sre_compile.py(35): _len = len
|
|
sre_compile.py(36): LITERAL_CODES = _LITERAL_CODES
|
|
sre_compile.py(37): REPEATING_CODES = _REPEATING_CODES
|
|
sre_compile.py(38): SUCCESS_CODES = _SUCCESS_CODES
|
|
sre_compile.py(39): ASSERT_CODES = _ASSERT_CODES
|
|
sre_compile.py(40): for op, av in pattern:
|
|
sre_compile.py(41): if op in LITERAL_CODES:
|
|
sre_compile.py(48): elif op is IN:
|
|
sre_compile.py(59): elif op is ANY:
|
|
sre_compile.py(64): elif op in REPEATING_CODES:
|
|
sre_compile.py(96): elif op is SUBPATTERN:
|
|
sre_compile.py(97): if av[0]:
|
|
sre_compile.py(98): emit(OPCODES[MARK])
|
|
sre_compile.py(99): emit((av[0]-1)*2)
|
|
sre_compile.py(101): _compile(code, av[1], flags)
|
|
--- modulename: sre_compile, funcname: _compile
|
|
sre_compile.py(34): emit = code.append
|
|
sre_compile.py(35): _len = len
|
|
sre_compile.py(36): LITERAL_CODES = _LITERAL_CODES
|
|
sre_compile.py(37): REPEATING_CODES = _REPEATING_CODES
|
|
sre_compile.py(38): SUCCESS_CODES = _SUCCESS_CODES
|
|
sre_compile.py(39): ASSERT_CODES = _ASSERT_CODES
|
|
sre_compile.py(40): for op, av in pattern:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(41): if op in LITERAL_CODES:
|
|
sre_compile.py(48): elif op is IN:
|
|
sre_compile.py(59): elif op is ANY:
|
|
sre_compile.py(64): elif op in REPEATING_CODES:
|
|
sre_compile.py(65): if flags & SRE_FLAG_TEMPLATE:
|
|
sre_compile.py(74): elif _simple(av) and op is not REPEAT:
|
|
--- modulename: sre_compile, funcname: _simple
|
|
sre_compile.py(356): lo, hi = av[2].getwidth()
|
|
--- modulename: sre_parse, funcname: getwidth
|
|
sre_parse.py(142): if self.width:
|
|
sre_parse.py(143): return self.width
|
|
sre_compile.py(357): return lo == hi == 1 and av[2][0][0] != SUBPATTERN
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(75): if op is MAX_REPEAT:
|
|
sre_compile.py(76): emit(OPCODES[REPEAT_ONE])
|
|
sre_compile.py(79): skip = _len(code); emit(0)
|
|
sre_compile.py(80): emit(av[0])
|
|
sre_compile.py(81): emit(av[1])
|
|
sre_compile.py(82): _compile(code, av[2], flags)
|
|
--- modulename: sre_compile, funcname: _compile
|
|
sre_compile.py(34): emit = code.append
|
|
sre_compile.py(35): _len = len
|
|
sre_compile.py(36): LITERAL_CODES = _LITERAL_CODES
|
|
sre_compile.py(37): REPEATING_CODES = _REPEATING_CODES
|
|
sre_compile.py(38): SUCCESS_CODES = _SUCCESS_CODES
|
|
sre_compile.py(39): ASSERT_CODES = _ASSERT_CODES
|
|
sre_compile.py(40): for op, av in pattern:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(41): if op in LITERAL_CODES:
|
|
sre_compile.py(42): if flags & SRE_FLAG_IGNORECASE:
|
|
sre_compile.py(46): emit(OPCODES[op])
|
|
sre_compile.py(47): emit(av)
|
|
sre_compile.py(40): for op, av in pattern:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(83): emit(OPCODES[SUCCESS])
|
|
sre_compile.py(84): code[skip] = _len(code) - skip
|
|
sre_compile.py(40): for op, av in pattern:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(41): if op in LITERAL_CODES:
|
|
sre_compile.py(48): elif op is IN:
|
|
sre_compile.py(59): elif op is ANY:
|
|
sre_compile.py(64): elif op in REPEATING_CODES:
|
|
sre_compile.py(96): elif op is SUBPATTERN:
|
|
sre_compile.py(97): if av[0]:
|
|
sre_compile.py(101): _compile(code, av[1], flags)
|
|
--- modulename: sre_compile, funcname: _compile
|
|
sre_compile.py(34): emit = code.append
|
|
sre_compile.py(35): _len = len
|
|
sre_compile.py(36): LITERAL_CODES = _LITERAL_CODES
|
|
sre_compile.py(37): REPEATING_CODES = _REPEATING_CODES
|
|
sre_compile.py(38): SUCCESS_CODES = _SUCCESS_CODES
|
|
sre_compile.py(39): ASSERT_CODES = _ASSERT_CODES
|
|
sre_compile.py(40): for op, av in pattern:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(41): if op in LITERAL_CODES:
|
|
sre_compile.py(48): elif op is IN:
|
|
sre_compile.py(59): elif op is ANY:
|
|
sre_compile.py(64): elif op in REPEATING_CODES:
|
|
sre_compile.py(96): elif op is SUBPATTERN:
|
|
sre_compile.py(105): elif op in SUCCESS_CODES:
|
|
sre_compile.py(107): elif op in ASSERT_CODES:
|
|
sre_compile.py(120): elif op is CALL:
|
|
sre_compile.py(126): elif op is AT:
|
|
sre_compile.py(135): elif op is BRANCH:
|
|
sre_compile.py(136): emit(OPCODES[op])
|
|
sre_compile.py(137): tail = []
|
|
sre_compile.py(138): tailappend = tail.append
|
|
sre_compile.py(139): for av in av[1]:
|
|
sre_compile.py(140): skip = _len(code); emit(0)
|
|
sre_compile.py(142): _compile(code, av, flags)
|
|
--- modulename: sre_compile, funcname: _compile
|
|
sre_compile.py(34): emit = code.append
|
|
sre_compile.py(35): _len = len
|
|
sre_compile.py(36): LITERAL_CODES = _LITERAL_CODES
|
|
sre_compile.py(37): REPEATING_CODES = _REPEATING_CODES
|
|
sre_compile.py(38): SUCCESS_CODES = _SUCCESS_CODES
|
|
sre_compile.py(39): ASSERT_CODES = _ASSERT_CODES
|
|
sre_compile.py(40): for op, av in pattern:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(41): if op in LITERAL_CODES:
|
|
sre_compile.py(42): if flags & SRE_FLAG_IGNORECASE:
|
|
sre_compile.py(46): emit(OPCODES[op])
|
|
sre_compile.py(47): emit(av)
|
|
sre_compile.py(40): for op, av in pattern:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(143): emit(OPCODES[JUMP])
|
|
sre_compile.py(144): tailappend(_len(code)); emit(0)
|
|
sre_compile.py(145): code[skip] = _len(code) - skip
|
|
sre_compile.py(139): for av in av[1]:
|
|
sre_compile.py(140): skip = _len(code); emit(0)
|
|
sre_compile.py(142): _compile(code, av, flags)
|
|
--- modulename: sre_compile, funcname: _compile
|
|
sre_compile.py(34): emit = code.append
|
|
sre_compile.py(35): _len = len
|
|
sre_compile.py(36): LITERAL_CODES = _LITERAL_CODES
|
|
sre_compile.py(37): REPEATING_CODES = _REPEATING_CODES
|
|
sre_compile.py(38): SUCCESS_CODES = _SUCCESS_CODES
|
|
sre_compile.py(39): ASSERT_CODES = _ASSERT_CODES
|
|
sre_compile.py(40): for op, av in pattern:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(41): if op in LITERAL_CODES:
|
|
sre_compile.py(48): elif op is IN:
|
|
sre_compile.py(49): if flags & SRE_FLAG_IGNORECASE:
|
|
sre_compile.py(54): emit(OPCODES[op])
|
|
sre_compile.py(55): fixup = _identityfunction
|
|
sre_compile.py(56): skip = _len(code); emit(0)
|
|
sre_compile.py(57): _compile_charset(av, flags, code, fixup)
|
|
--- modulename: sre_compile, funcname: _compile_charset
|
|
sre_compile.py(180): emit = code.append
|
|
sre_compile.py(181): if fixup is None:
|
|
sre_compile.py(183): for op, av in _optimize_charset(charset, fixup):
|
|
--- modulename: sre_compile, funcname: _optimize_charset
|
|
sre_compile.py(209): out = []
|
|
sre_compile.py(210): outappend = out.append
|
|
sre_compile.py(211): charmap = [0]*256
|
|
sre_compile.py(212): try:
|
|
sre_compile.py(213): for op, av in charset:
|
|
sre_compile.py(214): if op is NEGATE:
|
|
sre_compile.py(216): elif op is LITERAL:
|
|
sre_compile.py(218): elif op is RANGE:
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
--- modulename: sre_compile, funcname: _identityfunction
|
|
sre_compile.py(25): return x
|
|
--- modulename: sre_compile, funcname: _identityfunction
|
|
sre_compile.py(25): return x
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(213): for op, av in charset:
|
|
sre_compile.py(228): i = p = n = 0
|
|
sre_compile.py(229): runs = []
|
|
sre_compile.py(230): runsappend = runs.append
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(234): p = i
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(237): runsappend((p, n))
|
|
sre_compile.py(238): n = 0
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(240): if n:
|
|
sre_compile.py(242): if len(runs) <= 2:
|
|
sre_compile.py(244): for p, n in runs:
|
|
sre_compile.py(245): if n == 1:
|
|
sre_compile.py(248): outappend((RANGE, (p, p+n-1)))
|
|
sre_compile.py(244): for p, n in runs:
|
|
sre_compile.py(249): if len(out) < len(charset):
|
|
sre_compile.py(256): return charset
|
|
sre_compile.py(184): emit(OPCODES[op])
|
|
sre_compile.py(185): if op is NEGATE:
|
|
sre_compile.py(187): elif op is LITERAL:
|
|
sre_compile.py(189): elif op is RANGE:
|
|
sre_compile.py(190): emit(fixup(av[0]))
|
|
--- modulename: sre_compile, funcname: _identityfunction
|
|
sre_compile.py(25): return x
|
|
sre_compile.py(191): emit(fixup(av[1]))
|
|
--- modulename: sre_compile, funcname: _identityfunction
|
|
sre_compile.py(25): return x
|
|
sre_compile.py(183): for op, av in _optimize_charset(charset, fixup):
|
|
sre_compile.py(205): emit(OPCODES[FAILURE])
|
|
sre_compile.py(58): code[skip] = _len(code) - skip
|
|
sre_compile.py(40): for op, av in pattern:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(41): if op in LITERAL_CODES:
|
|
sre_compile.py(48): elif op is IN:
|
|
sre_compile.py(59): elif op is ANY:
|
|
sre_compile.py(64): elif op in REPEATING_CODES:
|
|
sre_compile.py(65): if flags & SRE_FLAG_TEMPLATE:
|
|
sre_compile.py(74): elif _simple(av) and op is not REPEAT:
|
|
--- modulename: sre_compile, funcname: _simple
|
|
sre_compile.py(356): lo, hi = av[2].getwidth()
|
|
--- modulename: sre_parse, funcname: getwidth
|
|
sre_parse.py(142): if self.width:
|
|
sre_parse.py(143): return self.width
|
|
sre_compile.py(357): return lo == hi == 1 and av[2][0][0] != SUBPATTERN
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(75): if op is MAX_REPEAT:
|
|
sre_compile.py(76): emit(OPCODES[REPEAT_ONE])
|
|
sre_compile.py(79): skip = _len(code); emit(0)
|
|
sre_compile.py(80): emit(av[0])
|
|
sre_compile.py(81): emit(av[1])
|
|
sre_compile.py(82): _compile(code, av[2], flags)
|
|
--- modulename: sre_compile, funcname: _compile
|
|
sre_compile.py(34): emit = code.append
|
|
sre_compile.py(35): _len = len
|
|
sre_compile.py(36): LITERAL_CODES = _LITERAL_CODES
|
|
sre_compile.py(37): REPEATING_CODES = _REPEATING_CODES
|
|
sre_compile.py(38): SUCCESS_CODES = _SUCCESS_CODES
|
|
sre_compile.py(39): ASSERT_CODES = _ASSERT_CODES
|
|
sre_compile.py(40): for op, av in pattern:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(41): if op in LITERAL_CODES:
|
|
sre_compile.py(48): elif op is IN:
|
|
sre_compile.py(49): if flags & SRE_FLAG_IGNORECASE:
|
|
sre_compile.py(54): emit(OPCODES[op])
|
|
sre_compile.py(55): fixup = _identityfunction
|
|
sre_compile.py(56): skip = _len(code); emit(0)
|
|
sre_compile.py(57): _compile_charset(av, flags, code, fixup)
|
|
--- modulename: sre_compile, funcname: _compile_charset
|
|
sre_compile.py(180): emit = code.append
|
|
sre_compile.py(181): if fixup is None:
|
|
sre_compile.py(183): for op, av in _optimize_charset(charset, fixup):
|
|
--- modulename: sre_compile, funcname: _optimize_charset
|
|
sre_compile.py(209): out = []
|
|
sre_compile.py(210): outappend = out.append
|
|
sre_compile.py(211): charmap = [0]*256
|
|
sre_compile.py(212): try:
|
|
sre_compile.py(213): for op, av in charset:
|
|
sre_compile.py(214): if op is NEGATE:
|
|
sre_compile.py(216): elif op is LITERAL:
|
|
sre_compile.py(218): elif op is RANGE:
|
|
sre_compile.py(221): elif op is CATEGORY:
|
|
sre_compile.py(223): return charset # cannot compress
|
|
sre_compile.py(184): emit(OPCODES[op])
|
|
sre_compile.py(185): if op is NEGATE:
|
|
sre_compile.py(187): elif op is LITERAL:
|
|
sre_compile.py(189): elif op is RANGE:
|
|
sre_compile.py(192): elif op is CHARSET:
|
|
sre_compile.py(194): elif op is BIGCHARSET:
|
|
sre_compile.py(196): elif op is CATEGORY:
|
|
sre_compile.py(197): if flags & SRE_FLAG_LOCALE:
|
|
sre_compile.py(199): elif flags & SRE_FLAG_UNICODE:
|
|
sre_compile.py(202): emit(CHCODES[av])
|
|
sre_compile.py(183): for op, av in _optimize_charset(charset, fixup):
|
|
sre_compile.py(205): emit(OPCODES[FAILURE])
|
|
sre_compile.py(58): code[skip] = _len(code) - skip
|
|
sre_compile.py(40): for op, av in pattern:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(83): emit(OPCODES[SUCCESS])
|
|
sre_compile.py(84): code[skip] = _len(code) - skip
|
|
sre_compile.py(40): for op, av in pattern:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(143): emit(OPCODES[JUMP])
|
|
sre_compile.py(144): tailappend(_len(code)); emit(0)
|
|
sre_compile.py(145): code[skip] = _len(code) - skip
|
|
sre_compile.py(139): for av in av[1]:
|
|
sre_compile.py(146): emit(0) # end of branch
|
|
sre_compile.py(147): for tail in tail:
|
|
sre_compile.py(148): code[tail] = _len(code) - tail
|
|
sre_compile.py(147): for tail in tail:
|
|
sre_compile.py(148): code[tail] = _len(code) - tail
|
|
sre_compile.py(147): for tail in tail:
|
|
sre_compile.py(40): for op, av in pattern:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(102): if av[0]:
|
|
sre_compile.py(40): for op, av in pattern:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(102): if av[0]:
|
|
sre_compile.py(103): emit(OPCODES[MARK])
|
|
sre_compile.py(104): emit((av[0]-1)*2+1)
|
|
sre_compile.py(40): for op, av in pattern:
|
|
sre_compile.py(41): if op in LITERAL_CODES:
|
|
sre_compile.py(48): elif op is IN:
|
|
sre_compile.py(59): elif op is ANY:
|
|
sre_compile.py(64): elif op in REPEATING_CODES:
|
|
sre_compile.py(65): if flags & SRE_FLAG_TEMPLATE:
|
|
sre_compile.py(74): elif _simple(av) and op is not REPEAT:
|
|
--- modulename: sre_compile, funcname: _simple
|
|
sre_compile.py(356): lo, hi = av[2].getwidth()
|
|
--- modulename: sre_parse, funcname: getwidth
|
|
sre_parse.py(142): if self.width:
|
|
sre_parse.py(143): return self.width
|
|
sre_compile.py(357): return lo == hi == 1 and av[2][0][0] != SUBPATTERN
|
|
sre_compile.py(86): emit(OPCODES[REPEAT])
|
|
sre_compile.py(87): skip = _len(code); emit(0)
|
|
sre_compile.py(88): emit(av[0])
|
|
sre_compile.py(89): emit(av[1])
|
|
sre_compile.py(90): _compile(code, av[2], flags)
|
|
--- modulename: sre_compile, funcname: _compile
|
|
sre_compile.py(34): emit = code.append
|
|
sre_compile.py(35): _len = len
|
|
sre_compile.py(36): LITERAL_CODES = _LITERAL_CODES
|
|
sre_compile.py(37): REPEATING_CODES = _REPEATING_CODES
|
|
sre_compile.py(38): SUCCESS_CODES = _SUCCESS_CODES
|
|
sre_compile.py(39): ASSERT_CODES = _ASSERT_CODES
|
|
sre_compile.py(40): for op, av in pattern:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(41): if op in LITERAL_CODES:
|
|
sre_compile.py(48): elif op is IN:
|
|
sre_compile.py(59): elif op is ANY:
|
|
sre_compile.py(64): elif op in REPEATING_CODES:
|
|
sre_compile.py(96): elif op is SUBPATTERN:
|
|
sre_compile.py(97): if av[0]:
|
|
sre_compile.py(98): emit(OPCODES[MARK])
|
|
sre_compile.py(99): emit((av[0]-1)*2)
|
|
sre_compile.py(101): _compile(code, av[1], flags)
|
|
--- modulename: sre_compile, funcname: _compile
|
|
sre_compile.py(34): emit = code.append
|
|
sre_compile.py(35): _len = len
|
|
sre_compile.py(36): LITERAL_CODES = _LITERAL_CODES
|
|
sre_compile.py(37): REPEATING_CODES = _REPEATING_CODES
|
|
sre_compile.py(38): SUCCESS_CODES = _SUCCESS_CODES
|
|
sre_compile.py(39): ASSERT_CODES = _ASSERT_CODES
|
|
sre_compile.py(40): for op, av in pattern:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(41): if op in LITERAL_CODES:
|
|
sre_compile.py(42): if flags & SRE_FLAG_IGNORECASE:
|
|
sre_compile.py(46): emit(OPCODES[op])
|
|
sre_compile.py(47): emit(av)
|
|
sre_compile.py(40): for op, av in pattern:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(41): if op in LITERAL_CODES:
|
|
sre_compile.py(48): elif op is IN:
|
|
sre_compile.py(59): elif op is ANY:
|
|
sre_compile.py(64): elif op in REPEATING_CODES:
|
|
sre_compile.py(65): if flags & SRE_FLAG_TEMPLATE:
|
|
sre_compile.py(74): elif _simple(av) and op is not REPEAT:
|
|
--- modulename: sre_compile, funcname: _simple
|
|
sre_compile.py(356): lo, hi = av[2].getwidth()
|
|
--- modulename: sre_parse, funcname: getwidth
|
|
sre_parse.py(142): if self.width:
|
|
sre_parse.py(143): return self.width
|
|
sre_compile.py(357): return lo == hi == 1 and av[2][0][0] != SUBPATTERN
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(75): if op is MAX_REPEAT:
|
|
sre_compile.py(76): emit(OPCODES[REPEAT_ONE])
|
|
sre_compile.py(79): skip = _len(code); emit(0)
|
|
sre_compile.py(80): emit(av[0])
|
|
sre_compile.py(81): emit(av[1])
|
|
sre_compile.py(82): _compile(code, av[2], flags)
|
|
--- modulename: sre_compile, funcname: _compile
|
|
sre_compile.py(34): emit = code.append
|
|
sre_compile.py(35): _len = len
|
|
sre_compile.py(36): LITERAL_CODES = _LITERAL_CODES
|
|
sre_compile.py(37): REPEATING_CODES = _REPEATING_CODES
|
|
sre_compile.py(38): SUCCESS_CODES = _SUCCESS_CODES
|
|
sre_compile.py(39): ASSERT_CODES = _ASSERT_CODES
|
|
sre_compile.py(40): for op, av in pattern:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(41): if op in LITERAL_CODES:
|
|
sre_compile.py(48): elif op is IN:
|
|
sre_compile.py(49): if flags & SRE_FLAG_IGNORECASE:
|
|
sre_compile.py(54): emit(OPCODES[op])
|
|
sre_compile.py(55): fixup = _identityfunction
|
|
sre_compile.py(56): skip = _len(code); emit(0)
|
|
sre_compile.py(57): _compile_charset(av, flags, code, fixup)
|
|
--- modulename: sre_compile, funcname: _compile_charset
|
|
sre_compile.py(180): emit = code.append
|
|
sre_compile.py(181): if fixup is None:
|
|
sre_compile.py(183): for op, av in _optimize_charset(charset, fixup):
|
|
--- modulename: sre_compile, funcname: _optimize_charset
|
|
sre_compile.py(209): out = []
|
|
sre_compile.py(210): outappend = out.append
|
|
sre_compile.py(211): charmap = [0]*256
|
|
sre_compile.py(212): try:
|
|
sre_compile.py(213): for op, av in charset:
|
|
sre_compile.py(214): if op is NEGATE:
|
|
sre_compile.py(216): elif op is LITERAL:
|
|
sre_compile.py(218): elif op is RANGE:
|
|
sre_compile.py(221): elif op is CATEGORY:
|
|
sre_compile.py(223): return charset # cannot compress
|
|
sre_compile.py(184): emit(OPCODES[op])
|
|
sre_compile.py(185): if op is NEGATE:
|
|
sre_compile.py(187): elif op is LITERAL:
|
|
sre_compile.py(189): elif op is RANGE:
|
|
sre_compile.py(192): elif op is CHARSET:
|
|
sre_compile.py(194): elif op is BIGCHARSET:
|
|
sre_compile.py(196): elif op is CATEGORY:
|
|
sre_compile.py(197): if flags & SRE_FLAG_LOCALE:
|
|
sre_compile.py(199): elif flags & SRE_FLAG_UNICODE:
|
|
sre_compile.py(202): emit(CHCODES[av])
|
|
sre_compile.py(183): for op, av in _optimize_charset(charset, fixup):
|
|
sre_compile.py(205): emit(OPCODES[FAILURE])
|
|
sre_compile.py(58): code[skip] = _len(code) - skip
|
|
sre_compile.py(40): for op, av in pattern:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(83): emit(OPCODES[SUCCESS])
|
|
sre_compile.py(84): code[skip] = _len(code) - skip
|
|
sre_compile.py(40): for op, av in pattern:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(102): if av[0]:
|
|
sre_compile.py(103): emit(OPCODES[MARK])
|
|
sre_compile.py(104): emit((av[0]-1)*2+1)
|
|
sre_compile.py(40): for op, av in pattern:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(91): code[skip] = _len(code) - skip
|
|
sre_compile.py(92): if op is MAX_REPEAT:
|
|
sre_compile.py(93): emit(OPCODES[MAX_UNTIL])
|
|
sre_compile.py(40): for op, av in pattern:
|
|
sre_compile.py(41): if op in LITERAL_CODES:
|
|
sre_compile.py(48): elif op is IN:
|
|
sre_compile.py(59): elif op is ANY:
|
|
sre_compile.py(64): elif op in REPEATING_CODES:
|
|
sre_compile.py(65): if flags & SRE_FLAG_TEMPLATE:
|
|
sre_compile.py(74): elif _simple(av) and op is not REPEAT:
|
|
--- modulename: sre_compile, funcname: _simple
|
|
sre_compile.py(356): lo, hi = av[2].getwidth()
|
|
--- modulename: sre_parse, funcname: getwidth
|
|
sre_parse.py(142): if self.width:
|
|
sre_parse.py(143): return self.width
|
|
sre_compile.py(357): return lo == hi == 1 and av[2][0][0] != SUBPATTERN
|
|
sre_compile.py(86): emit(OPCODES[REPEAT])
|
|
sre_compile.py(87): skip = _len(code); emit(0)
|
|
sre_compile.py(88): emit(av[0])
|
|
sre_compile.py(89): emit(av[1])
|
|
sre_compile.py(90): _compile(code, av[2], flags)
|
|
--- modulename: sre_compile, funcname: _compile
|
|
sre_compile.py(34): emit = code.append
|
|
sre_compile.py(35): _len = len
|
|
sre_compile.py(36): LITERAL_CODES = _LITERAL_CODES
|
|
sre_compile.py(37): REPEATING_CODES = _REPEATING_CODES
|
|
sre_compile.py(38): SUCCESS_CODES = _SUCCESS_CODES
|
|
sre_compile.py(39): ASSERT_CODES = _ASSERT_CODES
|
|
sre_compile.py(40): for op, av in pattern:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(41): if op in LITERAL_CODES:
|
|
sre_compile.py(48): elif op is IN:
|
|
sre_compile.py(59): elif op is ANY:
|
|
sre_compile.py(64): elif op in REPEATING_CODES:
|
|
sre_compile.py(96): elif op is SUBPATTERN:
|
|
sre_compile.py(97): if av[0]:
|
|
sre_compile.py(98): emit(OPCODES[MARK])
|
|
sre_compile.py(99): emit((av[0]-1)*2)
|
|
sre_compile.py(101): _compile(code, av[1], flags)
|
|
--- modulename: sre_compile, funcname: _compile
|
|
sre_compile.py(34): emit = code.append
|
|
sre_compile.py(35): _len = len
|
|
sre_compile.py(36): LITERAL_CODES = _LITERAL_CODES
|
|
sre_compile.py(37): REPEATING_CODES = _REPEATING_CODES
|
|
sre_compile.py(38): SUCCESS_CODES = _SUCCESS_CODES
|
|
sre_compile.py(39): ASSERT_CODES = _ASSERT_CODES
|
|
sre_compile.py(40): for op, av in pattern:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(41): if op in LITERAL_CODES:
|
|
sre_compile.py(48): elif op is IN:
|
|
sre_compile.py(49): if flags & SRE_FLAG_IGNORECASE:
|
|
sre_compile.py(54): emit(OPCODES[op])
|
|
sre_compile.py(55): fixup = _identityfunction
|
|
sre_compile.py(56): skip = _len(code); emit(0)
|
|
sre_compile.py(57): _compile_charset(av, flags, code, fixup)
|
|
--- modulename: sre_compile, funcname: _compile_charset
|
|
sre_compile.py(180): emit = code.append
|
|
sre_compile.py(181): if fixup is None:
|
|
sre_compile.py(183): for op, av in _optimize_charset(charset, fixup):
|
|
--- modulename: sre_compile, funcname: _optimize_charset
|
|
sre_compile.py(209): out = []
|
|
sre_compile.py(210): outappend = out.append
|
|
sre_compile.py(211): charmap = [0]*256
|
|
sre_compile.py(212): try:
|
|
sre_compile.py(213): for op, av in charset:
|
|
sre_compile.py(214): if op is NEGATE:
|
|
sre_compile.py(216): elif op is LITERAL:
|
|
sre_compile.py(217): charmap[fixup(av)] = 1
|
|
--- modulename: sre_compile, funcname: _identityfunction
|
|
sre_compile.py(25): return x
|
|
sre_compile.py(213): for op, av in charset:
|
|
sre_compile.py(214): if op is NEGATE:
|
|
sre_compile.py(216): elif op is LITERAL:
|
|
sre_compile.py(217): charmap[fixup(av)] = 1
|
|
--- modulename: sre_compile, funcname: _identityfunction
|
|
sre_compile.py(25): return x
|
|
sre_compile.py(213): for op, av in charset:
|
|
sre_compile.py(228): i = p = n = 0
|
|
sre_compile.py(229): runs = []
|
|
sre_compile.py(230): runsappend = runs.append
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(234): p = i
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(237): runsappend((p, n))
|
|
sre_compile.py(238): n = 0
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(234): p = i
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(237): runsappend((p, n))
|
|
sre_compile.py(238): n = 0
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(240): if n:
|
|
sre_compile.py(242): if len(runs) <= 2:
|
|
sre_compile.py(244): for p, n in runs:
|
|
sre_compile.py(245): if n == 1:
|
|
sre_compile.py(246): outappend((LITERAL, p))
|
|
sre_compile.py(244): for p, n in runs:
|
|
sre_compile.py(245): if n == 1:
|
|
sre_compile.py(246): outappend((LITERAL, p))
|
|
sre_compile.py(244): for p, n in runs:
|
|
sre_compile.py(249): if len(out) < len(charset):
|
|
sre_compile.py(256): return charset
|
|
sre_compile.py(184): emit(OPCODES[op])
|
|
sre_compile.py(185): if op is NEGATE:
|
|
sre_compile.py(187): elif op is LITERAL:
|
|
sre_compile.py(188): emit(fixup(av))
|
|
--- modulename: sre_compile, funcname: _identityfunction
|
|
sre_compile.py(25): return x
|
|
sre_compile.py(183): for op, av in _optimize_charset(charset, fixup):
|
|
sre_compile.py(184): emit(OPCODES[op])
|
|
sre_compile.py(185): if op is NEGATE:
|
|
sre_compile.py(187): elif op is LITERAL:
|
|
sre_compile.py(188): emit(fixup(av))
|
|
--- modulename: sre_compile, funcname: _identityfunction
|
|
sre_compile.py(25): return x
|
|
sre_compile.py(183): for op, av in _optimize_charset(charset, fixup):
|
|
sre_compile.py(205): emit(OPCODES[FAILURE])
|
|
sre_compile.py(58): code[skip] = _len(code) - skip
|
|
sre_compile.py(40): for op, av in pattern:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(41): if op in LITERAL_CODES:
|
|
sre_compile.py(48): elif op is IN:
|
|
sre_compile.py(59): elif op is ANY:
|
|
sre_compile.py(64): elif op in REPEATING_CODES:
|
|
sre_compile.py(65): if flags & SRE_FLAG_TEMPLATE:
|
|
sre_compile.py(74): elif _simple(av) and op is not REPEAT:
|
|
--- modulename: sre_compile, funcname: _simple
|
|
sre_compile.py(356): lo, hi = av[2].getwidth()
|
|
--- modulename: sre_parse, funcname: getwidth
|
|
sre_parse.py(142): if self.width:
|
|
sre_parse.py(143): return self.width
|
|
sre_compile.py(357): return lo == hi == 1 and av[2][0][0] != SUBPATTERN
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(75): if op is MAX_REPEAT:
|
|
sre_compile.py(76): emit(OPCODES[REPEAT_ONE])
|
|
sre_compile.py(79): skip = _len(code); emit(0)
|
|
sre_compile.py(80): emit(av[0])
|
|
sre_compile.py(81): emit(av[1])
|
|
sre_compile.py(82): _compile(code, av[2], flags)
|
|
--- modulename: sre_compile, funcname: _compile
|
|
sre_compile.py(34): emit = code.append
|
|
sre_compile.py(35): _len = len
|
|
sre_compile.py(36): LITERAL_CODES = _LITERAL_CODES
|
|
sre_compile.py(37): REPEATING_CODES = _REPEATING_CODES
|
|
sre_compile.py(38): SUCCESS_CODES = _SUCCESS_CODES
|
|
sre_compile.py(39): ASSERT_CODES = _ASSERT_CODES
|
|
sre_compile.py(40): for op, av in pattern:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(41): if op in LITERAL_CODES:
|
|
sre_compile.py(48): elif op is IN:
|
|
sre_compile.py(49): if flags & SRE_FLAG_IGNORECASE:
|
|
sre_compile.py(54): emit(OPCODES[op])
|
|
sre_compile.py(55): fixup = _identityfunction
|
|
sre_compile.py(56): skip = _len(code); emit(0)
|
|
sre_compile.py(57): _compile_charset(av, flags, code, fixup)
|
|
--- modulename: sre_compile, funcname: _compile_charset
|
|
sre_compile.py(180): emit = code.append
|
|
sre_compile.py(181): if fixup is None:
|
|
sre_compile.py(183): for op, av in _optimize_charset(charset, fixup):
|
|
--- modulename: sre_compile, funcname: _optimize_charset
|
|
sre_compile.py(209): out = []
|
|
sre_compile.py(210): outappend = out.append
|
|
sre_compile.py(211): charmap = [0]*256
|
|
sre_compile.py(212): try:
|
|
sre_compile.py(213): for op, av in charset:
|
|
sre_compile.py(214): if op is NEGATE:
|
|
sre_compile.py(216): elif op is LITERAL:
|
|
sre_compile.py(217): charmap[fixup(av)] = 1
|
|
--- modulename: sre_compile, funcname: _identityfunction
|
|
sre_compile.py(25): return x
|
|
sre_compile.py(213): for op, av in charset:
|
|
sre_compile.py(214): if op is NEGATE:
|
|
sre_compile.py(216): elif op is LITERAL:
|
|
sre_compile.py(217): charmap[fixup(av)] = 1
|
|
--- modulename: sre_compile, funcname: _identityfunction
|
|
sre_compile.py(25): return x
|
|
sre_compile.py(213): for op, av in charset:
|
|
sre_compile.py(228): i = p = n = 0
|
|
sre_compile.py(229): runs = []
|
|
sre_compile.py(230): runsappend = runs.append
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(234): p = i
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(237): runsappend((p, n))
|
|
sre_compile.py(238): n = 0
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(234): p = i
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(237): runsappend((p, n))
|
|
sre_compile.py(238): n = 0
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(240): if n:
|
|
sre_compile.py(242): if len(runs) <= 2:
|
|
sre_compile.py(244): for p, n in runs:
|
|
sre_compile.py(245): if n == 1:
|
|
sre_compile.py(246): outappend((LITERAL, p))
|
|
sre_compile.py(244): for p, n in runs:
|
|
sre_compile.py(245): if n == 1:
|
|
sre_compile.py(246): outappend((LITERAL, p))
|
|
sre_compile.py(244): for p, n in runs:
|
|
sre_compile.py(249): if len(out) < len(charset):
|
|
sre_compile.py(256): return charset
|
|
sre_compile.py(184): emit(OPCODES[op])
|
|
sre_compile.py(185): if op is NEGATE:
|
|
sre_compile.py(187): elif op is LITERAL:
|
|
sre_compile.py(188): emit(fixup(av))
|
|
--- modulename: sre_compile, funcname: _identityfunction
|
|
sre_compile.py(25): return x
|
|
sre_compile.py(183): for op, av in _optimize_charset(charset, fixup):
|
|
sre_compile.py(184): emit(OPCODES[op])
|
|
sre_compile.py(185): if op is NEGATE:
|
|
sre_compile.py(187): elif op is LITERAL:
|
|
sre_compile.py(188): emit(fixup(av))
|
|
--- modulename: sre_compile, funcname: _identityfunction
|
|
sre_compile.py(25): return x
|
|
sre_compile.py(183): for op, av in _optimize_charset(charset, fixup):
|
|
sre_compile.py(205): emit(OPCODES[FAILURE])
|
|
sre_compile.py(58): code[skip] = _len(code) - skip
|
|
sre_compile.py(40): for op, av in pattern:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(83): emit(OPCODES[SUCCESS])
|
|
sre_compile.py(84): code[skip] = _len(code) - skip
|
|
sre_compile.py(40): for op, av in pattern:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(41): if op in LITERAL_CODES:
|
|
sre_compile.py(48): elif op is IN:
|
|
sre_compile.py(59): elif op is ANY:
|
|
sre_compile.py(64): elif op in REPEATING_CODES:
|
|
sre_compile.py(65): if flags & SRE_FLAG_TEMPLATE:
|
|
sre_compile.py(74): elif _simple(av) and op is not REPEAT:
|
|
--- modulename: sre_compile, funcname: _simple
|
|
sre_compile.py(356): lo, hi = av[2].getwidth()
|
|
--- modulename: sre_parse, funcname: getwidth
|
|
sre_parse.py(142): if self.width:
|
|
sre_parse.py(143): return self.width
|
|
sre_compile.py(357): return lo == hi == 1 and av[2][0][0] != SUBPATTERN
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(75): if op is MAX_REPEAT:
|
|
sre_compile.py(76): emit(OPCODES[REPEAT_ONE])
|
|
sre_compile.py(79): skip = _len(code); emit(0)
|
|
sre_compile.py(80): emit(av[0])
|
|
sre_compile.py(81): emit(av[1])
|
|
sre_compile.py(82): _compile(code, av[2], flags)
|
|
--- modulename: sre_compile, funcname: _compile
|
|
sre_compile.py(34): emit = code.append
|
|
sre_compile.py(35): _len = len
|
|
sre_compile.py(36): LITERAL_CODES = _LITERAL_CODES
|
|
sre_compile.py(37): REPEATING_CODES = _REPEATING_CODES
|
|
sre_compile.py(38): SUCCESS_CODES = _SUCCESS_CODES
|
|
sre_compile.py(39): ASSERT_CODES = _ASSERT_CODES
|
|
sre_compile.py(40): for op, av in pattern:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(41): if op in LITERAL_CODES:
|
|
sre_compile.py(48): elif op is IN:
|
|
sre_compile.py(49): if flags & SRE_FLAG_IGNORECASE:
|
|
sre_compile.py(54): emit(OPCODES[op])
|
|
sre_compile.py(55): fixup = _identityfunction
|
|
sre_compile.py(56): skip = _len(code); emit(0)
|
|
sre_compile.py(57): _compile_charset(av, flags, code, fixup)
|
|
--- modulename: sre_compile, funcname: _compile_charset
|
|
sre_compile.py(180): emit = code.append
|
|
sre_compile.py(181): if fixup is None:
|
|
sre_compile.py(183): for op, av in _optimize_charset(charset, fixup):
|
|
--- modulename: sre_compile, funcname: _optimize_charset
|
|
sre_compile.py(209): out = []
|
|
sre_compile.py(210): outappend = out.append
|
|
sre_compile.py(211): charmap = [0]*256
|
|
sre_compile.py(212): try:
|
|
sre_compile.py(213): for op, av in charset:
|
|
sre_compile.py(214): if op is NEGATE:
|
|
sre_compile.py(216): elif op is LITERAL:
|
|
sre_compile.py(218): elif op is RANGE:
|
|
sre_compile.py(221): elif op is CATEGORY:
|
|
sre_compile.py(223): return charset # cannot compress
|
|
sre_compile.py(184): emit(OPCODES[op])
|
|
sre_compile.py(185): if op is NEGATE:
|
|
sre_compile.py(187): elif op is LITERAL:
|
|
sre_compile.py(189): elif op is RANGE:
|
|
sre_compile.py(192): elif op is CHARSET:
|
|
sre_compile.py(194): elif op is BIGCHARSET:
|
|
sre_compile.py(196): elif op is CATEGORY:
|
|
sre_compile.py(197): if flags & SRE_FLAG_LOCALE:
|
|
sre_compile.py(199): elif flags & SRE_FLAG_UNICODE:
|
|
sre_compile.py(202): emit(CHCODES[av])
|
|
sre_compile.py(183): for op, av in _optimize_charset(charset, fixup):
|
|
sre_compile.py(205): emit(OPCODES[FAILURE])
|
|
sre_compile.py(58): code[skip] = _len(code) - skip
|
|
sre_compile.py(40): for op, av in pattern:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(83): emit(OPCODES[SUCCESS])
|
|
sre_compile.py(84): code[skip] = _len(code) - skip
|
|
sre_compile.py(40): for op, av in pattern:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(102): if av[0]:
|
|
sre_compile.py(103): emit(OPCODES[MARK])
|
|
sre_compile.py(104): emit((av[0]-1)*2+1)
|
|
sre_compile.py(40): for op, av in pattern:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(91): code[skip] = _len(code) - skip
|
|
sre_compile.py(92): if op is MAX_REPEAT:
|
|
sre_compile.py(93): emit(OPCODES[MAX_UNTIL])
|
|
sre_compile.py(40): for op, av in pattern:
|
|
sre_compile.py(489): code.append(OPCODES[SUCCESS])
|
|
sre_compile.py(491): return code
|
|
sre_compile.py(507): if p.pattern.groups > 100:
|
|
sre_compile.py(513): groupindex = p.pattern.groupdict
|
|
sre_compile.py(514): indexgroup = [None] * p.pattern.groups
|
|
sre_compile.py(515): for k, i in groupindex.items():
|
|
sre_compile.py(518): return _sre.compile(
|
|
sre_compile.py(519): pattern, flags | p.pattern.flags, code,
|
|
sre_compile.py(520): p.pattern.groups-1,
|
|
sre_compile.py(521): groupindex, indexgroup
|
|
re.py(245): if not bypass_cache:
|
|
re.py(246): if len(_cache) >= _MAXCACHE:
|
|
re.py(248): _cache[cachekey] = p
|
|
re.py(249): return p
|
|
scanner.py(15): def py_make_scanner(context):
|
|
scanner.py(67): make_scanner = c_make_scanner or py_make_scanner
|
|
decoder.py(8): try:
|
|
decoder.py(9): from _json import scanstring as c_scanstring
|
|
decoder.py(13): __all__ = ['JSONDecoder']
|
|
decoder.py(15): FLAGS = re.VERBOSE | re.MULTILINE | re.DOTALL
|
|
decoder.py(17): def _floatconstants():
|
|
decoder.py(24): NaN, PosInf, NegInf = _floatconstants()
|
|
--- modulename: decoder, funcname: _floatconstants
|
|
decoder.py(18): _BYTES = '7FF80000000000007FF0000000000000'.decode('hex')
|
|
--- modulename: __init__, funcname: search_function
|
|
__init__.py(74): entry = _cache.get(encoding, _unknown)
|
|
__init__.py(75): if entry is not _unknown:
|
|
__init__.py(85): norm_encoding = normalize_encoding(encoding)
|
|
--- modulename: __init__, funcname: normalize_encoding
|
|
__init__.py(64): if hasattr(__builtin__, "unicode") and isinstance(encoding, unicode):
|
|
__init__.py(69): return '_'.join(encoding.translate(_norm_encoding_map).split())
|
|
__init__.py(86): aliased_encoding = _aliases.get(norm_encoding) or \
|
|
__init__.py(88): if aliased_encoding is not None:
|
|
__init__.py(89): modnames = [aliased_encoding,
|
|
__init__.py(90): norm_encoding]
|
|
__init__.py(93): for modname in modnames:
|
|
__init__.py(94): if not modname or '.' in modname:
|
|
__init__.py(96): try:
|
|
__init__.py(99): mod = __import__('encodings.' + modname, fromlist=_import_tail,
|
|
__init__.py(100): level=0)
|
|
--- modulename: hex_codec, funcname: <module>
|
|
hex_codec.py(8): """
|
|
hex_codec.py(9): import codecs, binascii
|
|
hex_codec.py(13): def hex_encode(input,errors='strict'):
|
|
hex_codec.py(27): def hex_decode(input,errors='strict'):
|
|
hex_codec.py(45): class Codec(codecs.Codec):
|
|
--- modulename: hex_codec, funcname: Codec
|
|
hex_codec.py(45): class Codec(codecs.Codec):
|
|
hex_codec.py(47): def encode(self, input,errors='strict'):
|
|
hex_codec.py(49): def decode(self, input,errors='strict'):
|
|
hex_codec.py(52): class IncrementalEncoder(codecs.IncrementalEncoder):
|
|
--- modulename: hex_codec, funcname: IncrementalEncoder
|
|
hex_codec.py(52): class IncrementalEncoder(codecs.IncrementalEncoder):
|
|
hex_codec.py(53): def encode(self, input, final=False):
|
|
hex_codec.py(57): class IncrementalDecoder(codecs.IncrementalDecoder):
|
|
--- modulename: hex_codec, funcname: IncrementalDecoder
|
|
hex_codec.py(57): class IncrementalDecoder(codecs.IncrementalDecoder):
|
|
hex_codec.py(58): def decode(self, input, final=False):
|
|
hex_codec.py(62): class StreamWriter(Codec,codecs.StreamWriter):
|
|
--- modulename: hex_codec, funcname: StreamWriter
|
|
hex_codec.py(62): class StreamWriter(Codec,codecs.StreamWriter):
|
|
hex_codec.py(63): pass
|
|
hex_codec.py(65): class StreamReader(Codec,codecs.StreamReader):
|
|
--- modulename: hex_codec, funcname: StreamReader
|
|
hex_codec.py(65): class StreamReader(Codec,codecs.StreamReader):
|
|
hex_codec.py(66): pass
|
|
hex_codec.py(70): def getregentry():
|
|
__init__.py(104): break
|
|
__init__.py(108): try:
|
|
__init__.py(109): getregentry = mod.getregentry
|
|
__init__.py(114): if mod is None:
|
|
__init__.py(120): entry = getregentry()
|
|
--- modulename: hex_codec, funcname: getregentry
|
|
hex_codec.py(71): return codecs.CodecInfo(
|
|
hex_codec.py(72): name='hex',
|
|
hex_codec.py(73): encode=hex_encode,
|
|
hex_codec.py(74): decode=hex_decode,
|
|
hex_codec.py(75): incrementalencoder=IncrementalEncoder,
|
|
hex_codec.py(76): incrementaldecoder=IncrementalDecoder,
|
|
hex_codec.py(77): streamwriter=StreamWriter,
|
|
hex_codec.py(78): streamreader=StreamReader,
|
|
--- modulename: codecs, funcname: __new__
|
|
codecs.py(79): self = tuple.__new__(cls, (encode, decode, streamreader, streamwriter))
|
|
codecs.py(80): self.name = name
|
|
codecs.py(81): self.encode = encode
|
|
codecs.py(82): self.decode = decode
|
|
codecs.py(83): self.incrementalencoder = incrementalencoder
|
|
codecs.py(84): self.incrementaldecoder = incrementaldecoder
|
|
codecs.py(85): self.streamwriter = streamwriter
|
|
codecs.py(86): self.streamreader = streamreader
|
|
codecs.py(87): return self
|
|
__init__.py(121): if not isinstance(entry, codecs.CodecInfo):
|
|
__init__.py(140): _cache[encoding] = entry
|
|
__init__.py(144): try:
|
|
__init__.py(145): codecaliases = mod.getaliases()
|
|
__init__.py(146): except AttributeError:
|
|
__init__.py(147): pass
|
|
__init__.py(154): return entry
|
|
--- modulename: hex_codec, funcname: hex_decode
|
|
hex_codec.py(41): assert errors == 'strict'
|
|
hex_codec.py(42): output = binascii.a2b_hex(input)
|
|
hex_codec.py(43): return (output, len(input))
|
|
decoder.py(19): if sys.byteorder != 'big':
|
|
decoder.py(20): _BYTES = _BYTES[:8][::-1] + _BYTES[8:][::-1]
|
|
decoder.py(21): nan, inf = struct.unpack('dd', _BYTES)
|
|
decoder.py(22): return nan, inf, -inf
|
|
decoder.py(27): def linecol(doc, pos):
|
|
decoder.py(36): def errmsg(msg, doc, pos, end=None):
|
|
decoder.py(51): _CONSTANTS = {
|
|
decoder.py(52): '-Infinity': NegInf,
|
|
decoder.py(53): 'Infinity': PosInf,
|
|
decoder.py(54): 'NaN': NaN,
|
|
decoder.py(57): STRINGCHUNK = re.compile(r'(.*?)(["\\\x00-\x1f])', FLAGS)
|
|
--- modulename: re, funcname: compile
|
|
re.py(190): return _compile(pattern, flags)
|
|
--- modulename: re, funcname: _compile
|
|
re.py(228): pattern, flags = key
|
|
re.py(229): bypass_cache = flags & DEBUG
|
|
re.py(230): if not bypass_cache:
|
|
re.py(231): cachekey = (type(key[0]),) + key
|
|
re.py(232): p = _cache.get(cachekey)
|
|
re.py(233): if p is not None:
|
|
re.py(235): if isinstance(pattern, _pattern_type):
|
|
re.py(239): if not sre_compile.isstring(pattern):
|
|
--- modulename: sre_compile, funcname: isstring
|
|
sre_compile.py(473): for tp in STRING_TYPES:
|
|
sre_compile.py(474): if isinstance(obj, tp):
|
|
sre_compile.py(475): return 1
|
|
re.py(241): try:
|
|
re.py(242): p = sre_compile.compile(pattern, flags)
|
|
--- modulename: sre_compile, funcname: compile
|
|
sre_compile.py(496): if isstring(p):
|
|
--- modulename: sre_compile, funcname: isstring
|
|
sre_compile.py(473): for tp in STRING_TYPES:
|
|
sre_compile.py(474): if isinstance(obj, tp):
|
|
sre_compile.py(475): return 1
|
|
sre_compile.py(497): pattern = p
|
|
sre_compile.py(498): p = sre_parse.parse(p, flags)
|
|
--- modulename: sre_parse, funcname: parse
|
|
sre_parse.py(678): source = Tokenizer(str)
|
|
--- modulename: sre_parse, funcname: __init__
|
|
sre_parse.py(179): self.string = string
|
|
sre_parse.py(180): self.index = 0
|
|
sre_parse.py(181): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(680): if pattern is None:
|
|
sre_parse.py(681): pattern = Pattern()
|
|
--- modulename: sre_parse, funcname: __init__
|
|
sre_parse.py(68): self.flags = 0
|
|
sre_parse.py(69): self.open = []
|
|
sre_parse.py(70): self.groups = 1
|
|
sre_parse.py(71): self.groupdict = {}
|
|
sre_parse.py(682): pattern.flags = flags
|
|
sre_parse.py(683): pattern.str = str
|
|
sre_parse.py(685): p = _parse_sub(source, pattern, 0)
|
|
--- modulename: sre_parse, funcname: _parse_sub
|
|
sre_parse.py(304): items = []
|
|
sre_parse.py(305): itemsappend = items.append
|
|
sre_parse.py(306): sourcematch = source.match
|
|
sre_parse.py(307): while 1:
|
|
sre_parse.py(308): itemsappend(_parse(source, state))
|
|
--- modulename: sre_parse, funcname: _parse
|
|
sre_parse.py(381): subpattern = SubPattern(state)
|
|
--- modulename: sre_parse, funcname: __init__
|
|
sre_parse.py(91): self.pattern = pattern
|
|
sre_parse.py(92): if data is None:
|
|
sre_parse.py(93): data = []
|
|
sre_parse.py(94): self.data = data
|
|
sre_parse.py(95): self.width = None
|
|
sre_parse.py(384): subpatternappend = subpattern.append
|
|
sre_parse.py(385): sourceget = source.get
|
|
sre_parse.py(386): sourcematch = source.match
|
|
sre_parse.py(387): _len = len
|
|
sre_parse.py(388): PATTERNENDERS = _PATTERNENDERS
|
|
sre_parse.py(389): ASSERTCHARS = _ASSERTCHARS
|
|
sre_parse.py(390): LOOKBEHINDASSERTCHARS = _LOOKBEHINDASSERTCHARS
|
|
sre_parse.py(391): REPEATCODES = _REPEATCODES
|
|
sre_parse.py(393): while 1:
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(397): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(398): if this is None:
|
|
sre_parse.py(401): if state.flags & SRE_FLAG_VERBOSE:
|
|
sre_parse.py(403): if this in WHITESPACE:
|
|
sre_parse.py(405): if this == "#":
|
|
sre_parse.py(412): if this and this[0] not in SPECIAL_CHARS:
|
|
sre_parse.py(415): elif this == "[":
|
|
sre_parse.py(472): elif this and this[0] in REPEAT_CHARS:
|
|
sre_parse.py(525): elif this == ".":
|
|
sre_parse.py(528): elif this == "(":
|
|
sre_parse.py(529): group = 1
|
|
sre_parse.py(530): name = None
|
|
sre_parse.py(531): condgroup = None
|
|
sre_parse.py(532): if sourcematch("?"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(635): if group:
|
|
sre_parse.py(637): if group == 2:
|
|
sre_parse.py(641): group = state.opengroup(name)
|
|
--- modulename: sre_parse, funcname: opengroup
|
|
sre_parse.py(73): gid = self.groups
|
|
sre_parse.py(74): self.groups = gid + 1
|
|
sre_parse.py(75): if name is not None:
|
|
sre_parse.py(81): self.open.append(gid)
|
|
sre_parse.py(82): return gid
|
|
sre_parse.py(642): if condgroup:
|
|
sre_parse.py(645): p = _parse_sub(source, state)
|
|
--- modulename: sre_parse, funcname: _parse_sub
|
|
sre_parse.py(304): items = []
|
|
sre_parse.py(305): itemsappend = items.append
|
|
sre_parse.py(306): sourcematch = source.match
|
|
sre_parse.py(307): while 1:
|
|
sre_parse.py(308): itemsappend(_parse(source, state))
|
|
--- modulename: sre_parse, funcname: _parse
|
|
sre_parse.py(381): subpattern = SubPattern(state)
|
|
--- modulename: sre_parse, funcname: __init__
|
|
sre_parse.py(91): self.pattern = pattern
|
|
sre_parse.py(92): if data is None:
|
|
sre_parse.py(93): data = []
|
|
sre_parse.py(94): self.data = data
|
|
sre_parse.py(95): self.width = None
|
|
sre_parse.py(384): subpatternappend = subpattern.append
|
|
sre_parse.py(385): sourceget = source.get
|
|
sre_parse.py(386): sourcematch = source.match
|
|
sre_parse.py(387): _len = len
|
|
sre_parse.py(388): PATTERNENDERS = _PATTERNENDERS
|
|
sre_parse.py(389): ASSERTCHARS = _ASSERTCHARS
|
|
sre_parse.py(390): LOOKBEHINDASSERTCHARS = _LOOKBEHINDASSERTCHARS
|
|
sre_parse.py(391): REPEATCODES = _REPEATCODES
|
|
sre_parse.py(393): while 1:
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(397): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(398): if this is None:
|
|
sre_parse.py(401): if state.flags & SRE_FLAG_VERBOSE:
|
|
sre_parse.py(403): if this in WHITESPACE:
|
|
sre_parse.py(405): if this == "#":
|
|
sre_parse.py(412): if this and this[0] not in SPECIAL_CHARS:
|
|
sre_parse.py(415): elif this == "[":
|
|
sre_parse.py(472): elif this and this[0] in REPEAT_CHARS:
|
|
sre_parse.py(525): elif this == ".":
|
|
sre_parse.py(526): subpatternappend((ANY, None))
|
|
--- modulename: sre_parse, funcname: append
|
|
sre_parse.py(139): self.data.append(code)
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(397): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(398): if this is None:
|
|
sre_parse.py(401): if state.flags & SRE_FLAG_VERBOSE:
|
|
sre_parse.py(403): if this in WHITESPACE:
|
|
sre_parse.py(405): if this == "#":
|
|
sre_parse.py(412): if this and this[0] not in SPECIAL_CHARS:
|
|
sre_parse.py(415): elif this == "[":
|
|
sre_parse.py(472): elif this and this[0] in REPEAT_CHARS:
|
|
sre_parse.py(474): if this == "?":
|
|
sre_parse.py(476): elif this == "*":
|
|
sre_parse.py(477): min, max = 0, MAXREPEAT
|
|
sre_parse.py(512): if subpattern:
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
sre_parse.py(513): item = subpattern[-1:]
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(132): return SubPattern(self.pattern, self.data[index])
|
|
--- modulename: sre_parse, funcname: __init__
|
|
sre_parse.py(91): self.pattern = pattern
|
|
sre_parse.py(92): if data is None:
|
|
sre_parse.py(94): self.data = data
|
|
sre_parse.py(95): self.width = None
|
|
sre_parse.py(516): if not item or (_len(item) == 1 and item[0][0] == AT):
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_parse.py(518): if item[0][0] in REPEATCODES:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_parse.py(520): if sourcematch("?"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(197): if skip:
|
|
sre_parse.py(198): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(199): return 1
|
|
sre_parse.py(521): subpattern[-1] = (MIN_REPEAT, (min, max, item))
|
|
--- modulename: sre_parse, funcname: __setitem__
|
|
sre_parse.py(135): self.data[index] = code
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(396): break # end of subpattern
|
|
sre_parse.py(673): return subpattern
|
|
sre_parse.py(309): if sourcematch("|"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(311): if not nested:
|
|
sre_parse.py(313): if not source.next or sourcematch(")", 0):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(197): if skip:
|
|
sre_parse.py(199): return 1
|
|
sre_parse.py(314): break
|
|
sre_parse.py(318): if len(items) == 1:
|
|
sre_parse.py(319): return items[0]
|
|
sre_parse.py(646): if not sourcematch(")"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(197): if skip:
|
|
sre_parse.py(198): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(199): return 1
|
|
sre_parse.py(648): if group is not None:
|
|
sre_parse.py(649): state.closegroup(group)
|
|
--- modulename: sre_parse, funcname: closegroup
|
|
sre_parse.py(84): self.open.remove(gid)
|
|
sre_parse.py(650): subpatternappend((SUBPATTERN, (group, p)))
|
|
--- modulename: sre_parse, funcname: append
|
|
sre_parse.py(139): self.data.append(code)
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(397): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(398): if this is None:
|
|
sre_parse.py(401): if state.flags & SRE_FLAG_VERBOSE:
|
|
sre_parse.py(403): if this in WHITESPACE:
|
|
sre_parse.py(405): if this == "#":
|
|
sre_parse.py(412): if this and this[0] not in SPECIAL_CHARS:
|
|
sre_parse.py(415): elif this == "[":
|
|
sre_parse.py(472): elif this and this[0] in REPEAT_CHARS:
|
|
sre_parse.py(525): elif this == ".":
|
|
sre_parse.py(528): elif this == "(":
|
|
sre_parse.py(529): group = 1
|
|
sre_parse.py(530): name = None
|
|
sre_parse.py(531): condgroup = None
|
|
sre_parse.py(532): if sourcematch("?"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(635): if group:
|
|
sre_parse.py(637): if group == 2:
|
|
sre_parse.py(641): group = state.opengroup(name)
|
|
--- modulename: sre_parse, funcname: opengroup
|
|
sre_parse.py(73): gid = self.groups
|
|
sre_parse.py(74): self.groups = gid + 1
|
|
sre_parse.py(75): if name is not None:
|
|
sre_parse.py(81): self.open.append(gid)
|
|
sre_parse.py(82): return gid
|
|
sre_parse.py(642): if condgroup:
|
|
sre_parse.py(645): p = _parse_sub(source, state)
|
|
--- modulename: sre_parse, funcname: _parse_sub
|
|
sre_parse.py(304): items = []
|
|
sre_parse.py(305): itemsappend = items.append
|
|
sre_parse.py(306): sourcematch = source.match
|
|
sre_parse.py(307): while 1:
|
|
sre_parse.py(308): itemsappend(_parse(source, state))
|
|
--- modulename: sre_parse, funcname: _parse
|
|
sre_parse.py(381): subpattern = SubPattern(state)
|
|
--- modulename: sre_parse, funcname: __init__
|
|
sre_parse.py(91): self.pattern = pattern
|
|
sre_parse.py(92): if data is None:
|
|
sre_parse.py(93): data = []
|
|
sre_parse.py(94): self.data = data
|
|
sre_parse.py(95): self.width = None
|
|
sre_parse.py(384): subpatternappend = subpattern.append
|
|
sre_parse.py(385): sourceget = source.get
|
|
sre_parse.py(386): sourcematch = source.match
|
|
sre_parse.py(387): _len = len
|
|
sre_parse.py(388): PATTERNENDERS = _PATTERNENDERS
|
|
sre_parse.py(389): ASSERTCHARS = _ASSERTCHARS
|
|
sre_parse.py(390): LOOKBEHINDASSERTCHARS = _LOOKBEHINDASSERTCHARS
|
|
sre_parse.py(391): REPEATCODES = _REPEATCODES
|
|
sre_parse.py(393): while 1:
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(397): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(398): if this is None:
|
|
sre_parse.py(401): if state.flags & SRE_FLAG_VERBOSE:
|
|
sre_parse.py(403): if this in WHITESPACE:
|
|
sre_parse.py(405): if this == "#":
|
|
sre_parse.py(412): if this and this[0] not in SPECIAL_CHARS:
|
|
sre_parse.py(415): elif this == "[":
|
|
sre_parse.py(417): set = []
|
|
sre_parse.py(418): setappend = set.append
|
|
sre_parse.py(421): if sourcematch("^"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(424): start = set[:]
|
|
sre_parse.py(425): while 1:
|
|
sre_parse.py(426): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(188): try:
|
|
sre_parse.py(189): c = self.string[self.index + 1]
|
|
sre_parse.py(192): char = char + c
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(427): if this == "]" and set != start:
|
|
sre_parse.py(429): elif this and this[0] == "\\":
|
|
sre_parse.py(431): elif this:
|
|
sre_parse.py(432): code1 = LITERAL, ord(this)
|
|
sre_parse.py(435): if sourcematch("-"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(459): if code1[0] is IN:
|
|
sre_parse.py(461): setappend(code1)
|
|
sre_parse.py(426): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(188): try:
|
|
sre_parse.py(189): c = self.string[self.index + 1]
|
|
sre_parse.py(192): char = char + c
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(427): if this == "]" and set != start:
|
|
sre_parse.py(429): elif this and this[0] == "\\":
|
|
sre_parse.py(430): code1 = _class_escape(source, this)
|
|
--- modulename: sre_parse, funcname: _class_escape
|
|
sre_parse.py(227): code = ESCAPES.get(escape)
|
|
sre_parse.py(228): if code:
|
|
sre_parse.py(229): return code
|
|
sre_parse.py(435): if sourcematch("-"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(459): if code1[0] is IN:
|
|
sre_parse.py(461): setappend(code1)
|
|
sre_parse.py(426): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(427): if this == "]" and set != start:
|
|
sre_parse.py(429): elif this and this[0] == "\\":
|
|
sre_parse.py(430): code1 = _class_escape(source, this)
|
|
--- modulename: sre_parse, funcname: _class_escape
|
|
sre_parse.py(227): code = ESCAPES.get(escape)
|
|
sre_parse.py(228): if code:
|
|
sre_parse.py(230): code = CATEGORIES.get(escape)
|
|
sre_parse.py(231): if code and code[0] == IN:
|
|
sre_parse.py(233): try:
|
|
sre_parse.py(234): c = escape[1:2]
|
|
sre_parse.py(235): if c == "x":
|
|
sre_parse.py(237): while source.next in HEXDIGITS and len(escape) < 4:
|
|
sre_parse.py(238): escape = escape + source.get()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(237): while source.next in HEXDIGITS and len(escape) < 4:
|
|
sre_parse.py(238): escape = escape + source.get()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(237): while source.next in HEXDIGITS and len(escape) < 4:
|
|
sre_parse.py(239): escape = escape[2:]
|
|
sre_parse.py(240): if len(escape) != 2:
|
|
sre_parse.py(242): return LITERAL, int(escape, 16) & 0xff
|
|
sre_parse.py(435): if sourcematch("-"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(197): if skip:
|
|
sre_parse.py(198): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(188): try:
|
|
sre_parse.py(189): c = self.string[self.index + 1]
|
|
sre_parse.py(192): char = char + c
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(199): return 1
|
|
sre_parse.py(437): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(438): if this == "]":
|
|
sre_parse.py(444): elif this:
|
|
sre_parse.py(445): if this[0] == "\\":
|
|
sre_parse.py(446): code2 = _class_escape(source, this)
|
|
--- modulename: sre_parse, funcname: _class_escape
|
|
sre_parse.py(227): code = ESCAPES.get(escape)
|
|
sre_parse.py(228): if code:
|
|
sre_parse.py(230): code = CATEGORIES.get(escape)
|
|
sre_parse.py(231): if code and code[0] == IN:
|
|
sre_parse.py(233): try:
|
|
sre_parse.py(234): c = escape[1:2]
|
|
sre_parse.py(235): if c == "x":
|
|
sre_parse.py(237): while source.next in HEXDIGITS and len(escape) < 4:
|
|
sre_parse.py(238): escape = escape + source.get()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(237): while source.next in HEXDIGITS and len(escape) < 4:
|
|
sre_parse.py(238): escape = escape + source.get()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(237): while source.next in HEXDIGITS and len(escape) < 4:
|
|
sre_parse.py(239): escape = escape[2:]
|
|
sre_parse.py(240): if len(escape) != 2:
|
|
sre_parse.py(242): return LITERAL, int(escape, 16) & 0xff
|
|
sre_parse.py(449): if code1[0] != LITERAL or code2[0] != LITERAL:
|
|
sre_parse.py(451): lo = code1[1]
|
|
sre_parse.py(452): hi = code2[1]
|
|
sre_parse.py(453): if hi < lo:
|
|
sre_parse.py(455): setappend((RANGE, (lo, hi)))
|
|
sre_parse.py(426): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(427): if this == "]" and set != start:
|
|
sre_parse.py(428): break
|
|
sre_parse.py(464): if _len(set)==1 and set[0][0] is LITERAL:
|
|
sre_parse.py(466): elif _len(set)==2 and set[0][0] is NEGATE and set[1][0] is LITERAL:
|
|
sre_parse.py(470): subpatternappend((IN, set))
|
|
--- modulename: sre_parse, funcname: append
|
|
sre_parse.py(139): self.data.append(code)
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(396): break # end of subpattern
|
|
sre_parse.py(673): return subpattern
|
|
sre_parse.py(309): if sourcematch("|"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(311): if not nested:
|
|
sre_parse.py(313): if not source.next or sourcematch(")", 0):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(197): if skip:
|
|
sre_parse.py(199): return 1
|
|
sre_parse.py(314): break
|
|
sre_parse.py(318): if len(items) == 1:
|
|
sre_parse.py(319): return items[0]
|
|
sre_parse.py(646): if not sourcematch(")"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(197): if skip:
|
|
sre_parse.py(198): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(184): self.next = None
|
|
sre_parse.py(185): return
|
|
sre_parse.py(199): return 1
|
|
sre_parse.py(648): if group is not None:
|
|
sre_parse.py(649): state.closegroup(group)
|
|
--- modulename: sre_parse, funcname: closegroup
|
|
sre_parse.py(84): self.open.remove(gid)
|
|
sre_parse.py(650): subpatternappend((SUBPATTERN, (group, p)))
|
|
--- modulename: sre_parse, funcname: append
|
|
sre_parse.py(139): self.data.append(code)
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(397): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(184): self.next = None
|
|
sre_parse.py(185): return
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(398): if this is None:
|
|
sre_parse.py(399): break # end of pattern
|
|
sre_parse.py(673): return subpattern
|
|
sre_parse.py(309): if sourcematch("|"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(311): if not nested:
|
|
sre_parse.py(312): break
|
|
sre_parse.py(318): if len(items) == 1:
|
|
sre_parse.py(319): return items[0]
|
|
sre_parse.py(687): tail = source.get()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(184): self.next = None
|
|
sre_parse.py(185): return
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(688): if tail == ")":
|
|
sre_parse.py(690): elif tail:
|
|
sre_parse.py(693): if flags & SRE_FLAG_DEBUG:
|
|
sre_parse.py(696): if not (flags & SRE_FLAG_VERBOSE) and p.pattern.flags & SRE_FLAG_VERBOSE:
|
|
sre_parse.py(701): return p
|
|
sre_compile.py(502): code = _code(p, flags)
|
|
--- modulename: sre_compile, funcname: _code
|
|
sre_compile.py(480): flags = p.pattern.flags | flags
|
|
sre_compile.py(481): code = []
|
|
sre_compile.py(484): _compile_info(code, p, flags)
|
|
--- modulename: sre_compile, funcname: _compile_info
|
|
sre_compile.py(363): lo, hi = pattern.getwidth()
|
|
--- modulename: sre_parse, funcname: getwidth
|
|
sre_parse.py(142): if self.width:
|
|
sre_parse.py(144): lo = hi = 0
|
|
sre_parse.py(145): UNITCODES = (ANY, RANGE, IN, LITERAL, NOT_LITERAL, CATEGORY)
|
|
sre_parse.py(146): REPEATCODES = (MIN_REPEAT, MAX_REPEAT)
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(148): if op is BRANCH:
|
|
sre_parse.py(157): elif op is CALL:
|
|
sre_parse.py(161): elif op is SUBPATTERN:
|
|
sre_parse.py(162): i, j = av[1].getwidth()
|
|
--- modulename: sre_parse, funcname: getwidth
|
|
sre_parse.py(142): if self.width:
|
|
sre_parse.py(144): lo = hi = 0
|
|
sre_parse.py(145): UNITCODES = (ANY, RANGE, IN, LITERAL, NOT_LITERAL, CATEGORY)
|
|
sre_parse.py(146): REPEATCODES = (MIN_REPEAT, MAX_REPEAT)
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(148): if op is BRANCH:
|
|
sre_parse.py(157): elif op is CALL:
|
|
sre_parse.py(161): elif op is SUBPATTERN:
|
|
sre_parse.py(165): elif op in REPEATCODES:
|
|
sre_parse.py(166): i, j = av[2].getwidth()
|
|
--- modulename: sre_parse, funcname: getwidth
|
|
sre_parse.py(142): if self.width:
|
|
sre_parse.py(144): lo = hi = 0
|
|
sre_parse.py(145): UNITCODES = (ANY, RANGE, IN, LITERAL, NOT_LITERAL, CATEGORY)
|
|
sre_parse.py(146): REPEATCODES = (MIN_REPEAT, MAX_REPEAT)
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(148): if op is BRANCH:
|
|
sre_parse.py(157): elif op is CALL:
|
|
sre_parse.py(161): elif op is SUBPATTERN:
|
|
sre_parse.py(165): elif op in REPEATCODES:
|
|
sre_parse.py(169): elif op in UNITCODES:
|
|
sre_parse.py(170): lo = lo + 1
|
|
sre_parse.py(171): hi = hi + 1
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(174): self.width = min(lo, MAXREPEAT - 1), min(hi, MAXREPEAT)
|
|
sre_parse.py(175): return self.width
|
|
sre_parse.py(167): lo = lo + i * av[0]
|
|
sre_parse.py(168): hi = hi + j * av[1]
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(174): self.width = min(lo, MAXREPEAT - 1), min(hi, MAXREPEAT)
|
|
sre_parse.py(175): return self.width
|
|
sre_parse.py(163): lo = lo + i
|
|
sre_parse.py(164): hi = hi + j
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(148): if op is BRANCH:
|
|
sre_parse.py(157): elif op is CALL:
|
|
sre_parse.py(161): elif op is SUBPATTERN:
|
|
sre_parse.py(162): i, j = av[1].getwidth()
|
|
--- modulename: sre_parse, funcname: getwidth
|
|
sre_parse.py(142): if self.width:
|
|
sre_parse.py(144): lo = hi = 0
|
|
sre_parse.py(145): UNITCODES = (ANY, RANGE, IN, LITERAL, NOT_LITERAL, CATEGORY)
|
|
sre_parse.py(146): REPEATCODES = (MIN_REPEAT, MAX_REPEAT)
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(148): if op is BRANCH:
|
|
sre_parse.py(157): elif op is CALL:
|
|
sre_parse.py(161): elif op is SUBPATTERN:
|
|
sre_parse.py(165): elif op in REPEATCODES:
|
|
sre_parse.py(169): elif op in UNITCODES:
|
|
sre_parse.py(170): lo = lo + 1
|
|
sre_parse.py(171): hi = hi + 1
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(174): self.width = min(lo, MAXREPEAT - 1), min(hi, MAXREPEAT)
|
|
sre_parse.py(175): return self.width
|
|
sre_parse.py(163): lo = lo + i
|
|
sre_parse.py(164): hi = hi + j
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(174): self.width = min(lo, MAXREPEAT - 1), min(hi, MAXREPEAT)
|
|
sre_parse.py(175): return self.width
|
|
sre_compile.py(364): if lo == 0:
|
|
sre_compile.py(367): prefix = []
|
|
sre_compile.py(368): prefixappend = prefix.append
|
|
sre_compile.py(369): prefix_skip = 0
|
|
sre_compile.py(370): charset = [] # not used
|
|
sre_compile.py(371): charsetappend = charset.append
|
|
sre_compile.py(372): if not (flags & SRE_FLAG_IGNORECASE):
|
|
sre_compile.py(374): for op, av in pattern.data:
|
|
sre_compile.py(375): if op is LITERAL:
|
|
sre_compile.py(379): elif op is SUBPATTERN and len(av[1]) == 1:
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
sre_compile.py(380): op, av = av[1][0]
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(381): if op is LITERAL:
|
|
sre_compile.py(384): break
|
|
sre_compile.py(388): if not prefix and pattern.data:
|
|
sre_compile.py(389): op, av = pattern.data[0]
|
|
sre_compile.py(390): if op is SUBPATTERN and av[1]:
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
sre_compile.py(391): op, av = av[1][0]
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(392): if op is LITERAL:
|
|
sre_compile.py(394): elif op is BRANCH:
|
|
sre_compile.py(427): emit = code.append
|
|
sre_compile.py(428): emit(OPCODES[INFO])
|
|
sre_compile.py(429): skip = len(code); emit(0)
|
|
sre_compile.py(431): mask = 0
|
|
sre_compile.py(432): if prefix:
|
|
sre_compile.py(436): elif charset:
|
|
sre_compile.py(438): emit(mask)
|
|
sre_compile.py(440): if lo < MAXCODE:
|
|
sre_compile.py(441): emit(lo)
|
|
sre_compile.py(445): if hi < MAXCODE:
|
|
sre_compile.py(448): emit(0)
|
|
sre_compile.py(450): if prefix:
|
|
sre_compile.py(461): elif charset:
|
|
sre_compile.py(463): code[skip] = len(code) - skip
|
|
sre_compile.py(487): _compile(code, p.data, flags)
|
|
--- modulename: sre_compile, funcname: _compile
|
|
sre_compile.py(34): emit = code.append
|
|
sre_compile.py(35): _len = len
|
|
sre_compile.py(36): LITERAL_CODES = _LITERAL_CODES
|
|
sre_compile.py(37): REPEATING_CODES = _REPEATING_CODES
|
|
sre_compile.py(38): SUCCESS_CODES = _SUCCESS_CODES
|
|
sre_compile.py(39): ASSERT_CODES = _ASSERT_CODES
|
|
sre_compile.py(40): for op, av in pattern:
|
|
sre_compile.py(41): if op in LITERAL_CODES:
|
|
sre_compile.py(48): elif op is IN:
|
|
sre_compile.py(59): elif op is ANY:
|
|
sre_compile.py(64): elif op in REPEATING_CODES:
|
|
sre_compile.py(96): elif op is SUBPATTERN:
|
|
sre_compile.py(97): if av[0]:
|
|
sre_compile.py(98): emit(OPCODES[MARK])
|
|
sre_compile.py(99): emit((av[0]-1)*2)
|
|
sre_compile.py(101): _compile(code, av[1], flags)
|
|
--- modulename: sre_compile, funcname: _compile
|
|
sre_compile.py(34): emit = code.append
|
|
sre_compile.py(35): _len = len
|
|
sre_compile.py(36): LITERAL_CODES = _LITERAL_CODES
|
|
sre_compile.py(37): REPEATING_CODES = _REPEATING_CODES
|
|
sre_compile.py(38): SUCCESS_CODES = _SUCCESS_CODES
|
|
sre_compile.py(39): ASSERT_CODES = _ASSERT_CODES
|
|
sre_compile.py(40): for op, av in pattern:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(41): if op in LITERAL_CODES:
|
|
sre_compile.py(48): elif op is IN:
|
|
sre_compile.py(59): elif op is ANY:
|
|
sre_compile.py(64): elif op in REPEATING_CODES:
|
|
sre_compile.py(65): if flags & SRE_FLAG_TEMPLATE:
|
|
sre_compile.py(74): elif _simple(av) and op is not REPEAT:
|
|
--- modulename: sre_compile, funcname: _simple
|
|
sre_compile.py(356): lo, hi = av[2].getwidth()
|
|
--- modulename: sre_parse, funcname: getwidth
|
|
sre_parse.py(142): if self.width:
|
|
sre_parse.py(143): return self.width
|
|
sre_compile.py(357): return lo == hi == 1 and av[2][0][0] != SUBPATTERN
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(75): if op is MAX_REPEAT:
|
|
sre_compile.py(78): emit(OPCODES[MIN_REPEAT_ONE])
|
|
sre_compile.py(79): skip = _len(code); emit(0)
|
|
sre_compile.py(80): emit(av[0])
|
|
sre_compile.py(81): emit(av[1])
|
|
sre_compile.py(82): _compile(code, av[2], flags)
|
|
--- modulename: sre_compile, funcname: _compile
|
|
sre_compile.py(34): emit = code.append
|
|
sre_compile.py(35): _len = len
|
|
sre_compile.py(36): LITERAL_CODES = _LITERAL_CODES
|
|
sre_compile.py(37): REPEATING_CODES = _REPEATING_CODES
|
|
sre_compile.py(38): SUCCESS_CODES = _SUCCESS_CODES
|
|
sre_compile.py(39): ASSERT_CODES = _ASSERT_CODES
|
|
sre_compile.py(40): for op, av in pattern:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(41): if op in LITERAL_CODES:
|
|
sre_compile.py(48): elif op is IN:
|
|
sre_compile.py(59): elif op is ANY:
|
|
sre_compile.py(60): if flags & SRE_FLAG_DOTALL:
|
|
sre_compile.py(61): emit(OPCODES[ANY_ALL])
|
|
sre_compile.py(40): for op, av in pattern:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(83): emit(OPCODES[SUCCESS])
|
|
sre_compile.py(84): code[skip] = _len(code) - skip
|
|
sre_compile.py(40): for op, av in pattern:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(102): if av[0]:
|
|
sre_compile.py(103): emit(OPCODES[MARK])
|
|
sre_compile.py(104): emit((av[0]-1)*2+1)
|
|
sre_compile.py(40): for op, av in pattern:
|
|
sre_compile.py(41): if op in LITERAL_CODES:
|
|
sre_compile.py(48): elif op is IN:
|
|
sre_compile.py(59): elif op is ANY:
|
|
sre_compile.py(64): elif op in REPEATING_CODES:
|
|
sre_compile.py(96): elif op is SUBPATTERN:
|
|
sre_compile.py(97): if av[0]:
|
|
sre_compile.py(98): emit(OPCODES[MARK])
|
|
sre_compile.py(99): emit((av[0]-1)*2)
|
|
sre_compile.py(101): _compile(code, av[1], flags)
|
|
--- modulename: sre_compile, funcname: _compile
|
|
sre_compile.py(34): emit = code.append
|
|
sre_compile.py(35): _len = len
|
|
sre_compile.py(36): LITERAL_CODES = _LITERAL_CODES
|
|
sre_compile.py(37): REPEATING_CODES = _REPEATING_CODES
|
|
sre_compile.py(38): SUCCESS_CODES = _SUCCESS_CODES
|
|
sre_compile.py(39): ASSERT_CODES = _ASSERT_CODES
|
|
sre_compile.py(40): for op, av in pattern:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(41): if op in LITERAL_CODES:
|
|
sre_compile.py(48): elif op is IN:
|
|
sre_compile.py(49): if flags & SRE_FLAG_IGNORECASE:
|
|
sre_compile.py(54): emit(OPCODES[op])
|
|
sre_compile.py(55): fixup = _identityfunction
|
|
sre_compile.py(56): skip = _len(code); emit(0)
|
|
sre_compile.py(57): _compile_charset(av, flags, code, fixup)
|
|
--- modulename: sre_compile, funcname: _compile_charset
|
|
sre_compile.py(180): emit = code.append
|
|
sre_compile.py(181): if fixup is None:
|
|
sre_compile.py(183): for op, av in _optimize_charset(charset, fixup):
|
|
--- modulename: sre_compile, funcname: _optimize_charset
|
|
sre_compile.py(209): out = []
|
|
sre_compile.py(210): outappend = out.append
|
|
sre_compile.py(211): charmap = [0]*256
|
|
sre_compile.py(212): try:
|
|
sre_compile.py(213): for op, av in charset:
|
|
sre_compile.py(214): if op is NEGATE:
|
|
sre_compile.py(216): elif op is LITERAL:
|
|
sre_compile.py(217): charmap[fixup(av)] = 1
|
|
--- modulename: sre_compile, funcname: _identityfunction
|
|
sre_compile.py(25): return x
|
|
sre_compile.py(213): for op, av in charset:
|
|
sre_compile.py(214): if op is NEGATE:
|
|
sre_compile.py(216): elif op is LITERAL:
|
|
sre_compile.py(217): charmap[fixup(av)] = 1
|
|
--- modulename: sre_compile, funcname: _identityfunction
|
|
sre_compile.py(25): return x
|
|
sre_compile.py(213): for op, av in charset:
|
|
sre_compile.py(214): if op is NEGATE:
|
|
sre_compile.py(216): elif op is LITERAL:
|
|
sre_compile.py(218): elif op is RANGE:
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
--- modulename: sre_compile, funcname: _identityfunction
|
|
sre_compile.py(25): return x
|
|
--- modulename: sre_compile, funcname: _identityfunction
|
|
sre_compile.py(25): return x
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(213): for op, av in charset:
|
|
sre_compile.py(228): i = p = n = 0
|
|
sre_compile.py(229): runs = []
|
|
sre_compile.py(230): runsappend = runs.append
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(234): p = i
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(237): runsappend((p, n))
|
|
sre_compile.py(238): n = 0
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(234): p = i
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(237): runsappend((p, n))
|
|
sre_compile.py(238): n = 0
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(234): p = i
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(237): runsappend((p, n))
|
|
sre_compile.py(238): n = 0
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(240): if n:
|
|
sre_compile.py(242): if len(runs) <= 2:
|
|
sre_compile.py(253): data = _mk_bitmap(charmap)
|
|
--- modulename: sre_compile, funcname: _mk_bitmap
|
|
sre_compile.py(259): data = []
|
|
sre_compile.py(260): dataappend = data.append
|
|
sre_compile.py(261): if _sre.CODESIZE == 2:
|
|
sre_compile.py(264): start = (1L, 0L)
|
|
sre_compile.py(265): m, v = start
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(271): dataappend(v)
|
|
sre_compile.py(272): m, v = start
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(271): dataappend(v)
|
|
sre_compile.py(272): m, v = start
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(271): dataappend(v)
|
|
sre_compile.py(272): m, v = start
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(271): dataappend(v)
|
|
sre_compile.py(272): m, v = start
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(271): dataappend(v)
|
|
sre_compile.py(272): m, v = start
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(271): dataappend(v)
|
|
sre_compile.py(272): m, v = start
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(271): dataappend(v)
|
|
sre_compile.py(272): m, v = start
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(271): dataappend(v)
|
|
sre_compile.py(272): m, v = start
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(273): return data
|
|
sre_compile.py(254): outappend((CHARSET, data))
|
|
sre_compile.py(255): return out
|
|
sre_compile.py(184): emit(OPCODES[op])
|
|
sre_compile.py(185): if op is NEGATE:
|
|
sre_compile.py(187): elif op is LITERAL:
|
|
sre_compile.py(189): elif op is RANGE:
|
|
sre_compile.py(192): elif op is CHARSET:
|
|
sre_compile.py(193): code.extend(av)
|
|
sre_compile.py(183): for op, av in _optimize_charset(charset, fixup):
|
|
sre_compile.py(205): emit(OPCODES[FAILURE])
|
|
sre_compile.py(58): code[skip] = _len(code) - skip
|
|
sre_compile.py(40): for op, av in pattern:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(102): if av[0]:
|
|
sre_compile.py(103): emit(OPCODES[MARK])
|
|
sre_compile.py(104): emit((av[0]-1)*2+1)
|
|
sre_compile.py(40): for op, av in pattern:
|
|
sre_compile.py(489): code.append(OPCODES[SUCCESS])
|
|
sre_compile.py(491): return code
|
|
sre_compile.py(507): if p.pattern.groups > 100:
|
|
sre_compile.py(513): groupindex = p.pattern.groupdict
|
|
sre_compile.py(514): indexgroup = [None] * p.pattern.groups
|
|
sre_compile.py(515): for k, i in groupindex.items():
|
|
sre_compile.py(518): return _sre.compile(
|
|
sre_compile.py(519): pattern, flags | p.pattern.flags, code,
|
|
sre_compile.py(520): p.pattern.groups-1,
|
|
sre_compile.py(521): groupindex, indexgroup
|
|
re.py(245): if not bypass_cache:
|
|
re.py(246): if len(_cache) >= _MAXCACHE:
|
|
re.py(248): _cache[cachekey] = p
|
|
re.py(249): return p
|
|
decoder.py(58): BACKSLASH = {
|
|
decoder.py(59): '"': u'"', '\\': u'\\', '/': u'/',
|
|
decoder.py(60): 'b': u'\b', 'f': u'\f', 'n': u'\n', 'r': u'\r', 't': u'\t',
|
|
decoder.py(63): DEFAULT_ENCODING = "utf-8"
|
|
decoder.py(65): def _decode_uXXXX(s, pos):
|
|
decoder.py(75): def py_scanstring(s, end, encoding=None, strict=True,
|
|
decoder.py(76): _b=BACKSLASH, _m=STRINGCHUNK.match):
|
|
decoder.py(145): scanstring = c_scanstring or py_scanstring
|
|
decoder.py(147): WHITESPACE = re.compile(r'[ \t\n\r]*', FLAGS)
|
|
--- modulename: re, funcname: compile
|
|
re.py(190): return _compile(pattern, flags)
|
|
--- modulename: re, funcname: _compile
|
|
re.py(228): pattern, flags = key
|
|
re.py(229): bypass_cache = flags & DEBUG
|
|
re.py(230): if not bypass_cache:
|
|
re.py(231): cachekey = (type(key[0]),) + key
|
|
re.py(232): p = _cache.get(cachekey)
|
|
re.py(233): if p is not None:
|
|
re.py(235): if isinstance(pattern, _pattern_type):
|
|
re.py(239): if not sre_compile.isstring(pattern):
|
|
--- modulename: sre_compile, funcname: isstring
|
|
sre_compile.py(473): for tp in STRING_TYPES:
|
|
sre_compile.py(474): if isinstance(obj, tp):
|
|
sre_compile.py(475): return 1
|
|
re.py(241): try:
|
|
re.py(242): p = sre_compile.compile(pattern, flags)
|
|
--- modulename: sre_compile, funcname: compile
|
|
sre_compile.py(496): if isstring(p):
|
|
--- modulename: sre_compile, funcname: isstring
|
|
sre_compile.py(473): for tp in STRING_TYPES:
|
|
sre_compile.py(474): if isinstance(obj, tp):
|
|
sre_compile.py(475): return 1
|
|
sre_compile.py(497): pattern = p
|
|
sre_compile.py(498): p = sre_parse.parse(p, flags)
|
|
--- modulename: sre_parse, funcname: parse
|
|
sre_parse.py(678): source = Tokenizer(str)
|
|
--- modulename: sre_parse, funcname: __init__
|
|
sre_parse.py(179): self.string = string
|
|
sre_parse.py(180): self.index = 0
|
|
sre_parse.py(181): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(680): if pattern is None:
|
|
sre_parse.py(681): pattern = Pattern()
|
|
--- modulename: sre_parse, funcname: __init__
|
|
sre_parse.py(68): self.flags = 0
|
|
sre_parse.py(69): self.open = []
|
|
sre_parse.py(70): self.groups = 1
|
|
sre_parse.py(71): self.groupdict = {}
|
|
sre_parse.py(682): pattern.flags = flags
|
|
sre_parse.py(683): pattern.str = str
|
|
sre_parse.py(685): p = _parse_sub(source, pattern, 0)
|
|
--- modulename: sre_parse, funcname: _parse_sub
|
|
sre_parse.py(304): items = []
|
|
sre_parse.py(305): itemsappend = items.append
|
|
sre_parse.py(306): sourcematch = source.match
|
|
sre_parse.py(307): while 1:
|
|
sre_parse.py(308): itemsappend(_parse(source, state))
|
|
--- modulename: sre_parse, funcname: _parse
|
|
sre_parse.py(381): subpattern = SubPattern(state)
|
|
--- modulename: sre_parse, funcname: __init__
|
|
sre_parse.py(91): self.pattern = pattern
|
|
sre_parse.py(92): if data is None:
|
|
sre_parse.py(93): data = []
|
|
sre_parse.py(94): self.data = data
|
|
sre_parse.py(95): self.width = None
|
|
sre_parse.py(384): subpatternappend = subpattern.append
|
|
sre_parse.py(385): sourceget = source.get
|
|
sre_parse.py(386): sourcematch = source.match
|
|
sre_parse.py(387): _len = len
|
|
sre_parse.py(388): PATTERNENDERS = _PATTERNENDERS
|
|
sre_parse.py(389): ASSERTCHARS = _ASSERTCHARS
|
|
sre_parse.py(390): LOOKBEHINDASSERTCHARS = _LOOKBEHINDASSERTCHARS
|
|
sre_parse.py(391): REPEATCODES = _REPEATCODES
|
|
sre_parse.py(393): while 1:
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(397): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(398): if this is None:
|
|
sre_parse.py(401): if state.flags & SRE_FLAG_VERBOSE:
|
|
sre_parse.py(403): if this in WHITESPACE:
|
|
sre_parse.py(405): if this == "#":
|
|
sre_parse.py(412): if this and this[0] not in SPECIAL_CHARS:
|
|
sre_parse.py(415): elif this == "[":
|
|
sre_parse.py(417): set = []
|
|
sre_parse.py(418): setappend = set.append
|
|
sre_parse.py(421): if sourcematch("^"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(424): start = set[:]
|
|
sre_parse.py(425): while 1:
|
|
sre_parse.py(426): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(188): try:
|
|
sre_parse.py(189): c = self.string[self.index + 1]
|
|
sre_parse.py(192): char = char + c
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(427): if this == "]" and set != start:
|
|
sre_parse.py(429): elif this and this[0] == "\\":
|
|
sre_parse.py(431): elif this:
|
|
sre_parse.py(432): code1 = LITERAL, ord(this)
|
|
sre_parse.py(435): if sourcematch("-"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(459): if code1[0] is IN:
|
|
sre_parse.py(461): setappend(code1)
|
|
sre_parse.py(426): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(188): try:
|
|
sre_parse.py(189): c = self.string[self.index + 1]
|
|
sre_parse.py(192): char = char + c
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(427): if this == "]" and set != start:
|
|
sre_parse.py(429): elif this and this[0] == "\\":
|
|
sre_parse.py(430): code1 = _class_escape(source, this)
|
|
--- modulename: sre_parse, funcname: _class_escape
|
|
sre_parse.py(227): code = ESCAPES.get(escape)
|
|
sre_parse.py(228): if code:
|
|
sre_parse.py(229): return code
|
|
sre_parse.py(435): if sourcematch("-"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(459): if code1[0] is IN:
|
|
sre_parse.py(461): setappend(code1)
|
|
sre_parse.py(426): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(188): try:
|
|
sre_parse.py(189): c = self.string[self.index + 1]
|
|
sre_parse.py(192): char = char + c
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(427): if this == "]" and set != start:
|
|
sre_parse.py(429): elif this and this[0] == "\\":
|
|
sre_parse.py(430): code1 = _class_escape(source, this)
|
|
--- modulename: sre_parse, funcname: _class_escape
|
|
sre_parse.py(227): code = ESCAPES.get(escape)
|
|
sre_parse.py(228): if code:
|
|
sre_parse.py(229): return code
|
|
sre_parse.py(435): if sourcematch("-"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(459): if code1[0] is IN:
|
|
sre_parse.py(461): setappend(code1)
|
|
sre_parse.py(426): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(427): if this == "]" and set != start:
|
|
sre_parse.py(429): elif this and this[0] == "\\":
|
|
sre_parse.py(430): code1 = _class_escape(source, this)
|
|
--- modulename: sre_parse, funcname: _class_escape
|
|
sre_parse.py(227): code = ESCAPES.get(escape)
|
|
sre_parse.py(228): if code:
|
|
sre_parse.py(229): return code
|
|
sre_parse.py(435): if sourcematch("-"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(459): if code1[0] is IN:
|
|
sre_parse.py(461): setappend(code1)
|
|
sre_parse.py(426): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(427): if this == "]" and set != start:
|
|
sre_parse.py(428): break
|
|
sre_parse.py(464): if _len(set)==1 and set[0][0] is LITERAL:
|
|
sre_parse.py(466): elif _len(set)==2 and set[0][0] is NEGATE and set[1][0] is LITERAL:
|
|
sre_parse.py(470): subpatternappend((IN, set))
|
|
--- modulename: sre_parse, funcname: append
|
|
sre_parse.py(139): self.data.append(code)
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(397): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(184): self.next = None
|
|
sre_parse.py(185): return
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(398): if this is None:
|
|
sre_parse.py(401): if state.flags & SRE_FLAG_VERBOSE:
|
|
sre_parse.py(403): if this in WHITESPACE:
|
|
sre_parse.py(405): if this == "#":
|
|
sre_parse.py(412): if this and this[0] not in SPECIAL_CHARS:
|
|
sre_parse.py(415): elif this == "[":
|
|
sre_parse.py(472): elif this and this[0] in REPEAT_CHARS:
|
|
sre_parse.py(474): if this == "?":
|
|
sre_parse.py(476): elif this == "*":
|
|
sre_parse.py(477): min, max = 0, MAXREPEAT
|
|
sre_parse.py(512): if subpattern:
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
sre_parse.py(513): item = subpattern[-1:]
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(132): return SubPattern(self.pattern, self.data[index])
|
|
--- modulename: sre_parse, funcname: __init__
|
|
sre_parse.py(91): self.pattern = pattern
|
|
sre_parse.py(92): if data is None:
|
|
sre_parse.py(94): self.data = data
|
|
sre_parse.py(95): self.width = None
|
|
sre_parse.py(516): if not item or (_len(item) == 1 and item[0][0] == AT):
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_parse.py(518): if item[0][0] in REPEATCODES:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_parse.py(520): if sourcematch("?"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(523): subpattern[-1] = (MAX_REPEAT, (min, max, item))
|
|
--- modulename: sre_parse, funcname: __setitem__
|
|
sre_parse.py(135): self.data[index] = code
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(397): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(184): self.next = None
|
|
sre_parse.py(185): return
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(398): if this is None:
|
|
sre_parse.py(399): break # end of pattern
|
|
sre_parse.py(673): return subpattern
|
|
sre_parse.py(309): if sourcematch("|"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(311): if not nested:
|
|
sre_parse.py(312): break
|
|
sre_parse.py(318): if len(items) == 1:
|
|
sre_parse.py(319): return items[0]
|
|
sre_parse.py(687): tail = source.get()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(184): self.next = None
|
|
sre_parse.py(185): return
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(688): if tail == ")":
|
|
sre_parse.py(690): elif tail:
|
|
sre_parse.py(693): if flags & SRE_FLAG_DEBUG:
|
|
sre_parse.py(696): if not (flags & SRE_FLAG_VERBOSE) and p.pattern.flags & SRE_FLAG_VERBOSE:
|
|
sre_parse.py(701): return p
|
|
sre_compile.py(502): code = _code(p, flags)
|
|
--- modulename: sre_compile, funcname: _code
|
|
sre_compile.py(480): flags = p.pattern.flags | flags
|
|
sre_compile.py(481): code = []
|
|
sre_compile.py(484): _compile_info(code, p, flags)
|
|
--- modulename: sre_compile, funcname: _compile_info
|
|
sre_compile.py(363): lo, hi = pattern.getwidth()
|
|
--- modulename: sre_parse, funcname: getwidth
|
|
sre_parse.py(142): if self.width:
|
|
sre_parse.py(144): lo = hi = 0
|
|
sre_parse.py(145): UNITCODES = (ANY, RANGE, IN, LITERAL, NOT_LITERAL, CATEGORY)
|
|
sre_parse.py(146): REPEATCODES = (MIN_REPEAT, MAX_REPEAT)
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(148): if op is BRANCH:
|
|
sre_parse.py(157): elif op is CALL:
|
|
sre_parse.py(161): elif op is SUBPATTERN:
|
|
sre_parse.py(165): elif op in REPEATCODES:
|
|
sre_parse.py(166): i, j = av[2].getwidth()
|
|
--- modulename: sre_parse, funcname: getwidth
|
|
sre_parse.py(142): if self.width:
|
|
sre_parse.py(144): lo = hi = 0
|
|
sre_parse.py(145): UNITCODES = (ANY, RANGE, IN, LITERAL, NOT_LITERAL, CATEGORY)
|
|
sre_parse.py(146): REPEATCODES = (MIN_REPEAT, MAX_REPEAT)
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(148): if op is BRANCH:
|
|
sre_parse.py(157): elif op is CALL:
|
|
sre_parse.py(161): elif op is SUBPATTERN:
|
|
sre_parse.py(165): elif op in REPEATCODES:
|
|
sre_parse.py(169): elif op in UNITCODES:
|
|
sre_parse.py(170): lo = lo + 1
|
|
sre_parse.py(171): hi = hi + 1
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(174): self.width = min(lo, MAXREPEAT - 1), min(hi, MAXREPEAT)
|
|
sre_parse.py(175): return self.width
|
|
sre_parse.py(167): lo = lo + i * av[0]
|
|
sre_parse.py(168): hi = hi + j * av[1]
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(174): self.width = min(lo, MAXREPEAT - 1), min(hi, MAXREPEAT)
|
|
sre_parse.py(175): return self.width
|
|
sre_compile.py(364): if lo == 0:
|
|
sre_compile.py(365): return # not worth it
|
|
sre_compile.py(487): _compile(code, p.data, flags)
|
|
--- modulename: sre_compile, funcname: _compile
|
|
sre_compile.py(34): emit = code.append
|
|
sre_compile.py(35): _len = len
|
|
sre_compile.py(36): LITERAL_CODES = _LITERAL_CODES
|
|
sre_compile.py(37): REPEATING_CODES = _REPEATING_CODES
|
|
sre_compile.py(38): SUCCESS_CODES = _SUCCESS_CODES
|
|
sre_compile.py(39): ASSERT_CODES = _ASSERT_CODES
|
|
sre_compile.py(40): for op, av in pattern:
|
|
sre_compile.py(41): if op in LITERAL_CODES:
|
|
sre_compile.py(48): elif op is IN:
|
|
sre_compile.py(59): elif op is ANY:
|
|
sre_compile.py(64): elif op in REPEATING_CODES:
|
|
sre_compile.py(65): if flags & SRE_FLAG_TEMPLATE:
|
|
sre_compile.py(74): elif _simple(av) and op is not REPEAT:
|
|
--- modulename: sre_compile, funcname: _simple
|
|
sre_compile.py(356): lo, hi = av[2].getwidth()
|
|
--- modulename: sre_parse, funcname: getwidth
|
|
sre_parse.py(142): if self.width:
|
|
sre_parse.py(143): return self.width
|
|
sre_compile.py(357): return lo == hi == 1 and av[2][0][0] != SUBPATTERN
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(75): if op is MAX_REPEAT:
|
|
sre_compile.py(76): emit(OPCODES[REPEAT_ONE])
|
|
sre_compile.py(79): skip = _len(code); emit(0)
|
|
sre_compile.py(80): emit(av[0])
|
|
sre_compile.py(81): emit(av[1])
|
|
sre_compile.py(82): _compile(code, av[2], flags)
|
|
--- modulename: sre_compile, funcname: _compile
|
|
sre_compile.py(34): emit = code.append
|
|
sre_compile.py(35): _len = len
|
|
sre_compile.py(36): LITERAL_CODES = _LITERAL_CODES
|
|
sre_compile.py(37): REPEATING_CODES = _REPEATING_CODES
|
|
sre_compile.py(38): SUCCESS_CODES = _SUCCESS_CODES
|
|
sre_compile.py(39): ASSERT_CODES = _ASSERT_CODES
|
|
sre_compile.py(40): for op, av in pattern:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(41): if op in LITERAL_CODES:
|
|
sre_compile.py(48): elif op is IN:
|
|
sre_compile.py(49): if flags & SRE_FLAG_IGNORECASE:
|
|
sre_compile.py(54): emit(OPCODES[op])
|
|
sre_compile.py(55): fixup = _identityfunction
|
|
sre_compile.py(56): skip = _len(code); emit(0)
|
|
sre_compile.py(57): _compile_charset(av, flags, code, fixup)
|
|
--- modulename: sre_compile, funcname: _compile_charset
|
|
sre_compile.py(180): emit = code.append
|
|
sre_compile.py(181): if fixup is None:
|
|
sre_compile.py(183): for op, av in _optimize_charset(charset, fixup):
|
|
--- modulename: sre_compile, funcname: _optimize_charset
|
|
sre_compile.py(209): out = []
|
|
sre_compile.py(210): outappend = out.append
|
|
sre_compile.py(211): charmap = [0]*256
|
|
sre_compile.py(212): try:
|
|
sre_compile.py(213): for op, av in charset:
|
|
sre_compile.py(214): if op is NEGATE:
|
|
sre_compile.py(216): elif op is LITERAL:
|
|
sre_compile.py(217): charmap[fixup(av)] = 1
|
|
--- modulename: sre_compile, funcname: _identityfunction
|
|
sre_compile.py(25): return x
|
|
sre_compile.py(213): for op, av in charset:
|
|
sre_compile.py(214): if op is NEGATE:
|
|
sre_compile.py(216): elif op is LITERAL:
|
|
sre_compile.py(217): charmap[fixup(av)] = 1
|
|
--- modulename: sre_compile, funcname: _identityfunction
|
|
sre_compile.py(25): return x
|
|
sre_compile.py(213): for op, av in charset:
|
|
sre_compile.py(214): if op is NEGATE:
|
|
sre_compile.py(216): elif op is LITERAL:
|
|
sre_compile.py(217): charmap[fixup(av)] = 1
|
|
--- modulename: sre_compile, funcname: _identityfunction
|
|
sre_compile.py(25): return x
|
|
sre_compile.py(213): for op, av in charset:
|
|
sre_compile.py(214): if op is NEGATE:
|
|
sre_compile.py(216): elif op is LITERAL:
|
|
sre_compile.py(217): charmap[fixup(av)] = 1
|
|
--- modulename: sre_compile, funcname: _identityfunction
|
|
sre_compile.py(25): return x
|
|
sre_compile.py(213): for op, av in charset:
|
|
sre_compile.py(228): i = p = n = 0
|
|
sre_compile.py(229): runs = []
|
|
sre_compile.py(230): runsappend = runs.append
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(234): p = i
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(237): runsappend((p, n))
|
|
sre_compile.py(238): n = 0
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(234): p = i
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(237): runsappend((p, n))
|
|
sre_compile.py(238): n = 0
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(234): p = i
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(237): runsappend((p, n))
|
|
sre_compile.py(238): n = 0
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(240): if n:
|
|
sre_compile.py(242): if len(runs) <= 2:
|
|
sre_compile.py(253): data = _mk_bitmap(charmap)
|
|
--- modulename: sre_compile, funcname: _mk_bitmap
|
|
sre_compile.py(259): data = []
|
|
sre_compile.py(260): dataappend = data.append
|
|
sre_compile.py(261): if _sre.CODESIZE == 2:
|
|
sre_compile.py(264): start = (1L, 0L)
|
|
sre_compile.py(265): m, v = start
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(271): dataappend(v)
|
|
sre_compile.py(272): m, v = start
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(271): dataappend(v)
|
|
sre_compile.py(272): m, v = start
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(271): dataappend(v)
|
|
sre_compile.py(272): m, v = start
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(271): dataappend(v)
|
|
sre_compile.py(272): m, v = start
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(271): dataappend(v)
|
|
sre_compile.py(272): m, v = start
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(271): dataappend(v)
|
|
sre_compile.py(272): m, v = start
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(271): dataappend(v)
|
|
sre_compile.py(272): m, v = start
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(271): dataappend(v)
|
|
sre_compile.py(272): m, v = start
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(273): return data
|
|
sre_compile.py(254): outappend((CHARSET, data))
|
|
sre_compile.py(255): return out
|
|
sre_compile.py(184): emit(OPCODES[op])
|
|
sre_compile.py(185): if op is NEGATE:
|
|
sre_compile.py(187): elif op is LITERAL:
|
|
sre_compile.py(189): elif op is RANGE:
|
|
sre_compile.py(192): elif op is CHARSET:
|
|
sre_compile.py(193): code.extend(av)
|
|
sre_compile.py(183): for op, av in _optimize_charset(charset, fixup):
|
|
sre_compile.py(205): emit(OPCODES[FAILURE])
|
|
sre_compile.py(58): code[skip] = _len(code) - skip
|
|
sre_compile.py(40): for op, av in pattern:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(83): emit(OPCODES[SUCCESS])
|
|
sre_compile.py(84): code[skip] = _len(code) - skip
|
|
sre_compile.py(40): for op, av in pattern:
|
|
sre_compile.py(489): code.append(OPCODES[SUCCESS])
|
|
sre_compile.py(491): return code
|
|
sre_compile.py(507): if p.pattern.groups > 100:
|
|
sre_compile.py(513): groupindex = p.pattern.groupdict
|
|
sre_compile.py(514): indexgroup = [None] * p.pattern.groups
|
|
sre_compile.py(515): for k, i in groupindex.items():
|
|
sre_compile.py(518): return _sre.compile(
|
|
sre_compile.py(519): pattern, flags | p.pattern.flags, code,
|
|
sre_compile.py(520): p.pattern.groups-1,
|
|
sre_compile.py(521): groupindex, indexgroup
|
|
re.py(245): if not bypass_cache:
|
|
re.py(246): if len(_cache) >= _MAXCACHE:
|
|
re.py(248): _cache[cachekey] = p
|
|
re.py(249): return p
|
|
decoder.py(148): WHITESPACE_STR = ' \t\n\r'
|
|
decoder.py(151): object_pairs_hook, _w=WHITESPACE.match, _ws=WHITESPACE_STR):
|
|
decoder.py(238): def JSONArray(s_and_end, scan_once, _w=WHITESPACE.match, _ws=WHITESPACE_STR):
|
|
decoder.py(274): class JSONDecoder(object):
|
|
--- modulename: decoder, funcname: JSONDecoder
|
|
decoder.py(274): class JSONDecoder(object):
|
|
decoder.py(302): """
|
|
decoder.py(304): def __init__(self, encoding=None, object_hook=None, parse_float=None,
|
|
decoder.py(305): parse_int=None, parse_constant=None, strict=True,
|
|
decoder.py(306): object_pairs_hook=None):
|
|
decoder.py(361): def decode(self, s, _w=WHITESPACE.match):
|
|
decoder.py(372): def raw_decode(self, s, idx=0):
|
|
__init__.py(109): from .encoder import JSONEncoder
|
|
--- modulename: encoder, funcname: <module>
|
|
encoder.py(2): """
|
|
encoder.py(3): import re
|
|
encoder.py(5): try:
|
|
encoder.py(6): from _json import encode_basestring_ascii as c_encode_basestring_ascii
|
|
encoder.py(9): try:
|
|
encoder.py(10): from _json import make_encoder as c_make_encoder
|
|
encoder.py(14): ESCAPE = re.compile(r'[\x00-\x1f\\"\b\f\n\r\t]')
|
|
--- modulename: re, funcname: compile
|
|
re.py(190): return _compile(pattern, flags)
|
|
--- modulename: re, funcname: _compile
|
|
re.py(228): pattern, flags = key
|
|
re.py(229): bypass_cache = flags & DEBUG
|
|
re.py(230): if not bypass_cache:
|
|
re.py(231): cachekey = (type(key[0]),) + key
|
|
re.py(232): p = _cache.get(cachekey)
|
|
re.py(233): if p is not None:
|
|
re.py(235): if isinstance(pattern, _pattern_type):
|
|
re.py(239): if not sre_compile.isstring(pattern):
|
|
--- modulename: sre_compile, funcname: isstring
|
|
sre_compile.py(473): for tp in STRING_TYPES:
|
|
sre_compile.py(474): if isinstance(obj, tp):
|
|
sre_compile.py(475): return 1
|
|
re.py(241): try:
|
|
re.py(242): p = sre_compile.compile(pattern, flags)
|
|
--- modulename: sre_compile, funcname: compile
|
|
sre_compile.py(496): if isstring(p):
|
|
--- modulename: sre_compile, funcname: isstring
|
|
sre_compile.py(473): for tp in STRING_TYPES:
|
|
sre_compile.py(474): if isinstance(obj, tp):
|
|
sre_compile.py(475): return 1
|
|
sre_compile.py(497): pattern = p
|
|
sre_compile.py(498): p = sre_parse.parse(p, flags)
|
|
--- modulename: sre_parse, funcname: parse
|
|
sre_parse.py(678): source = Tokenizer(str)
|
|
--- modulename: sre_parse, funcname: __init__
|
|
sre_parse.py(179): self.string = string
|
|
sre_parse.py(180): self.index = 0
|
|
sre_parse.py(181): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(680): if pattern is None:
|
|
sre_parse.py(681): pattern = Pattern()
|
|
--- modulename: sre_parse, funcname: __init__
|
|
sre_parse.py(68): self.flags = 0
|
|
sre_parse.py(69): self.open = []
|
|
sre_parse.py(70): self.groups = 1
|
|
sre_parse.py(71): self.groupdict = {}
|
|
sre_parse.py(682): pattern.flags = flags
|
|
sre_parse.py(683): pattern.str = str
|
|
sre_parse.py(685): p = _parse_sub(source, pattern, 0)
|
|
--- modulename: sre_parse, funcname: _parse_sub
|
|
sre_parse.py(304): items = []
|
|
sre_parse.py(305): itemsappend = items.append
|
|
sre_parse.py(306): sourcematch = source.match
|
|
sre_parse.py(307): while 1:
|
|
sre_parse.py(308): itemsappend(_parse(source, state))
|
|
--- modulename: sre_parse, funcname: _parse
|
|
sre_parse.py(381): subpattern = SubPattern(state)
|
|
--- modulename: sre_parse, funcname: __init__
|
|
sre_parse.py(91): self.pattern = pattern
|
|
sre_parse.py(92): if data is None:
|
|
sre_parse.py(93): data = []
|
|
sre_parse.py(94): self.data = data
|
|
sre_parse.py(95): self.width = None
|
|
sre_parse.py(384): subpatternappend = subpattern.append
|
|
sre_parse.py(385): sourceget = source.get
|
|
sre_parse.py(386): sourcematch = source.match
|
|
sre_parse.py(387): _len = len
|
|
sre_parse.py(388): PATTERNENDERS = _PATTERNENDERS
|
|
sre_parse.py(389): ASSERTCHARS = _ASSERTCHARS
|
|
sre_parse.py(390): LOOKBEHINDASSERTCHARS = _LOOKBEHINDASSERTCHARS
|
|
sre_parse.py(391): REPEATCODES = _REPEATCODES
|
|
sre_parse.py(393): while 1:
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(397): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(188): try:
|
|
sre_parse.py(189): c = self.string[self.index + 1]
|
|
sre_parse.py(192): char = char + c
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(398): if this is None:
|
|
sre_parse.py(401): if state.flags & SRE_FLAG_VERBOSE:
|
|
sre_parse.py(412): if this and this[0] not in SPECIAL_CHARS:
|
|
sre_parse.py(415): elif this == "[":
|
|
sre_parse.py(417): set = []
|
|
sre_parse.py(418): setappend = set.append
|
|
sre_parse.py(421): if sourcematch("^"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(424): start = set[:]
|
|
sre_parse.py(425): while 1:
|
|
sre_parse.py(426): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(427): if this == "]" and set != start:
|
|
sre_parse.py(429): elif this and this[0] == "\\":
|
|
sre_parse.py(430): code1 = _class_escape(source, this)
|
|
--- modulename: sre_parse, funcname: _class_escape
|
|
sre_parse.py(227): code = ESCAPES.get(escape)
|
|
sre_parse.py(228): if code:
|
|
sre_parse.py(230): code = CATEGORIES.get(escape)
|
|
sre_parse.py(231): if code and code[0] == IN:
|
|
sre_parse.py(233): try:
|
|
sre_parse.py(234): c = escape[1:2]
|
|
sre_parse.py(235): if c == "x":
|
|
sre_parse.py(237): while source.next in HEXDIGITS and len(escape) < 4:
|
|
sre_parse.py(238): escape = escape + source.get()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(237): while source.next in HEXDIGITS and len(escape) < 4:
|
|
sre_parse.py(238): escape = escape + source.get()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(237): while source.next in HEXDIGITS and len(escape) < 4:
|
|
sre_parse.py(239): escape = escape[2:]
|
|
sre_parse.py(240): if len(escape) != 2:
|
|
sre_parse.py(242): return LITERAL, int(escape, 16) & 0xff
|
|
sre_parse.py(435): if sourcematch("-"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(197): if skip:
|
|
sre_parse.py(198): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(188): try:
|
|
sre_parse.py(189): c = self.string[self.index + 1]
|
|
sre_parse.py(192): char = char + c
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(199): return 1
|
|
sre_parse.py(437): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(438): if this == "]":
|
|
sre_parse.py(444): elif this:
|
|
sre_parse.py(445): if this[0] == "\\":
|
|
sre_parse.py(446): code2 = _class_escape(source, this)
|
|
--- modulename: sre_parse, funcname: _class_escape
|
|
sre_parse.py(227): code = ESCAPES.get(escape)
|
|
sre_parse.py(228): if code:
|
|
sre_parse.py(230): code = CATEGORIES.get(escape)
|
|
sre_parse.py(231): if code and code[0] == IN:
|
|
sre_parse.py(233): try:
|
|
sre_parse.py(234): c = escape[1:2]
|
|
sre_parse.py(235): if c == "x":
|
|
sre_parse.py(237): while source.next in HEXDIGITS and len(escape) < 4:
|
|
sre_parse.py(238): escape = escape + source.get()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(237): while source.next in HEXDIGITS and len(escape) < 4:
|
|
sre_parse.py(238): escape = escape + source.get()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(188): try:
|
|
sre_parse.py(189): c = self.string[self.index + 1]
|
|
sre_parse.py(192): char = char + c
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(237): while source.next in HEXDIGITS and len(escape) < 4:
|
|
sre_parse.py(239): escape = escape[2:]
|
|
sre_parse.py(240): if len(escape) != 2:
|
|
sre_parse.py(242): return LITERAL, int(escape, 16) & 0xff
|
|
sre_parse.py(449): if code1[0] != LITERAL or code2[0] != LITERAL:
|
|
sre_parse.py(451): lo = code1[1]
|
|
sre_parse.py(452): hi = code2[1]
|
|
sre_parse.py(453): if hi < lo:
|
|
sre_parse.py(455): setappend((RANGE, (lo, hi)))
|
|
sre_parse.py(426): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(427): if this == "]" and set != start:
|
|
sre_parse.py(429): elif this and this[0] == "\\":
|
|
sre_parse.py(430): code1 = _class_escape(source, this)
|
|
--- modulename: sre_parse, funcname: _class_escape
|
|
sre_parse.py(227): code = ESCAPES.get(escape)
|
|
sre_parse.py(228): if code:
|
|
sre_parse.py(229): return code
|
|
sre_parse.py(435): if sourcematch("-"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(459): if code1[0] is IN:
|
|
sre_parse.py(461): setappend(code1)
|
|
sre_parse.py(426): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(188): try:
|
|
sre_parse.py(189): c = self.string[self.index + 1]
|
|
sre_parse.py(192): char = char + c
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(427): if this == "]" and set != start:
|
|
sre_parse.py(429): elif this and this[0] == "\\":
|
|
sre_parse.py(431): elif this:
|
|
sre_parse.py(432): code1 = LITERAL, ord(this)
|
|
sre_parse.py(435): if sourcematch("-"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(459): if code1[0] is IN:
|
|
sre_parse.py(461): setappend(code1)
|
|
sre_parse.py(426): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(188): try:
|
|
sre_parse.py(189): c = self.string[self.index + 1]
|
|
sre_parse.py(192): char = char + c
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(427): if this == "]" and set != start:
|
|
sre_parse.py(429): elif this and this[0] == "\\":
|
|
sre_parse.py(430): code1 = _class_escape(source, this)
|
|
--- modulename: sre_parse, funcname: _class_escape
|
|
sre_parse.py(227): code = ESCAPES.get(escape)
|
|
sre_parse.py(228): if code:
|
|
sre_parse.py(229): return code
|
|
sre_parse.py(435): if sourcematch("-"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(459): if code1[0] is IN:
|
|
sre_parse.py(461): setappend(code1)
|
|
sre_parse.py(426): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(188): try:
|
|
sre_parse.py(189): c = self.string[self.index + 1]
|
|
sre_parse.py(192): char = char + c
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(427): if this == "]" and set != start:
|
|
sre_parse.py(429): elif this and this[0] == "\\":
|
|
sre_parse.py(430): code1 = _class_escape(source, this)
|
|
--- modulename: sre_parse, funcname: _class_escape
|
|
sre_parse.py(227): code = ESCAPES.get(escape)
|
|
sre_parse.py(228): if code:
|
|
sre_parse.py(229): return code
|
|
sre_parse.py(435): if sourcematch("-"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(459): if code1[0] is IN:
|
|
sre_parse.py(461): setappend(code1)
|
|
sre_parse.py(426): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(188): try:
|
|
sre_parse.py(189): c = self.string[self.index + 1]
|
|
sre_parse.py(192): char = char + c
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(427): if this == "]" and set != start:
|
|
sre_parse.py(429): elif this and this[0] == "\\":
|
|
sre_parse.py(430): code1 = _class_escape(source, this)
|
|
--- modulename: sre_parse, funcname: _class_escape
|
|
sre_parse.py(227): code = ESCAPES.get(escape)
|
|
sre_parse.py(228): if code:
|
|
sre_parse.py(229): return code
|
|
sre_parse.py(435): if sourcematch("-"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(459): if code1[0] is IN:
|
|
sre_parse.py(461): setappend(code1)
|
|
sre_parse.py(426): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(188): try:
|
|
sre_parse.py(189): c = self.string[self.index + 1]
|
|
sre_parse.py(192): char = char + c
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(427): if this == "]" and set != start:
|
|
sre_parse.py(429): elif this and this[0] == "\\":
|
|
sre_parse.py(430): code1 = _class_escape(source, this)
|
|
--- modulename: sre_parse, funcname: _class_escape
|
|
sre_parse.py(227): code = ESCAPES.get(escape)
|
|
sre_parse.py(228): if code:
|
|
sre_parse.py(229): return code
|
|
sre_parse.py(435): if sourcematch("-"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(459): if code1[0] is IN:
|
|
sre_parse.py(461): setappend(code1)
|
|
sre_parse.py(426): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(427): if this == "]" and set != start:
|
|
sre_parse.py(429): elif this and this[0] == "\\":
|
|
sre_parse.py(430): code1 = _class_escape(source, this)
|
|
--- modulename: sre_parse, funcname: _class_escape
|
|
sre_parse.py(227): code = ESCAPES.get(escape)
|
|
sre_parse.py(228): if code:
|
|
sre_parse.py(229): return code
|
|
sre_parse.py(435): if sourcematch("-"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(459): if code1[0] is IN:
|
|
sre_parse.py(461): setappend(code1)
|
|
sre_parse.py(426): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(184): self.next = None
|
|
sre_parse.py(185): return
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(427): if this == "]" and set != start:
|
|
sre_parse.py(428): break
|
|
sre_parse.py(464): if _len(set)==1 and set[0][0] is LITERAL:
|
|
sre_parse.py(466): elif _len(set)==2 and set[0][0] is NEGATE and set[1][0] is LITERAL:
|
|
sre_parse.py(470): subpatternappend((IN, set))
|
|
--- modulename: sre_parse, funcname: append
|
|
sre_parse.py(139): self.data.append(code)
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(397): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(184): self.next = None
|
|
sre_parse.py(185): return
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(398): if this is None:
|
|
sre_parse.py(399): break # end of pattern
|
|
sre_parse.py(673): return subpattern
|
|
sre_parse.py(309): if sourcematch("|"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(311): if not nested:
|
|
sre_parse.py(312): break
|
|
sre_parse.py(318): if len(items) == 1:
|
|
sre_parse.py(319): return items[0]
|
|
sre_parse.py(687): tail = source.get()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(184): self.next = None
|
|
sre_parse.py(185): return
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(688): if tail == ")":
|
|
sre_parse.py(690): elif tail:
|
|
sre_parse.py(693): if flags & SRE_FLAG_DEBUG:
|
|
sre_parse.py(696): if not (flags & SRE_FLAG_VERBOSE) and p.pattern.flags & SRE_FLAG_VERBOSE:
|
|
sre_parse.py(701): return p
|
|
sre_compile.py(502): code = _code(p, flags)
|
|
--- modulename: sre_compile, funcname: _code
|
|
sre_compile.py(480): flags = p.pattern.flags | flags
|
|
sre_compile.py(481): code = []
|
|
sre_compile.py(484): _compile_info(code, p, flags)
|
|
--- modulename: sre_compile, funcname: _compile_info
|
|
sre_compile.py(363): lo, hi = pattern.getwidth()
|
|
--- modulename: sre_parse, funcname: getwidth
|
|
sre_parse.py(142): if self.width:
|
|
sre_parse.py(144): lo = hi = 0
|
|
sre_parse.py(145): UNITCODES = (ANY, RANGE, IN, LITERAL, NOT_LITERAL, CATEGORY)
|
|
sre_parse.py(146): REPEATCODES = (MIN_REPEAT, MAX_REPEAT)
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(148): if op is BRANCH:
|
|
sre_parse.py(157): elif op is CALL:
|
|
sre_parse.py(161): elif op is SUBPATTERN:
|
|
sre_parse.py(165): elif op in REPEATCODES:
|
|
sre_parse.py(169): elif op in UNITCODES:
|
|
sre_parse.py(170): lo = lo + 1
|
|
sre_parse.py(171): hi = hi + 1
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(174): self.width = min(lo, MAXREPEAT - 1), min(hi, MAXREPEAT)
|
|
sre_parse.py(175): return self.width
|
|
sre_compile.py(364): if lo == 0:
|
|
sre_compile.py(367): prefix = []
|
|
sre_compile.py(368): prefixappend = prefix.append
|
|
sre_compile.py(369): prefix_skip = 0
|
|
sre_compile.py(370): charset = [] # not used
|
|
sre_compile.py(371): charsetappend = charset.append
|
|
sre_compile.py(372): if not (flags & SRE_FLAG_IGNORECASE):
|
|
sre_compile.py(374): for op, av in pattern.data:
|
|
sre_compile.py(375): if op is LITERAL:
|
|
sre_compile.py(379): elif op is SUBPATTERN and len(av[1]) == 1:
|
|
sre_compile.py(386): break
|
|
sre_compile.py(388): if not prefix and pattern.data:
|
|
sre_compile.py(389): op, av = pattern.data[0]
|
|
sre_compile.py(390): if op is SUBPATTERN and av[1]:
|
|
sre_compile.py(407): elif op is BRANCH:
|
|
sre_compile.py(420): elif op is IN:
|
|
sre_compile.py(421): charset = av
|
|
sre_compile.py(427): emit = code.append
|
|
sre_compile.py(428): emit(OPCODES[INFO])
|
|
sre_compile.py(429): skip = len(code); emit(0)
|
|
sre_compile.py(431): mask = 0
|
|
sre_compile.py(432): if prefix:
|
|
sre_compile.py(436): elif charset:
|
|
sre_compile.py(437): mask = mask + SRE_INFO_CHARSET
|
|
sre_compile.py(438): emit(mask)
|
|
sre_compile.py(440): if lo < MAXCODE:
|
|
sre_compile.py(441): emit(lo)
|
|
sre_compile.py(445): if hi < MAXCODE:
|
|
sre_compile.py(446): emit(hi)
|
|
sre_compile.py(450): if prefix:
|
|
sre_compile.py(461): elif charset:
|
|
sre_compile.py(462): _compile_charset(charset, flags, code)
|
|
--- modulename: sre_compile, funcname: _compile_charset
|
|
sre_compile.py(180): emit = code.append
|
|
sre_compile.py(181): if fixup is None:
|
|
sre_compile.py(182): fixup = _identityfunction
|
|
sre_compile.py(183): for op, av in _optimize_charset(charset, fixup):
|
|
--- modulename: sre_compile, funcname: _optimize_charset
|
|
sre_compile.py(209): out = []
|
|
sre_compile.py(210): outappend = out.append
|
|
sre_compile.py(211): charmap = [0]*256
|
|
sre_compile.py(212): try:
|
|
sre_compile.py(213): for op, av in charset:
|
|
sre_compile.py(214): if op is NEGATE:
|
|
sre_compile.py(216): elif op is LITERAL:
|
|
sre_compile.py(218): elif op is RANGE:
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
--- modulename: sre_compile, funcname: _identityfunction
|
|
sre_compile.py(25): return x
|
|
--- modulename: sre_compile, funcname: _identityfunction
|
|
sre_compile.py(25): return x
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(213): for op, av in charset:
|
|
sre_compile.py(214): if op is NEGATE:
|
|
sre_compile.py(216): elif op is LITERAL:
|
|
sre_compile.py(217): charmap[fixup(av)] = 1
|
|
--- modulename: sre_compile, funcname: _identityfunction
|
|
sre_compile.py(25): return x
|
|
sre_compile.py(213): for op, av in charset:
|
|
sre_compile.py(214): if op is NEGATE:
|
|
sre_compile.py(216): elif op is LITERAL:
|
|
sre_compile.py(217): charmap[fixup(av)] = 1
|
|
--- modulename: sre_compile, funcname: _identityfunction
|
|
sre_compile.py(25): return x
|
|
sre_compile.py(213): for op, av in charset:
|
|
sre_compile.py(214): if op is NEGATE:
|
|
sre_compile.py(216): elif op is LITERAL:
|
|
sre_compile.py(217): charmap[fixup(av)] = 1
|
|
--- modulename: sre_compile, funcname: _identityfunction
|
|
sre_compile.py(25): return x
|
|
sre_compile.py(213): for op, av in charset:
|
|
sre_compile.py(214): if op is NEGATE:
|
|
sre_compile.py(216): elif op is LITERAL:
|
|
sre_compile.py(217): charmap[fixup(av)] = 1
|
|
--- modulename: sre_compile, funcname: _identityfunction
|
|
sre_compile.py(25): return x
|
|
sre_compile.py(213): for op, av in charset:
|
|
sre_compile.py(214): if op is NEGATE:
|
|
sre_compile.py(216): elif op is LITERAL:
|
|
sre_compile.py(217): charmap[fixup(av)] = 1
|
|
--- modulename: sre_compile, funcname: _identityfunction
|
|
sre_compile.py(25): return x
|
|
sre_compile.py(213): for op, av in charset:
|
|
sre_compile.py(214): if op is NEGATE:
|
|
sre_compile.py(216): elif op is LITERAL:
|
|
sre_compile.py(217): charmap[fixup(av)] = 1
|
|
--- modulename: sre_compile, funcname: _identityfunction
|
|
sre_compile.py(25): return x
|
|
sre_compile.py(213): for op, av in charset:
|
|
sre_compile.py(214): if op is NEGATE:
|
|
sre_compile.py(216): elif op is LITERAL:
|
|
sre_compile.py(217): charmap[fixup(av)] = 1
|
|
--- modulename: sre_compile, funcname: _identityfunction
|
|
sre_compile.py(25): return x
|
|
sre_compile.py(213): for op, av in charset:
|
|
sre_compile.py(228): i = p = n = 0
|
|
sre_compile.py(229): runs = []
|
|
sre_compile.py(230): runsappend = runs.append
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(234): p = i
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(237): runsappend((p, n))
|
|
sre_compile.py(238): n = 0
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(234): p = i
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(237): runsappend((p, n))
|
|
sre_compile.py(238): n = 0
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(234): p = i
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(237): runsappend((p, n))
|
|
sre_compile.py(238): n = 0
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(240): if n:
|
|
sre_compile.py(242): if len(runs) <= 2:
|
|
sre_compile.py(253): data = _mk_bitmap(charmap)
|
|
--- modulename: sre_compile, funcname: _mk_bitmap
|
|
sre_compile.py(259): data = []
|
|
sre_compile.py(260): dataappend = data.append
|
|
sre_compile.py(261): if _sre.CODESIZE == 2:
|
|
sre_compile.py(264): start = (1L, 0L)
|
|
sre_compile.py(265): m, v = start
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(271): dataappend(v)
|
|
sre_compile.py(272): m, v = start
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(271): dataappend(v)
|
|
sre_compile.py(272): m, v = start
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(271): dataappend(v)
|
|
sre_compile.py(272): m, v = start
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(271): dataappend(v)
|
|
sre_compile.py(272): m, v = start
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(271): dataappend(v)
|
|
sre_compile.py(272): m, v = start
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(271): dataappend(v)
|
|
sre_compile.py(272): m, v = start
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(271): dataappend(v)
|
|
sre_compile.py(272): m, v = start
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(271): dataappend(v)
|
|
sre_compile.py(272): m, v = start
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(273): return data
|
|
sre_compile.py(254): outappend((CHARSET, data))
|
|
sre_compile.py(255): return out
|
|
sre_compile.py(184): emit(OPCODES[op])
|
|
sre_compile.py(185): if op is NEGATE:
|
|
sre_compile.py(187): elif op is LITERAL:
|
|
sre_compile.py(189): elif op is RANGE:
|
|
sre_compile.py(192): elif op is CHARSET:
|
|
sre_compile.py(193): code.extend(av)
|
|
sre_compile.py(183): for op, av in _optimize_charset(charset, fixup):
|
|
sre_compile.py(205): emit(OPCODES[FAILURE])
|
|
sre_compile.py(463): code[skip] = len(code) - skip
|
|
sre_compile.py(487): _compile(code, p.data, flags)
|
|
--- modulename: sre_compile, funcname: _compile
|
|
sre_compile.py(34): emit = code.append
|
|
sre_compile.py(35): _len = len
|
|
sre_compile.py(36): LITERAL_CODES = _LITERAL_CODES
|
|
sre_compile.py(37): REPEATING_CODES = _REPEATING_CODES
|
|
sre_compile.py(38): SUCCESS_CODES = _SUCCESS_CODES
|
|
sre_compile.py(39): ASSERT_CODES = _ASSERT_CODES
|
|
sre_compile.py(40): for op, av in pattern:
|
|
sre_compile.py(41): if op in LITERAL_CODES:
|
|
sre_compile.py(48): elif op is IN:
|
|
sre_compile.py(49): if flags & SRE_FLAG_IGNORECASE:
|
|
sre_compile.py(54): emit(OPCODES[op])
|
|
sre_compile.py(55): fixup = _identityfunction
|
|
sre_compile.py(56): skip = _len(code); emit(0)
|
|
sre_compile.py(57): _compile_charset(av, flags, code, fixup)
|
|
--- modulename: sre_compile, funcname: _compile_charset
|
|
sre_compile.py(180): emit = code.append
|
|
sre_compile.py(181): if fixup is None:
|
|
sre_compile.py(183): for op, av in _optimize_charset(charset, fixup):
|
|
--- modulename: sre_compile, funcname: _optimize_charset
|
|
sre_compile.py(209): out = []
|
|
sre_compile.py(210): outappend = out.append
|
|
sre_compile.py(211): charmap = [0]*256
|
|
sre_compile.py(212): try:
|
|
sre_compile.py(213): for op, av in charset:
|
|
sre_compile.py(214): if op is NEGATE:
|
|
sre_compile.py(216): elif op is LITERAL:
|
|
sre_compile.py(218): elif op is RANGE:
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
--- modulename: sre_compile, funcname: _identityfunction
|
|
sre_compile.py(25): return x
|
|
--- modulename: sre_compile, funcname: _identityfunction
|
|
sre_compile.py(25): return x
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(213): for op, av in charset:
|
|
sre_compile.py(214): if op is NEGATE:
|
|
sre_compile.py(216): elif op is LITERAL:
|
|
sre_compile.py(217): charmap[fixup(av)] = 1
|
|
--- modulename: sre_compile, funcname: _identityfunction
|
|
sre_compile.py(25): return x
|
|
sre_compile.py(213): for op, av in charset:
|
|
sre_compile.py(214): if op is NEGATE:
|
|
sre_compile.py(216): elif op is LITERAL:
|
|
sre_compile.py(217): charmap[fixup(av)] = 1
|
|
--- modulename: sre_compile, funcname: _identityfunction
|
|
sre_compile.py(25): return x
|
|
sre_compile.py(213): for op, av in charset:
|
|
sre_compile.py(214): if op is NEGATE:
|
|
sre_compile.py(216): elif op is LITERAL:
|
|
sre_compile.py(217): charmap[fixup(av)] = 1
|
|
--- modulename: sre_compile, funcname: _identityfunction
|
|
sre_compile.py(25): return x
|
|
sre_compile.py(213): for op, av in charset:
|
|
sre_compile.py(214): if op is NEGATE:
|
|
sre_compile.py(216): elif op is LITERAL:
|
|
sre_compile.py(217): charmap[fixup(av)] = 1
|
|
--- modulename: sre_compile, funcname: _identityfunction
|
|
sre_compile.py(25): return x
|
|
sre_compile.py(213): for op, av in charset:
|
|
sre_compile.py(214): if op is NEGATE:
|
|
sre_compile.py(216): elif op is LITERAL:
|
|
sre_compile.py(217): charmap[fixup(av)] = 1
|
|
--- modulename: sre_compile, funcname: _identityfunction
|
|
sre_compile.py(25): return x
|
|
sre_compile.py(213): for op, av in charset:
|
|
sre_compile.py(214): if op is NEGATE:
|
|
sre_compile.py(216): elif op is LITERAL:
|
|
sre_compile.py(217): charmap[fixup(av)] = 1
|
|
--- modulename: sre_compile, funcname: _identityfunction
|
|
sre_compile.py(25): return x
|
|
sre_compile.py(213): for op, av in charset:
|
|
sre_compile.py(214): if op is NEGATE:
|
|
sre_compile.py(216): elif op is LITERAL:
|
|
sre_compile.py(217): charmap[fixup(av)] = 1
|
|
--- modulename: sre_compile, funcname: _identityfunction
|
|
sre_compile.py(25): return x
|
|
sre_compile.py(213): for op, av in charset:
|
|
sre_compile.py(228): i = p = n = 0
|
|
sre_compile.py(229): runs = []
|
|
sre_compile.py(230): runsappend = runs.append
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(234): p = i
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(237): runsappend((p, n))
|
|
sre_compile.py(238): n = 0
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(234): p = i
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(237): runsappend((p, n))
|
|
sre_compile.py(238): n = 0
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(234): p = i
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(237): runsappend((p, n))
|
|
sre_compile.py(238): n = 0
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(240): if n:
|
|
sre_compile.py(242): if len(runs) <= 2:
|
|
sre_compile.py(253): data = _mk_bitmap(charmap)
|
|
--- modulename: sre_compile, funcname: _mk_bitmap
|
|
sre_compile.py(259): data = []
|
|
sre_compile.py(260): dataappend = data.append
|
|
sre_compile.py(261): if _sre.CODESIZE == 2:
|
|
sre_compile.py(264): start = (1L, 0L)
|
|
sre_compile.py(265): m, v = start
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(271): dataappend(v)
|
|
sre_compile.py(272): m, v = start
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(271): dataappend(v)
|
|
sre_compile.py(272): m, v = start
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(268): v = v + m
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(271): dataappend(v)
|
|
sre_compile.py(272): m, v = start
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(271): dataappend(v)
|
|
sre_compile.py(272): m, v = start
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(271): dataappend(v)
|
|
sre_compile.py(272): m, v = start
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(271): dataappend(v)
|
|
sre_compile.py(272): m, v = start
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(271): dataappend(v)
|
|
sre_compile.py(272): m, v = start
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(267): if c:
|
|
sre_compile.py(269): m = m + m
|
|
sre_compile.py(270): if m > MAXCODE:
|
|
sre_compile.py(271): dataappend(v)
|
|
sre_compile.py(272): m, v = start
|
|
sre_compile.py(266): for c in bits:
|
|
sre_compile.py(273): return data
|
|
sre_compile.py(254): outappend((CHARSET, data))
|
|
sre_compile.py(255): return out
|
|
sre_compile.py(184): emit(OPCODES[op])
|
|
sre_compile.py(185): if op is NEGATE:
|
|
sre_compile.py(187): elif op is LITERAL:
|
|
sre_compile.py(189): elif op is RANGE:
|
|
sre_compile.py(192): elif op is CHARSET:
|
|
sre_compile.py(193): code.extend(av)
|
|
sre_compile.py(183): for op, av in _optimize_charset(charset, fixup):
|
|
sre_compile.py(205): emit(OPCODES[FAILURE])
|
|
sre_compile.py(58): code[skip] = _len(code) - skip
|
|
sre_compile.py(40): for op, av in pattern:
|
|
sre_compile.py(489): code.append(OPCODES[SUCCESS])
|
|
sre_compile.py(491): return code
|
|
sre_compile.py(507): if p.pattern.groups > 100:
|
|
sre_compile.py(513): groupindex = p.pattern.groupdict
|
|
sre_compile.py(514): indexgroup = [None] * p.pattern.groups
|
|
sre_compile.py(515): for k, i in groupindex.items():
|
|
sre_compile.py(518): return _sre.compile(
|
|
sre_compile.py(519): pattern, flags | p.pattern.flags, code,
|
|
sre_compile.py(520): p.pattern.groups-1,
|
|
sre_compile.py(521): groupindex, indexgroup
|
|
re.py(245): if not bypass_cache:
|
|
re.py(246): if len(_cache) >= _MAXCACHE:
|
|
re.py(248): _cache[cachekey] = p
|
|
re.py(249): return p
|
|
encoder.py(15): ESCAPE_ASCII = re.compile(r'([\\"]|[^\ -~])')
|
|
--- modulename: re, funcname: compile
|
|
re.py(190): return _compile(pattern, flags)
|
|
--- modulename: re, funcname: _compile
|
|
re.py(228): pattern, flags = key
|
|
re.py(229): bypass_cache = flags & DEBUG
|
|
re.py(230): if not bypass_cache:
|
|
re.py(231): cachekey = (type(key[0]),) + key
|
|
re.py(232): p = _cache.get(cachekey)
|
|
re.py(233): if p is not None:
|
|
re.py(235): if isinstance(pattern, _pattern_type):
|
|
re.py(239): if not sre_compile.isstring(pattern):
|
|
--- modulename: sre_compile, funcname: isstring
|
|
sre_compile.py(473): for tp in STRING_TYPES:
|
|
sre_compile.py(474): if isinstance(obj, tp):
|
|
sre_compile.py(475): return 1
|
|
re.py(241): try:
|
|
re.py(242): p = sre_compile.compile(pattern, flags)
|
|
--- modulename: sre_compile, funcname: compile
|
|
sre_compile.py(496): if isstring(p):
|
|
--- modulename: sre_compile, funcname: isstring
|
|
sre_compile.py(473): for tp in STRING_TYPES:
|
|
sre_compile.py(474): if isinstance(obj, tp):
|
|
sre_compile.py(475): return 1
|
|
sre_compile.py(497): pattern = p
|
|
sre_compile.py(498): p = sre_parse.parse(p, flags)
|
|
--- modulename: sre_parse, funcname: parse
|
|
sre_parse.py(678): source = Tokenizer(str)
|
|
--- modulename: sre_parse, funcname: __init__
|
|
sre_parse.py(179): self.string = string
|
|
sre_parse.py(180): self.index = 0
|
|
sre_parse.py(181): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(680): if pattern is None:
|
|
sre_parse.py(681): pattern = Pattern()
|
|
--- modulename: sre_parse, funcname: __init__
|
|
sre_parse.py(68): self.flags = 0
|
|
sre_parse.py(69): self.open = []
|
|
sre_parse.py(70): self.groups = 1
|
|
sre_parse.py(71): self.groupdict = {}
|
|
sre_parse.py(682): pattern.flags = flags
|
|
sre_parse.py(683): pattern.str = str
|
|
sre_parse.py(685): p = _parse_sub(source, pattern, 0)
|
|
--- modulename: sre_parse, funcname: _parse_sub
|
|
sre_parse.py(304): items = []
|
|
sre_parse.py(305): itemsappend = items.append
|
|
sre_parse.py(306): sourcematch = source.match
|
|
sre_parse.py(307): while 1:
|
|
sre_parse.py(308): itemsappend(_parse(source, state))
|
|
--- modulename: sre_parse, funcname: _parse
|
|
sre_parse.py(381): subpattern = SubPattern(state)
|
|
--- modulename: sre_parse, funcname: __init__
|
|
sre_parse.py(91): self.pattern = pattern
|
|
sre_parse.py(92): if data is None:
|
|
sre_parse.py(93): data = []
|
|
sre_parse.py(94): self.data = data
|
|
sre_parse.py(95): self.width = None
|
|
sre_parse.py(384): subpatternappend = subpattern.append
|
|
sre_parse.py(385): sourceget = source.get
|
|
sre_parse.py(386): sourcematch = source.match
|
|
sre_parse.py(387): _len = len
|
|
sre_parse.py(388): PATTERNENDERS = _PATTERNENDERS
|
|
sre_parse.py(389): ASSERTCHARS = _ASSERTCHARS
|
|
sre_parse.py(390): LOOKBEHINDASSERTCHARS = _LOOKBEHINDASSERTCHARS
|
|
sre_parse.py(391): REPEATCODES = _REPEATCODES
|
|
sre_parse.py(393): while 1:
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(397): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(398): if this is None:
|
|
sre_parse.py(401): if state.flags & SRE_FLAG_VERBOSE:
|
|
sre_parse.py(412): if this and this[0] not in SPECIAL_CHARS:
|
|
sre_parse.py(415): elif this == "[":
|
|
sre_parse.py(472): elif this and this[0] in REPEAT_CHARS:
|
|
sre_parse.py(525): elif this == ".":
|
|
sre_parse.py(528): elif this == "(":
|
|
sre_parse.py(529): group = 1
|
|
sre_parse.py(530): name = None
|
|
sre_parse.py(531): condgroup = None
|
|
sre_parse.py(532): if sourcematch("?"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(635): if group:
|
|
sre_parse.py(637): if group == 2:
|
|
sre_parse.py(641): group = state.opengroup(name)
|
|
--- modulename: sre_parse, funcname: opengroup
|
|
sre_parse.py(73): gid = self.groups
|
|
sre_parse.py(74): self.groups = gid + 1
|
|
sre_parse.py(75): if name is not None:
|
|
sre_parse.py(81): self.open.append(gid)
|
|
sre_parse.py(82): return gid
|
|
sre_parse.py(642): if condgroup:
|
|
sre_parse.py(645): p = _parse_sub(source, state)
|
|
--- modulename: sre_parse, funcname: _parse_sub
|
|
sre_parse.py(304): items = []
|
|
sre_parse.py(305): itemsappend = items.append
|
|
sre_parse.py(306): sourcematch = source.match
|
|
sre_parse.py(307): while 1:
|
|
sre_parse.py(308): itemsappend(_parse(source, state))
|
|
--- modulename: sre_parse, funcname: _parse
|
|
sre_parse.py(381): subpattern = SubPattern(state)
|
|
--- modulename: sre_parse, funcname: __init__
|
|
sre_parse.py(91): self.pattern = pattern
|
|
sre_parse.py(92): if data is None:
|
|
sre_parse.py(93): data = []
|
|
sre_parse.py(94): self.data = data
|
|
sre_parse.py(95): self.width = None
|
|
sre_parse.py(384): subpatternappend = subpattern.append
|
|
sre_parse.py(385): sourceget = source.get
|
|
sre_parse.py(386): sourcematch = source.match
|
|
sre_parse.py(387): _len = len
|
|
sre_parse.py(388): PATTERNENDERS = _PATTERNENDERS
|
|
sre_parse.py(389): ASSERTCHARS = _ASSERTCHARS
|
|
sre_parse.py(390): LOOKBEHINDASSERTCHARS = _LOOKBEHINDASSERTCHARS
|
|
sre_parse.py(391): REPEATCODES = _REPEATCODES
|
|
sre_parse.py(393): while 1:
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(397): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(188): try:
|
|
sre_parse.py(189): c = self.string[self.index + 1]
|
|
sre_parse.py(192): char = char + c
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(398): if this is None:
|
|
sre_parse.py(401): if state.flags & SRE_FLAG_VERBOSE:
|
|
sre_parse.py(412): if this and this[0] not in SPECIAL_CHARS:
|
|
sre_parse.py(415): elif this == "[":
|
|
sre_parse.py(417): set = []
|
|
sre_parse.py(418): setappend = set.append
|
|
sre_parse.py(421): if sourcematch("^"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(424): start = set[:]
|
|
sre_parse.py(425): while 1:
|
|
sre_parse.py(426): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(427): if this == "]" and set != start:
|
|
sre_parse.py(429): elif this and this[0] == "\\":
|
|
sre_parse.py(430): code1 = _class_escape(source, this)
|
|
--- modulename: sre_parse, funcname: _class_escape
|
|
sre_parse.py(227): code = ESCAPES.get(escape)
|
|
sre_parse.py(228): if code:
|
|
sre_parse.py(229): return code
|
|
sre_parse.py(435): if sourcematch("-"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(459): if code1[0] is IN:
|
|
sre_parse.py(461): setappend(code1)
|
|
sre_parse.py(426): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(427): if this == "]" and set != start:
|
|
sre_parse.py(429): elif this and this[0] == "\\":
|
|
sre_parse.py(431): elif this:
|
|
sre_parse.py(432): code1 = LITERAL, ord(this)
|
|
sre_parse.py(435): if sourcematch("-"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(459): if code1[0] is IN:
|
|
sre_parse.py(461): setappend(code1)
|
|
sre_parse.py(426): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(427): if this == "]" and set != start:
|
|
sre_parse.py(428): break
|
|
sre_parse.py(464): if _len(set)==1 and set[0][0] is LITERAL:
|
|
sre_parse.py(466): elif _len(set)==2 and set[0][0] is NEGATE and set[1][0] is LITERAL:
|
|
sre_parse.py(470): subpatternappend((IN, set))
|
|
--- modulename: sre_parse, funcname: append
|
|
sre_parse.py(139): self.data.append(code)
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(396): break # end of subpattern
|
|
sre_parse.py(673): return subpattern
|
|
sre_parse.py(309): if sourcematch("|"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(197): if skip:
|
|
sre_parse.py(198): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(199): return 1
|
|
sre_parse.py(310): continue
|
|
sre_parse.py(308): itemsappend(_parse(source, state))
|
|
--- modulename: sre_parse, funcname: _parse
|
|
sre_parse.py(381): subpattern = SubPattern(state)
|
|
--- modulename: sre_parse, funcname: __init__
|
|
sre_parse.py(91): self.pattern = pattern
|
|
sre_parse.py(92): if data is None:
|
|
sre_parse.py(93): data = []
|
|
sre_parse.py(94): self.data = data
|
|
sre_parse.py(95): self.width = None
|
|
sre_parse.py(384): subpatternappend = subpattern.append
|
|
sre_parse.py(385): sourceget = source.get
|
|
sre_parse.py(386): sourcematch = source.match
|
|
sre_parse.py(387): _len = len
|
|
sre_parse.py(388): PATTERNENDERS = _PATTERNENDERS
|
|
sre_parse.py(389): ASSERTCHARS = _ASSERTCHARS
|
|
sre_parse.py(390): LOOKBEHINDASSERTCHARS = _LOOKBEHINDASSERTCHARS
|
|
sre_parse.py(391): REPEATCODES = _REPEATCODES
|
|
sre_parse.py(393): while 1:
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(397): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(398): if this is None:
|
|
sre_parse.py(401): if state.flags & SRE_FLAG_VERBOSE:
|
|
sre_parse.py(412): if this and this[0] not in SPECIAL_CHARS:
|
|
sre_parse.py(415): elif this == "[":
|
|
sre_parse.py(417): set = []
|
|
sre_parse.py(418): setappend = set.append
|
|
sre_parse.py(421): if sourcematch("^"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(197): if skip:
|
|
sre_parse.py(198): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(188): try:
|
|
sre_parse.py(189): c = self.string[self.index + 1]
|
|
sre_parse.py(192): char = char + c
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(199): return 1
|
|
sre_parse.py(422): setappend((NEGATE, None))
|
|
sre_parse.py(424): start = set[:]
|
|
sre_parse.py(425): while 1:
|
|
sre_parse.py(426): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(427): if this == "]" and set != start:
|
|
sre_parse.py(429): elif this and this[0] == "\\":
|
|
sre_parse.py(430): code1 = _class_escape(source, this)
|
|
--- modulename: sre_parse, funcname: _class_escape
|
|
sre_parse.py(227): code = ESCAPES.get(escape)
|
|
sre_parse.py(228): if code:
|
|
sre_parse.py(230): code = CATEGORIES.get(escape)
|
|
sre_parse.py(231): if code and code[0] == IN:
|
|
sre_parse.py(233): try:
|
|
sre_parse.py(234): c = escape[1:2]
|
|
sre_parse.py(235): if c == "x":
|
|
sre_parse.py(243): elif c in OCTDIGITS:
|
|
sre_parse.py(249): elif c in DIGITS:
|
|
sre_parse.py(251): if len(escape) == 2:
|
|
sre_parse.py(252): return LITERAL, ord(escape[1])
|
|
sre_parse.py(435): if sourcematch("-"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(197): if skip:
|
|
sre_parse.py(198): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(199): return 1
|
|
sre_parse.py(437): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(438): if this == "]":
|
|
sre_parse.py(444): elif this:
|
|
sre_parse.py(445): if this[0] == "\\":
|
|
sre_parse.py(448): code2 = LITERAL, ord(this)
|
|
sre_parse.py(449): if code1[0] != LITERAL or code2[0] != LITERAL:
|
|
sre_parse.py(451): lo = code1[1]
|
|
sre_parse.py(452): hi = code2[1]
|
|
sre_parse.py(453): if hi < lo:
|
|
sre_parse.py(455): setappend((RANGE, (lo, hi)))
|
|
sre_parse.py(426): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(427): if this == "]" and set != start:
|
|
sre_parse.py(428): break
|
|
sre_parse.py(464): if _len(set)==1 and set[0][0] is LITERAL:
|
|
sre_parse.py(466): elif _len(set)==2 and set[0][0] is NEGATE and set[1][0] is LITERAL:
|
|
sre_parse.py(470): subpatternappend((IN, set))
|
|
--- modulename: sre_parse, funcname: append
|
|
sre_parse.py(139): self.data.append(code)
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(396): break # end of subpattern
|
|
sre_parse.py(673): return subpattern
|
|
sre_parse.py(309): if sourcematch("|"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(311): if not nested:
|
|
sre_parse.py(313): if not source.next or sourcematch(")", 0):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(197): if skip:
|
|
sre_parse.py(199): return 1
|
|
sre_parse.py(314): break
|
|
sre_parse.py(318): if len(items) == 1:
|
|
sre_parse.py(321): subpattern = SubPattern(state)
|
|
--- modulename: sre_parse, funcname: __init__
|
|
sre_parse.py(91): self.pattern = pattern
|
|
sre_parse.py(92): if data is None:
|
|
sre_parse.py(93): data = []
|
|
sre_parse.py(94): self.data = data
|
|
sre_parse.py(95): self.width = None
|
|
sre_parse.py(322): subpatternappend = subpattern.append
|
|
sre_parse.py(325): while 1:
|
|
sre_parse.py(326): prefix = None
|
|
sre_parse.py(327): for item in items:
|
|
sre_parse.py(328): if not item:
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
sre_parse.py(330): if prefix is None:
|
|
sre_parse.py(331): prefix = item[0]
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_parse.py(327): for item in items:
|
|
sre_parse.py(328): if not item:
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
sre_parse.py(330): if prefix is None:
|
|
sre_parse.py(332): elif item[0] != prefix:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_parse.py(333): break
|
|
sre_parse.py(341): break
|
|
sre_parse.py(344): for item in items:
|
|
sre_parse.py(345): if len(item) != 1 or item[0][0] != LITERAL:
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_parse.py(346): break
|
|
sre_parse.py(357): subpattern.append((BRANCH, (None, items)))
|
|
--- modulename: sre_parse, funcname: append
|
|
sre_parse.py(139): self.data.append(code)
|
|
sre_parse.py(358): return subpattern
|
|
sre_parse.py(646): if not sourcematch(")"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(197): if skip:
|
|
sre_parse.py(198): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(184): self.next = None
|
|
sre_parse.py(185): return
|
|
sre_parse.py(199): return 1
|
|
sre_parse.py(648): if group is not None:
|
|
sre_parse.py(649): state.closegroup(group)
|
|
--- modulename: sre_parse, funcname: closegroup
|
|
sre_parse.py(84): self.open.remove(gid)
|
|
sre_parse.py(650): subpatternappend((SUBPATTERN, (group, p)))
|
|
--- modulename: sre_parse, funcname: append
|
|
sre_parse.py(139): self.data.append(code)
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(397): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(184): self.next = None
|
|
sre_parse.py(185): return
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(398): if this is None:
|
|
sre_parse.py(399): break # end of pattern
|
|
sre_parse.py(673): return subpattern
|
|
sre_parse.py(309): if sourcematch("|"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(311): if not nested:
|
|
sre_parse.py(312): break
|
|
sre_parse.py(318): if len(items) == 1:
|
|
sre_parse.py(319): return items[0]
|
|
sre_parse.py(687): tail = source.get()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(184): self.next = None
|
|
sre_parse.py(185): return
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(688): if tail == ")":
|
|
sre_parse.py(690): elif tail:
|
|
sre_parse.py(693): if flags & SRE_FLAG_DEBUG:
|
|
sre_parse.py(696): if not (flags & SRE_FLAG_VERBOSE) and p.pattern.flags & SRE_FLAG_VERBOSE:
|
|
sre_parse.py(701): return p
|
|
sre_compile.py(502): code = _code(p, flags)
|
|
--- modulename: sre_compile, funcname: _code
|
|
sre_compile.py(480): flags = p.pattern.flags | flags
|
|
sre_compile.py(481): code = []
|
|
sre_compile.py(484): _compile_info(code, p, flags)
|
|
--- modulename: sre_compile, funcname: _compile_info
|
|
sre_compile.py(363): lo, hi = pattern.getwidth()
|
|
--- modulename: sre_parse, funcname: getwidth
|
|
sre_parse.py(142): if self.width:
|
|
sre_parse.py(144): lo = hi = 0
|
|
sre_parse.py(145): UNITCODES = (ANY, RANGE, IN, LITERAL, NOT_LITERAL, CATEGORY)
|
|
sre_parse.py(146): REPEATCODES = (MIN_REPEAT, MAX_REPEAT)
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(148): if op is BRANCH:
|
|
sre_parse.py(157): elif op is CALL:
|
|
sre_parse.py(161): elif op is SUBPATTERN:
|
|
sre_parse.py(162): i, j = av[1].getwidth()
|
|
--- modulename: sre_parse, funcname: getwidth
|
|
sre_parse.py(142): if self.width:
|
|
sre_parse.py(144): lo = hi = 0
|
|
sre_parse.py(145): UNITCODES = (ANY, RANGE, IN, LITERAL, NOT_LITERAL, CATEGORY)
|
|
sre_parse.py(146): REPEATCODES = (MIN_REPEAT, MAX_REPEAT)
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(148): if op is BRANCH:
|
|
sre_parse.py(149): i = MAXREPEAT - 1
|
|
sre_parse.py(150): j = 0
|
|
sre_parse.py(151): for av in av[1]:
|
|
sre_parse.py(152): l, h = av.getwidth()
|
|
--- modulename: sre_parse, funcname: getwidth
|
|
sre_parse.py(142): if self.width:
|
|
sre_parse.py(144): lo = hi = 0
|
|
sre_parse.py(145): UNITCODES = (ANY, RANGE, IN, LITERAL, NOT_LITERAL, CATEGORY)
|
|
sre_parse.py(146): REPEATCODES = (MIN_REPEAT, MAX_REPEAT)
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(148): if op is BRANCH:
|
|
sre_parse.py(157): elif op is CALL:
|
|
sre_parse.py(161): elif op is SUBPATTERN:
|
|
sre_parse.py(165): elif op in REPEATCODES:
|
|
sre_parse.py(169): elif op in UNITCODES:
|
|
sre_parse.py(170): lo = lo + 1
|
|
sre_parse.py(171): hi = hi + 1
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(174): self.width = min(lo, MAXREPEAT - 1), min(hi, MAXREPEAT)
|
|
sre_parse.py(175): return self.width
|
|
sre_parse.py(153): i = min(i, l)
|
|
sre_parse.py(154): j = max(j, h)
|
|
sre_parse.py(151): for av in av[1]:
|
|
sre_parse.py(152): l, h = av.getwidth()
|
|
--- modulename: sre_parse, funcname: getwidth
|
|
sre_parse.py(142): if self.width:
|
|
sre_parse.py(144): lo = hi = 0
|
|
sre_parse.py(145): UNITCODES = (ANY, RANGE, IN, LITERAL, NOT_LITERAL, CATEGORY)
|
|
sre_parse.py(146): REPEATCODES = (MIN_REPEAT, MAX_REPEAT)
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(148): if op is BRANCH:
|
|
sre_parse.py(157): elif op is CALL:
|
|
sre_parse.py(161): elif op is SUBPATTERN:
|
|
sre_parse.py(165): elif op in REPEATCODES:
|
|
sre_parse.py(169): elif op in UNITCODES:
|
|
sre_parse.py(170): lo = lo + 1
|
|
sre_parse.py(171): hi = hi + 1
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(174): self.width = min(lo, MAXREPEAT - 1), min(hi, MAXREPEAT)
|
|
sre_parse.py(175): return self.width
|
|
sre_parse.py(153): i = min(i, l)
|
|
sre_parse.py(154): j = max(j, h)
|
|
sre_parse.py(151): for av in av[1]:
|
|
sre_parse.py(155): lo = lo + i
|
|
sre_parse.py(156): hi = hi + j
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(174): self.width = min(lo, MAXREPEAT - 1), min(hi, MAXREPEAT)
|
|
sre_parse.py(175): return self.width
|
|
sre_parse.py(163): lo = lo + i
|
|
sre_parse.py(164): hi = hi + j
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(174): self.width = min(lo, MAXREPEAT - 1), min(hi, MAXREPEAT)
|
|
sre_parse.py(175): return self.width
|
|
sre_compile.py(364): if lo == 0:
|
|
sre_compile.py(367): prefix = []
|
|
sre_compile.py(368): prefixappend = prefix.append
|
|
sre_compile.py(369): prefix_skip = 0
|
|
sre_compile.py(370): charset = [] # not used
|
|
sre_compile.py(371): charsetappend = charset.append
|
|
sre_compile.py(372): if not (flags & SRE_FLAG_IGNORECASE):
|
|
sre_compile.py(374): for op, av in pattern.data:
|
|
sre_compile.py(375): if op is LITERAL:
|
|
sre_compile.py(379): elif op is SUBPATTERN and len(av[1]) == 1:
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
sre_compile.py(380): op, av = av[1][0]
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(381): if op is LITERAL:
|
|
sre_compile.py(384): break
|
|
sre_compile.py(388): if not prefix and pattern.data:
|
|
sre_compile.py(389): op, av = pattern.data[0]
|
|
sre_compile.py(390): if op is SUBPATTERN and av[1]:
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
sre_compile.py(391): op, av = av[1][0]
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(392): if op is LITERAL:
|
|
sre_compile.py(394): elif op is BRANCH:
|
|
sre_compile.py(395): c = []
|
|
sre_compile.py(396): cappend = c.append
|
|
sre_compile.py(397): for p in av[1]:
|
|
sre_compile.py(398): if not p:
|
|
--- modulename: sre_parse, funcname: __len__
|
|
sre_parse.py(127): return len(self.data)
|
|
sre_compile.py(400): op, av = p[0]
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(401): if op is LITERAL:
|
|
sre_compile.py(404): break
|
|
sre_compile.py(427): emit = code.append
|
|
sre_compile.py(428): emit(OPCODES[INFO])
|
|
sre_compile.py(429): skip = len(code); emit(0)
|
|
sre_compile.py(431): mask = 0
|
|
sre_compile.py(432): if prefix:
|
|
sre_compile.py(436): elif charset:
|
|
sre_compile.py(438): emit(mask)
|
|
sre_compile.py(440): if lo < MAXCODE:
|
|
sre_compile.py(441): emit(lo)
|
|
sre_compile.py(445): if hi < MAXCODE:
|
|
sre_compile.py(446): emit(hi)
|
|
sre_compile.py(450): if prefix:
|
|
sre_compile.py(461): elif charset:
|
|
sre_compile.py(463): code[skip] = len(code) - skip
|
|
sre_compile.py(487): _compile(code, p.data, flags)
|
|
--- modulename: sre_compile, funcname: _compile
|
|
sre_compile.py(34): emit = code.append
|
|
sre_compile.py(35): _len = len
|
|
sre_compile.py(36): LITERAL_CODES = _LITERAL_CODES
|
|
sre_compile.py(37): REPEATING_CODES = _REPEATING_CODES
|
|
sre_compile.py(38): SUCCESS_CODES = _SUCCESS_CODES
|
|
sre_compile.py(39): ASSERT_CODES = _ASSERT_CODES
|
|
sre_compile.py(40): for op, av in pattern:
|
|
sre_compile.py(41): if op in LITERAL_CODES:
|
|
sre_compile.py(48): elif op is IN:
|
|
sre_compile.py(59): elif op is ANY:
|
|
sre_compile.py(64): elif op in REPEATING_CODES:
|
|
sre_compile.py(96): elif op is SUBPATTERN:
|
|
sre_compile.py(97): if av[0]:
|
|
sre_compile.py(98): emit(OPCODES[MARK])
|
|
sre_compile.py(99): emit((av[0]-1)*2)
|
|
sre_compile.py(101): _compile(code, av[1], flags)
|
|
--- modulename: sre_compile, funcname: _compile
|
|
sre_compile.py(34): emit = code.append
|
|
sre_compile.py(35): _len = len
|
|
sre_compile.py(36): LITERAL_CODES = _LITERAL_CODES
|
|
sre_compile.py(37): REPEATING_CODES = _REPEATING_CODES
|
|
sre_compile.py(38): SUCCESS_CODES = _SUCCESS_CODES
|
|
sre_compile.py(39): ASSERT_CODES = _ASSERT_CODES
|
|
sre_compile.py(40): for op, av in pattern:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(41): if op in LITERAL_CODES:
|
|
sre_compile.py(48): elif op is IN:
|
|
sre_compile.py(59): elif op is ANY:
|
|
sre_compile.py(64): elif op in REPEATING_CODES:
|
|
sre_compile.py(96): elif op is SUBPATTERN:
|
|
sre_compile.py(105): elif op in SUCCESS_CODES:
|
|
sre_compile.py(107): elif op in ASSERT_CODES:
|
|
sre_compile.py(120): elif op is CALL:
|
|
sre_compile.py(126): elif op is AT:
|
|
sre_compile.py(135): elif op is BRANCH:
|
|
sre_compile.py(136): emit(OPCODES[op])
|
|
sre_compile.py(137): tail = []
|
|
sre_compile.py(138): tailappend = tail.append
|
|
sre_compile.py(139): for av in av[1]:
|
|
sre_compile.py(140): skip = _len(code); emit(0)
|
|
sre_compile.py(142): _compile(code, av, flags)
|
|
--- modulename: sre_compile, funcname: _compile
|
|
sre_compile.py(34): emit = code.append
|
|
sre_compile.py(35): _len = len
|
|
sre_compile.py(36): LITERAL_CODES = _LITERAL_CODES
|
|
sre_compile.py(37): REPEATING_CODES = _REPEATING_CODES
|
|
sre_compile.py(38): SUCCESS_CODES = _SUCCESS_CODES
|
|
sre_compile.py(39): ASSERT_CODES = _ASSERT_CODES
|
|
sre_compile.py(40): for op, av in pattern:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(41): if op in LITERAL_CODES:
|
|
sre_compile.py(48): elif op is IN:
|
|
sre_compile.py(49): if flags & SRE_FLAG_IGNORECASE:
|
|
sre_compile.py(54): emit(OPCODES[op])
|
|
sre_compile.py(55): fixup = _identityfunction
|
|
sre_compile.py(56): skip = _len(code); emit(0)
|
|
sre_compile.py(57): _compile_charset(av, flags, code, fixup)
|
|
--- modulename: sre_compile, funcname: _compile_charset
|
|
sre_compile.py(180): emit = code.append
|
|
sre_compile.py(181): if fixup is None:
|
|
sre_compile.py(183): for op, av in _optimize_charset(charset, fixup):
|
|
--- modulename: sre_compile, funcname: _optimize_charset
|
|
sre_compile.py(209): out = []
|
|
sre_compile.py(210): outappend = out.append
|
|
sre_compile.py(211): charmap = [0]*256
|
|
sre_compile.py(212): try:
|
|
sre_compile.py(213): for op, av in charset:
|
|
sre_compile.py(214): if op is NEGATE:
|
|
sre_compile.py(216): elif op is LITERAL:
|
|
sre_compile.py(217): charmap[fixup(av)] = 1
|
|
--- modulename: sre_compile, funcname: _identityfunction
|
|
sre_compile.py(25): return x
|
|
sre_compile.py(213): for op, av in charset:
|
|
sre_compile.py(214): if op is NEGATE:
|
|
sre_compile.py(216): elif op is LITERAL:
|
|
sre_compile.py(217): charmap[fixup(av)] = 1
|
|
--- modulename: sre_compile, funcname: _identityfunction
|
|
sre_compile.py(25): return x
|
|
sre_compile.py(213): for op, av in charset:
|
|
sre_compile.py(228): i = p = n = 0
|
|
sre_compile.py(229): runs = []
|
|
sre_compile.py(230): runsappend = runs.append
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(234): p = i
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(237): runsappend((p, n))
|
|
sre_compile.py(238): n = 0
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(234): p = i
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(237): runsappend((p, n))
|
|
sre_compile.py(238): n = 0
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(240): if n:
|
|
sre_compile.py(242): if len(runs) <= 2:
|
|
sre_compile.py(244): for p, n in runs:
|
|
sre_compile.py(245): if n == 1:
|
|
sre_compile.py(246): outappend((LITERAL, p))
|
|
sre_compile.py(244): for p, n in runs:
|
|
sre_compile.py(245): if n == 1:
|
|
sre_compile.py(246): outappend((LITERAL, p))
|
|
sre_compile.py(244): for p, n in runs:
|
|
sre_compile.py(249): if len(out) < len(charset):
|
|
sre_compile.py(256): return charset
|
|
sre_compile.py(184): emit(OPCODES[op])
|
|
sre_compile.py(185): if op is NEGATE:
|
|
sre_compile.py(187): elif op is LITERAL:
|
|
sre_compile.py(188): emit(fixup(av))
|
|
--- modulename: sre_compile, funcname: _identityfunction
|
|
sre_compile.py(25): return x
|
|
sre_compile.py(183): for op, av in _optimize_charset(charset, fixup):
|
|
sre_compile.py(184): emit(OPCODES[op])
|
|
sre_compile.py(185): if op is NEGATE:
|
|
sre_compile.py(187): elif op is LITERAL:
|
|
sre_compile.py(188): emit(fixup(av))
|
|
--- modulename: sre_compile, funcname: _identityfunction
|
|
sre_compile.py(25): return x
|
|
sre_compile.py(183): for op, av in _optimize_charset(charset, fixup):
|
|
sre_compile.py(205): emit(OPCODES[FAILURE])
|
|
sre_compile.py(58): code[skip] = _len(code) - skip
|
|
sre_compile.py(40): for op, av in pattern:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(143): emit(OPCODES[JUMP])
|
|
sre_compile.py(144): tailappend(_len(code)); emit(0)
|
|
sre_compile.py(145): code[skip] = _len(code) - skip
|
|
sre_compile.py(139): for av in av[1]:
|
|
sre_compile.py(140): skip = _len(code); emit(0)
|
|
sre_compile.py(142): _compile(code, av, flags)
|
|
--- modulename: sre_compile, funcname: _compile
|
|
sre_compile.py(34): emit = code.append
|
|
sre_compile.py(35): _len = len
|
|
sre_compile.py(36): LITERAL_CODES = _LITERAL_CODES
|
|
sre_compile.py(37): REPEATING_CODES = _REPEATING_CODES
|
|
sre_compile.py(38): SUCCESS_CODES = _SUCCESS_CODES
|
|
sre_compile.py(39): ASSERT_CODES = _ASSERT_CODES
|
|
sre_compile.py(40): for op, av in pattern:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(41): if op in LITERAL_CODES:
|
|
sre_compile.py(48): elif op is IN:
|
|
sre_compile.py(49): if flags & SRE_FLAG_IGNORECASE:
|
|
sre_compile.py(54): emit(OPCODES[op])
|
|
sre_compile.py(55): fixup = _identityfunction
|
|
sre_compile.py(56): skip = _len(code); emit(0)
|
|
sre_compile.py(57): _compile_charset(av, flags, code, fixup)
|
|
--- modulename: sre_compile, funcname: _compile_charset
|
|
sre_compile.py(180): emit = code.append
|
|
sre_compile.py(181): if fixup is None:
|
|
sre_compile.py(183): for op, av in _optimize_charset(charset, fixup):
|
|
--- modulename: sre_compile, funcname: _optimize_charset
|
|
sre_compile.py(209): out = []
|
|
sre_compile.py(210): outappend = out.append
|
|
sre_compile.py(211): charmap = [0]*256
|
|
sre_compile.py(212): try:
|
|
sre_compile.py(213): for op, av in charset:
|
|
sre_compile.py(214): if op is NEGATE:
|
|
sre_compile.py(215): outappend((op, av))
|
|
sre_compile.py(213): for op, av in charset:
|
|
sre_compile.py(214): if op is NEGATE:
|
|
sre_compile.py(216): elif op is LITERAL:
|
|
sre_compile.py(218): elif op is RANGE:
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
--- modulename: sre_compile, funcname: _identityfunction
|
|
sre_compile.py(25): return x
|
|
--- modulename: sre_compile, funcname: _identityfunction
|
|
sre_compile.py(25): return x
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(213): for op, av in charset:
|
|
sre_compile.py(228): i = p = n = 0
|
|
sre_compile.py(229): runs = []
|
|
sre_compile.py(230): runsappend = runs.append
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(234): p = i
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(237): runsappend((p, n))
|
|
sre_compile.py(238): n = 0
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(240): if n:
|
|
sre_compile.py(242): if len(runs) <= 2:
|
|
sre_compile.py(244): for p, n in runs:
|
|
sre_compile.py(245): if n == 1:
|
|
sre_compile.py(248): outappend((RANGE, (p, p+n-1)))
|
|
sre_compile.py(244): for p, n in runs:
|
|
sre_compile.py(249): if len(out) < len(charset):
|
|
sre_compile.py(256): return charset
|
|
sre_compile.py(184): emit(OPCODES[op])
|
|
sre_compile.py(185): if op is NEGATE:
|
|
sre_compile.py(186): pass
|
|
sre_compile.py(183): for op, av in _optimize_charset(charset, fixup):
|
|
sre_compile.py(184): emit(OPCODES[op])
|
|
sre_compile.py(185): if op is NEGATE:
|
|
sre_compile.py(187): elif op is LITERAL:
|
|
sre_compile.py(189): elif op is RANGE:
|
|
sre_compile.py(190): emit(fixup(av[0]))
|
|
--- modulename: sre_compile, funcname: _identityfunction
|
|
sre_compile.py(25): return x
|
|
sre_compile.py(191): emit(fixup(av[1]))
|
|
--- modulename: sre_compile, funcname: _identityfunction
|
|
sre_compile.py(25): return x
|
|
sre_compile.py(183): for op, av in _optimize_charset(charset, fixup):
|
|
sre_compile.py(205): emit(OPCODES[FAILURE])
|
|
sre_compile.py(58): code[skip] = _len(code) - skip
|
|
sre_compile.py(40): for op, av in pattern:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(143): emit(OPCODES[JUMP])
|
|
sre_compile.py(144): tailappend(_len(code)); emit(0)
|
|
sre_compile.py(145): code[skip] = _len(code) - skip
|
|
sre_compile.py(139): for av in av[1]:
|
|
sre_compile.py(146): emit(0) # end of branch
|
|
sre_compile.py(147): for tail in tail:
|
|
sre_compile.py(148): code[tail] = _len(code) - tail
|
|
sre_compile.py(147): for tail in tail:
|
|
sre_compile.py(148): code[tail] = _len(code) - tail
|
|
sre_compile.py(147): for tail in tail:
|
|
sre_compile.py(40): for op, av in pattern:
|
|
--- modulename: sre_parse, funcname: __getitem__
|
|
sre_parse.py(131): if isinstance(index, slice):
|
|
sre_parse.py(133): return self.data[index]
|
|
sre_compile.py(102): if av[0]:
|
|
sre_compile.py(103): emit(OPCODES[MARK])
|
|
sre_compile.py(104): emit((av[0]-1)*2+1)
|
|
sre_compile.py(40): for op, av in pattern:
|
|
sre_compile.py(489): code.append(OPCODES[SUCCESS])
|
|
sre_compile.py(491): return code
|
|
sre_compile.py(507): if p.pattern.groups > 100:
|
|
sre_compile.py(513): groupindex = p.pattern.groupdict
|
|
sre_compile.py(514): indexgroup = [None] * p.pattern.groups
|
|
sre_compile.py(515): for k, i in groupindex.items():
|
|
sre_compile.py(518): return _sre.compile(
|
|
sre_compile.py(519): pattern, flags | p.pattern.flags, code,
|
|
sre_compile.py(520): p.pattern.groups-1,
|
|
sre_compile.py(521): groupindex, indexgroup
|
|
re.py(245): if not bypass_cache:
|
|
re.py(246): if len(_cache) >= _MAXCACHE:
|
|
re.py(248): _cache[cachekey] = p
|
|
re.py(249): return p
|
|
encoder.py(16): HAS_UTF8 = re.compile(r'[\x80-\xff]')
|
|
--- modulename: re, funcname: compile
|
|
re.py(190): return _compile(pattern, flags)
|
|
--- modulename: re, funcname: _compile
|
|
re.py(228): pattern, flags = key
|
|
re.py(229): bypass_cache = flags & DEBUG
|
|
re.py(230): if not bypass_cache:
|
|
re.py(231): cachekey = (type(key[0]),) + key
|
|
re.py(232): p = _cache.get(cachekey)
|
|
re.py(233): if p is not None:
|
|
re.py(235): if isinstance(pattern, _pattern_type):
|
|
re.py(239): if not sre_compile.isstring(pattern):
|
|
--- modulename: sre_compile, funcname: isstring
|
|
sre_compile.py(473): for tp in STRING_TYPES:
|
|
sre_compile.py(474): if isinstance(obj, tp):
|
|
sre_compile.py(475): return 1
|
|
re.py(241): try:
|
|
re.py(242): p = sre_compile.compile(pattern, flags)
|
|
--- modulename: sre_compile, funcname: compile
|
|
sre_compile.py(496): if isstring(p):
|
|
--- modulename: sre_compile, funcname: isstring
|
|
sre_compile.py(473): for tp in STRING_TYPES:
|
|
sre_compile.py(474): if isinstance(obj, tp):
|
|
sre_compile.py(475): return 1
|
|
sre_compile.py(497): pattern = p
|
|
sre_compile.py(498): p = sre_parse.parse(p, flags)
|
|
--- modulename: sre_parse, funcname: parse
|
|
sre_parse.py(678): source = Tokenizer(str)
|
|
--- modulename: sre_parse, funcname: __init__
|
|
sre_parse.py(179): self.string = string
|
|
sre_parse.py(180): self.index = 0
|
|
sre_parse.py(181): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(680): if pattern is None:
|
|
sre_parse.py(681): pattern = Pattern()
|
|
--- modulename: sre_parse, funcname: __init__
|
|
sre_parse.py(68): self.flags = 0
|
|
sre_parse.py(69): self.open = []
|
|
sre_parse.py(70): self.groups = 1
|
|
sre_parse.py(71): self.groupdict = {}
|
|
sre_parse.py(682): pattern.flags = flags
|
|
sre_parse.py(683): pattern.str = str
|
|
sre_parse.py(685): p = _parse_sub(source, pattern, 0)
|
|
--- modulename: sre_parse, funcname: _parse_sub
|
|
sre_parse.py(304): items = []
|
|
sre_parse.py(305): itemsappend = items.append
|
|
sre_parse.py(306): sourcematch = source.match
|
|
sre_parse.py(307): while 1:
|
|
sre_parse.py(308): itemsappend(_parse(source, state))
|
|
--- modulename: sre_parse, funcname: _parse
|
|
sre_parse.py(381): subpattern = SubPattern(state)
|
|
--- modulename: sre_parse, funcname: __init__
|
|
sre_parse.py(91): self.pattern = pattern
|
|
sre_parse.py(92): if data is None:
|
|
sre_parse.py(93): data = []
|
|
sre_parse.py(94): self.data = data
|
|
sre_parse.py(95): self.width = None
|
|
sre_parse.py(384): subpatternappend = subpattern.append
|
|
sre_parse.py(385): sourceget = source.get
|
|
sre_parse.py(386): sourcematch = source.match
|
|
sre_parse.py(387): _len = len
|
|
sre_parse.py(388): PATTERNENDERS = _PATTERNENDERS
|
|
sre_parse.py(389): ASSERTCHARS = _ASSERTCHARS
|
|
sre_parse.py(390): LOOKBEHINDASSERTCHARS = _LOOKBEHINDASSERTCHARS
|
|
sre_parse.py(391): REPEATCODES = _REPEATCODES
|
|
sre_parse.py(393): while 1:
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(397): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(188): try:
|
|
sre_parse.py(189): c = self.string[self.index + 1]
|
|
sre_parse.py(192): char = char + c
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(398): if this is None:
|
|
sre_parse.py(401): if state.flags & SRE_FLAG_VERBOSE:
|
|
sre_parse.py(412): if this and this[0] not in SPECIAL_CHARS:
|
|
sre_parse.py(415): elif this == "[":
|
|
sre_parse.py(417): set = []
|
|
sre_parse.py(418): setappend = set.append
|
|
sre_parse.py(421): if sourcematch("^"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(424): start = set[:]
|
|
sre_parse.py(425): while 1:
|
|
sre_parse.py(426): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(427): if this == "]" and set != start:
|
|
sre_parse.py(429): elif this and this[0] == "\\":
|
|
sre_parse.py(430): code1 = _class_escape(source, this)
|
|
--- modulename: sre_parse, funcname: _class_escape
|
|
sre_parse.py(227): code = ESCAPES.get(escape)
|
|
sre_parse.py(228): if code:
|
|
sre_parse.py(230): code = CATEGORIES.get(escape)
|
|
sre_parse.py(231): if code and code[0] == IN:
|
|
sre_parse.py(233): try:
|
|
sre_parse.py(234): c = escape[1:2]
|
|
sre_parse.py(235): if c == "x":
|
|
sre_parse.py(237): while source.next in HEXDIGITS and len(escape) < 4:
|
|
sre_parse.py(238): escape = escape + source.get()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(237): while source.next in HEXDIGITS and len(escape) < 4:
|
|
sre_parse.py(238): escape = escape + source.get()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(237): while source.next in HEXDIGITS and len(escape) < 4:
|
|
sre_parse.py(239): escape = escape[2:]
|
|
sre_parse.py(240): if len(escape) != 2:
|
|
sre_parse.py(242): return LITERAL, int(escape, 16) & 0xff
|
|
sre_parse.py(435): if sourcematch("-"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(197): if skip:
|
|
sre_parse.py(198): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(188): try:
|
|
sre_parse.py(189): c = self.string[self.index + 1]
|
|
sre_parse.py(192): char = char + c
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(199): return 1
|
|
sre_parse.py(437): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(438): if this == "]":
|
|
sre_parse.py(444): elif this:
|
|
sre_parse.py(445): if this[0] == "\\":
|
|
sre_parse.py(446): code2 = _class_escape(source, this)
|
|
--- modulename: sre_parse, funcname: _class_escape
|
|
sre_parse.py(227): code = ESCAPES.get(escape)
|
|
sre_parse.py(228): if code:
|
|
sre_parse.py(230): code = CATEGORIES.get(escape)
|
|
sre_parse.py(231): if code and code[0] == IN:
|
|
sre_parse.py(233): try:
|
|
sre_parse.py(234): c = escape[1:2]
|
|
sre_parse.py(235): if c == "x":
|
|
sre_parse.py(237): while source.next in HEXDIGITS and len(escape) < 4:
|
|
sre_parse.py(238): escape = escape + source.get()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(237): while source.next in HEXDIGITS and len(escape) < 4:
|
|
sre_parse.py(238): escape = escape + source.get()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(186): char = self.string[self.index]
|
|
sre_parse.py(187): if char[0] == "\\":
|
|
sre_parse.py(193): self.index = self.index + len(char)
|
|
sre_parse.py(194): self.next = char
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(237): while source.next in HEXDIGITS and len(escape) < 4:
|
|
sre_parse.py(239): escape = escape[2:]
|
|
sre_parse.py(240): if len(escape) != 2:
|
|
sre_parse.py(242): return LITERAL, int(escape, 16) & 0xff
|
|
sre_parse.py(449): if code1[0] != LITERAL or code2[0] != LITERAL:
|
|
sre_parse.py(451): lo = code1[1]
|
|
sre_parse.py(452): hi = code2[1]
|
|
sre_parse.py(453): if hi < lo:
|
|
sre_parse.py(455): setappend((RANGE, (lo, hi)))
|
|
sre_parse.py(426): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(184): self.next = None
|
|
sre_parse.py(185): return
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(427): if this == "]" and set != start:
|
|
sre_parse.py(428): break
|
|
sre_parse.py(464): if _len(set)==1 and set[0][0] is LITERAL:
|
|
sre_parse.py(466): elif _len(set)==2 and set[0][0] is NEGATE and set[1][0] is LITERAL:
|
|
sre_parse.py(470): subpatternappend((IN, set))
|
|
--- modulename: sre_parse, funcname: append
|
|
sre_parse.py(139): self.data.append(code)
|
|
sre_parse.py(395): if source.next in PATTERNENDERS:
|
|
sre_parse.py(397): this = sourceget()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(184): self.next = None
|
|
sre_parse.py(185): return
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(398): if this is None:
|
|
sre_parse.py(399): break # end of pattern
|
|
sre_parse.py(673): return subpattern
|
|
sre_parse.py(309): if sourcematch("|"):
|
|
--- modulename: sre_parse, funcname: match
|
|
sre_parse.py(196): if char == self.next:
|
|
sre_parse.py(200): return 0
|
|
sre_parse.py(311): if not nested:
|
|
sre_parse.py(312): break
|
|
sre_parse.py(318): if len(items) == 1:
|
|
sre_parse.py(319): return items[0]
|
|
sre_parse.py(687): tail = source.get()
|
|
--- modulename: sre_parse, funcname: get
|
|
sre_parse.py(202): this = self.next
|
|
sre_parse.py(203): self.__next()
|
|
--- modulename: sre_parse, funcname: __next
|
|
sre_parse.py(183): if self.index >= len(self.string):
|
|
sre_parse.py(184): self.next = None
|
|
sre_parse.py(185): return
|
|
sre_parse.py(204): return this
|
|
sre_parse.py(688): if tail == ")":
|
|
sre_parse.py(690): elif tail:
|
|
sre_parse.py(693): if flags & SRE_FLAG_DEBUG:
|
|
sre_parse.py(696): if not (flags & SRE_FLAG_VERBOSE) and p.pattern.flags & SRE_FLAG_VERBOSE:
|
|
sre_parse.py(701): return p
|
|
sre_compile.py(502): code = _code(p, flags)
|
|
--- modulename: sre_compile, funcname: _code
|
|
sre_compile.py(480): flags = p.pattern.flags | flags
|
|
sre_compile.py(481): code = []
|
|
sre_compile.py(484): _compile_info(code, p, flags)
|
|
--- modulename: sre_compile, funcname: _compile_info
|
|
sre_compile.py(363): lo, hi = pattern.getwidth()
|
|
--- modulename: sre_parse, funcname: getwidth
|
|
sre_parse.py(142): if self.width:
|
|
sre_parse.py(144): lo = hi = 0
|
|
sre_parse.py(145): UNITCODES = (ANY, RANGE, IN, LITERAL, NOT_LITERAL, CATEGORY)
|
|
sre_parse.py(146): REPEATCODES = (MIN_REPEAT, MAX_REPEAT)
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(148): if op is BRANCH:
|
|
sre_parse.py(157): elif op is CALL:
|
|
sre_parse.py(161): elif op is SUBPATTERN:
|
|
sre_parse.py(165): elif op in REPEATCODES:
|
|
sre_parse.py(169): elif op in UNITCODES:
|
|
sre_parse.py(170): lo = lo + 1
|
|
sre_parse.py(171): hi = hi + 1
|
|
sre_parse.py(147): for op, av in self.data:
|
|
sre_parse.py(174): self.width = min(lo, MAXREPEAT - 1), min(hi, MAXREPEAT)
|
|
sre_parse.py(175): return self.width
|
|
sre_compile.py(364): if lo == 0:
|
|
sre_compile.py(367): prefix = []
|
|
sre_compile.py(368): prefixappend = prefix.append
|
|
sre_compile.py(369): prefix_skip = 0
|
|
sre_compile.py(370): charset = [] # not used
|
|
sre_compile.py(371): charsetappend = charset.append
|
|
sre_compile.py(372): if not (flags & SRE_FLAG_IGNORECASE):
|
|
sre_compile.py(374): for op, av in pattern.data:
|
|
sre_compile.py(375): if op is LITERAL:
|
|
sre_compile.py(379): elif op is SUBPATTERN and len(av[1]) == 1:
|
|
sre_compile.py(386): break
|
|
sre_compile.py(388): if not prefix and pattern.data:
|
|
sre_compile.py(389): op, av = pattern.data[0]
|
|
sre_compile.py(390): if op is SUBPATTERN and av[1]:
|
|
sre_compile.py(407): elif op is BRANCH:
|
|
sre_compile.py(420): elif op is IN:
|
|
sre_compile.py(421): charset = av
|
|
sre_compile.py(427): emit = code.append
|
|
sre_compile.py(428): emit(OPCODES[INFO])
|
|
sre_compile.py(429): skip = len(code); emit(0)
|
|
sre_compile.py(431): mask = 0
|
|
sre_compile.py(432): if prefix:
|
|
sre_compile.py(436): elif charset:
|
|
sre_compile.py(437): mask = mask + SRE_INFO_CHARSET
|
|
sre_compile.py(438): emit(mask)
|
|
sre_compile.py(440): if lo < MAXCODE:
|
|
sre_compile.py(441): emit(lo)
|
|
sre_compile.py(445): if hi < MAXCODE:
|
|
sre_compile.py(446): emit(hi)
|
|
sre_compile.py(450): if prefix:
|
|
sre_compile.py(461): elif charset:
|
|
sre_compile.py(462): _compile_charset(charset, flags, code)
|
|
--- modulename: sre_compile, funcname: _compile_charset
|
|
sre_compile.py(180): emit = code.append
|
|
sre_compile.py(181): if fixup is None:
|
|
sre_compile.py(182): fixup = _identityfunction
|
|
sre_compile.py(183): for op, av in _optimize_charset(charset, fixup):
|
|
--- modulename: sre_compile, funcname: _optimize_charset
|
|
sre_compile.py(209): out = []
|
|
sre_compile.py(210): outappend = out.append
|
|
sre_compile.py(211): charmap = [0]*256
|
|
sre_compile.py(212): try:
|
|
sre_compile.py(213): for op, av in charset:
|
|
sre_compile.py(214): if op is NEGATE:
|
|
sre_compile.py(216): elif op is LITERAL:
|
|
sre_compile.py(218): elif op is RANGE:
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
--- modulename: sre_compile, funcname: _identityfunction
|
|
sre_compile.py(25): return x
|
|
--- modulename: sre_compile, funcname: _identityfunction
|
|
sre_compile.py(25): return x
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(213): for op, av in charset:
|
|
sre_compile.py(228): i = p = n = 0
|
|
sre_compile.py(229): runs = []
|
|
sre_compile.py(230): runsappend = runs.append
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(234): p = i
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(240): if n:
|
|
sre_compile.py(241): runsappend((p, n))
|
|
sre_compile.py(242): if len(runs) <= 2:
|
|
sre_compile.py(244): for p, n in runs:
|
|
sre_compile.py(245): if n == 1:
|
|
sre_compile.py(248): outappend((RANGE, (p, p+n-1)))
|
|
sre_compile.py(244): for p, n in runs:
|
|
sre_compile.py(249): if len(out) < len(charset):
|
|
sre_compile.py(256): return charset
|
|
sre_compile.py(184): emit(OPCODES[op])
|
|
sre_compile.py(185): if op is NEGATE:
|
|
sre_compile.py(187): elif op is LITERAL:
|
|
sre_compile.py(189): elif op is RANGE:
|
|
sre_compile.py(190): emit(fixup(av[0]))
|
|
--- modulename: sre_compile, funcname: _identityfunction
|
|
sre_compile.py(25): return x
|
|
sre_compile.py(191): emit(fixup(av[1]))
|
|
--- modulename: sre_compile, funcname: _identityfunction
|
|
sre_compile.py(25): return x
|
|
sre_compile.py(183): for op, av in _optimize_charset(charset, fixup):
|
|
sre_compile.py(205): emit(OPCODES[FAILURE])
|
|
sre_compile.py(463): code[skip] = len(code) - skip
|
|
sre_compile.py(487): _compile(code, p.data, flags)
|
|
--- modulename: sre_compile, funcname: _compile
|
|
sre_compile.py(34): emit = code.append
|
|
sre_compile.py(35): _len = len
|
|
sre_compile.py(36): LITERAL_CODES = _LITERAL_CODES
|
|
sre_compile.py(37): REPEATING_CODES = _REPEATING_CODES
|
|
sre_compile.py(38): SUCCESS_CODES = _SUCCESS_CODES
|
|
sre_compile.py(39): ASSERT_CODES = _ASSERT_CODES
|
|
sre_compile.py(40): for op, av in pattern:
|
|
sre_compile.py(41): if op in LITERAL_CODES:
|
|
sre_compile.py(48): elif op is IN:
|
|
sre_compile.py(49): if flags & SRE_FLAG_IGNORECASE:
|
|
sre_compile.py(54): emit(OPCODES[op])
|
|
sre_compile.py(55): fixup = _identityfunction
|
|
sre_compile.py(56): skip = _len(code); emit(0)
|
|
sre_compile.py(57): _compile_charset(av, flags, code, fixup)
|
|
--- modulename: sre_compile, funcname: _compile_charset
|
|
sre_compile.py(180): emit = code.append
|
|
sre_compile.py(181): if fixup is None:
|
|
sre_compile.py(183): for op, av in _optimize_charset(charset, fixup):
|
|
--- modulename: sre_compile, funcname: _optimize_charset
|
|
sre_compile.py(209): out = []
|
|
sre_compile.py(210): outappend = out.append
|
|
sre_compile.py(211): charmap = [0]*256
|
|
sre_compile.py(212): try:
|
|
sre_compile.py(213): for op, av in charset:
|
|
sre_compile.py(214): if op is NEGATE:
|
|
sre_compile.py(216): elif op is LITERAL:
|
|
sre_compile.py(218): elif op is RANGE:
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
--- modulename: sre_compile, funcname: _identityfunction
|
|
sre_compile.py(25): return x
|
|
--- modulename: sre_compile, funcname: _identityfunction
|
|
sre_compile.py(25): return x
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(220): charmap[i] = 1
|
|
sre_compile.py(219): for i in range(fixup(av[0]), fixup(av[1])+1):
|
|
sre_compile.py(213): for op, av in charset:
|
|
sre_compile.py(228): i = p = n = 0
|
|
sre_compile.py(229): runs = []
|
|
sre_compile.py(230): runsappend = runs.append
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(236): elif n:
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(234): p = i
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(232): if c:
|
|
sre_compile.py(233): if n == 0:
|
|
sre_compile.py(235): n = n + 1
|
|
sre_compile.py(239): i = i + 1
|
|
sre_compile.py(231): for c in charmap:
|
|
sre_compile.py(240): if n:
|
|
sre_compile.py(241): runsappend((p, n))
|
|
sre_compile.py(242): if len(runs) <= 2:
|
|
sre_compile.py(244): for p, n in runs:
|
|
sre_compile.py(245): if n == 1:
|
|
sre_compile.py(248): outappend((RANGE, (p, p+n-1)))
|
|
sre_compile.py(244): for p, n in runs:
|
|
sre_compile.py(249): if len(out) < len(charset):
|
|
sre_compile.py(256): return charset
|
|
sre_compile.py(184): emit(OPCODES[op])
|
|
sre_compile.py(185): if op is NEGATE:
|
|
sre_compile.py(187): elif op is LITERAL:
|
|
sre_compile.py(189): elif op is RANGE:
|
|
sre_compile.py(190): emit(fixup(av[0]))
|
|
--- modulename: sre_compile, funcname: _identityfunction
|
|
sre_compile.py(25): return x
|
|
sre_compile.py(191): emit(fixup(av[1]))
|
|
--- modulename: sre_compile, funcname: _identityfunction
|
|
sre_compile.py(25): return x
|
|
sre_compile.py(183): for op, av in _optimize_charset(charset, fixup):
|
|
sre_compile.py(205): emit(OPCODES[FAILURE])
|
|
sre_compile.py(58): code[skip] = _len(code) - skip
|
|
sre_compile.py(40): for op, av in pattern:
|
|
sre_compile.py(489): code.append(OPCODES[SUCCESS])
|
|
sre_compile.py(491): return code
|
|
sre_compile.py(507): if p.pattern.groups > 100:
|
|
sre_compile.py(513): groupindex = p.pattern.groupdict
|
|
sre_compile.py(514): indexgroup = [None] * p.pattern.groups
|
|
sre_compile.py(515): for k, i in groupindex.items():
|
|
sre_compile.py(518): return _sre.compile(
|
|
sre_compile.py(519): pattern, flags | p.pattern.flags, code,
|
|
sre_compile.py(520): p.pattern.groups-1,
|
|
sre_compile.py(521): groupindex, indexgroup
|
|
re.py(245): if not bypass_cache:
|
|
re.py(246): if len(_cache) >= _MAXCACHE:
|
|
re.py(248): _cache[cachekey] = p
|
|
re.py(249): return p
|
|
encoder.py(17): ESCAPE_DCT = {
|
|
encoder.py(18): '\\': '\\\\',
|
|
encoder.py(19): '"': '\\"',
|
|
encoder.py(20): '\b': '\\b',
|
|
encoder.py(21): '\f': '\\f',
|
|
encoder.py(22): '\n': '\\n',
|
|
encoder.py(23): '\r': '\\r',
|
|
encoder.py(24): '\t': '\\t',
|
|
encoder.py(26): for i in range(0x20):
|
|
encoder.py(27): ESCAPE_DCT.setdefault(chr(i), '\\u{0:04x}'.format(i))
|
|
encoder.py(26): for i in range(0x20):
|
|
encoder.py(27): ESCAPE_DCT.setdefault(chr(i), '\\u{0:04x}'.format(i))
|
|
encoder.py(26): for i in range(0x20):
|
|
encoder.py(27): ESCAPE_DCT.setdefault(chr(i), '\\u{0:04x}'.format(i))
|
|
encoder.py(26): for i in range(0x20):
|
|
encoder.py(27): ESCAPE_DCT.setdefault(chr(i), '\\u{0:04x}'.format(i))
|
|
encoder.py(26): for i in range(0x20):
|
|
encoder.py(27): ESCAPE_DCT.setdefault(chr(i), '\\u{0:04x}'.format(i))
|
|
encoder.py(26): for i in range(0x20):
|
|
encoder.py(27): ESCAPE_DCT.setdefault(chr(i), '\\u{0:04x}'.format(i))
|
|
encoder.py(26): for i in range(0x20):
|
|
encoder.py(27): ESCAPE_DCT.setdefault(chr(i), '\\u{0:04x}'.format(i))
|
|
encoder.py(26): for i in range(0x20):
|
|
encoder.py(27): ESCAPE_DCT.setdefault(chr(i), '\\u{0:04x}'.format(i))
|
|
encoder.py(26): for i in range(0x20):
|
|
encoder.py(27): ESCAPE_DCT.setdefault(chr(i), '\\u{0:04x}'.format(i))
|
|
encoder.py(26): for i in range(0x20):
|
|
encoder.py(27): ESCAPE_DCT.setdefault(chr(i), '\\u{0:04x}'.format(i))
|
|
encoder.py(26): for i in range(0x20):
|
|
encoder.py(27): ESCAPE_DCT.setdefault(chr(i), '\\u{0:04x}'.format(i))
|
|
encoder.py(26): for i in range(0x20):
|
|
encoder.py(27): ESCAPE_DCT.setdefault(chr(i), '\\u{0:04x}'.format(i))
|
|
encoder.py(26): for i in range(0x20):
|
|
encoder.py(27): ESCAPE_DCT.setdefault(chr(i), '\\u{0:04x}'.format(i))
|
|
encoder.py(26): for i in range(0x20):
|
|
encoder.py(27): ESCAPE_DCT.setdefault(chr(i), '\\u{0:04x}'.format(i))
|
|
encoder.py(26): for i in range(0x20):
|
|
encoder.py(27): ESCAPE_DCT.setdefault(chr(i), '\\u{0:04x}'.format(i))
|
|
encoder.py(26): for i in range(0x20):
|
|
encoder.py(27): ESCAPE_DCT.setdefault(chr(i), '\\u{0:04x}'.format(i))
|
|
encoder.py(26): for i in range(0x20):
|
|
encoder.py(27): ESCAPE_DCT.setdefault(chr(i), '\\u{0:04x}'.format(i))
|
|
encoder.py(26): for i in range(0x20):
|
|
encoder.py(27): ESCAPE_DCT.setdefault(chr(i), '\\u{0:04x}'.format(i))
|
|
encoder.py(26): for i in range(0x20):
|
|
encoder.py(27): ESCAPE_DCT.setdefault(chr(i), '\\u{0:04x}'.format(i))
|
|
encoder.py(26): for i in range(0x20):
|
|
encoder.py(27): ESCAPE_DCT.setdefault(chr(i), '\\u{0:04x}'.format(i))
|
|
encoder.py(26): for i in range(0x20):
|
|
encoder.py(27): ESCAPE_DCT.setdefault(chr(i), '\\u{0:04x}'.format(i))
|
|
encoder.py(26): for i in range(0x20):
|
|
encoder.py(27): ESCAPE_DCT.setdefault(chr(i), '\\u{0:04x}'.format(i))
|
|
encoder.py(26): for i in range(0x20):
|
|
encoder.py(27): ESCAPE_DCT.setdefault(chr(i), '\\u{0:04x}'.format(i))
|
|
encoder.py(26): for i in range(0x20):
|
|
encoder.py(27): ESCAPE_DCT.setdefault(chr(i), '\\u{0:04x}'.format(i))
|
|
encoder.py(26): for i in range(0x20):
|
|
encoder.py(27): ESCAPE_DCT.setdefault(chr(i), '\\u{0:04x}'.format(i))
|
|
encoder.py(26): for i in range(0x20):
|
|
encoder.py(27): ESCAPE_DCT.setdefault(chr(i), '\\u{0:04x}'.format(i))
|
|
encoder.py(26): for i in range(0x20):
|
|
encoder.py(27): ESCAPE_DCT.setdefault(chr(i), '\\u{0:04x}'.format(i))
|
|
encoder.py(26): for i in range(0x20):
|
|
encoder.py(27): ESCAPE_DCT.setdefault(chr(i), '\\u{0:04x}'.format(i))
|
|
encoder.py(26): for i in range(0x20):
|
|
encoder.py(27): ESCAPE_DCT.setdefault(chr(i), '\\u{0:04x}'.format(i))
|
|
encoder.py(26): for i in range(0x20):
|
|
encoder.py(27): ESCAPE_DCT.setdefault(chr(i), '\\u{0:04x}'.format(i))
|
|
encoder.py(26): for i in range(0x20):
|
|
encoder.py(27): ESCAPE_DCT.setdefault(chr(i), '\\u{0:04x}'.format(i))
|
|
encoder.py(26): for i in range(0x20):
|
|
encoder.py(27): ESCAPE_DCT.setdefault(chr(i), '\\u{0:04x}'.format(i))
|
|
encoder.py(26): for i in range(0x20):
|
|
encoder.py(30): INFINITY = float('inf')
|
|
encoder.py(31): FLOAT_REPR = repr
|
|
encoder.py(33): def encode_basestring(s):
|
|
encoder.py(42): def py_encode_basestring_ascii(s):
|
|
encoder.py(68): c_encode_basestring_ascii or py_encode_basestring_ascii)
|
|
encoder.py(70): class JSONEncoder(object):
|
|
--- modulename: encoder, funcname: JSONEncoder
|
|
encoder.py(70): class JSONEncoder(object):
|
|
encoder.py(98): """
|
|
encoder.py(99): item_separator = ', '
|
|
encoder.py(100): key_separator = ': '
|
|
encoder.py(101): def __init__(self, skipkeys=False, ensure_ascii=True,
|
|
encoder.py(102): check_circular=True, allow_nan=True, sort_keys=False,
|
|
encoder.py(103): indent=None, separators=None, encoding='utf-8', default=None):
|
|
encoder.py(165): def default(self, o):
|
|
encoder.py(186): def encode(self, o):
|
|
encoder.py(212): def iterencode(self, o, _one_shot=False):
|
|
encoder.py(275): ValueError=ValueError,
|
|
encoder.py(276): basestring=basestring,
|
|
encoder.py(277): dict=dict,
|
|
encoder.py(278): float=float,
|
|
encoder.py(279): id=id,
|
|
encoder.py(280): int=int,
|
|
encoder.py(281): isinstance=isinstance,
|
|
encoder.py(282): list=list,
|
|
encoder.py(283): long=long,
|
|
encoder.py(284): str=str,
|
|
encoder.py(285): tuple=tuple,
|
|
__init__.py(111): _default_encoder = JSONEncoder(
|
|
__init__.py(112): skipkeys=False,
|
|
__init__.py(113): ensure_ascii=True,
|
|
__init__.py(114): check_circular=True,
|
|
__init__.py(115): allow_nan=True,
|
|
__init__.py(116): indent=None,
|
|
__init__.py(117): separators=None,
|
|
__init__.py(118): encoding='utf-8',
|
|
__init__.py(119): default=None,
|
|
--- modulename: encoder, funcname: __init__
|
|
encoder.py(153): self.skipkeys = skipkeys
|
|
encoder.py(154): self.ensure_ascii = ensure_ascii
|
|
encoder.py(155): self.check_circular = check_circular
|
|
encoder.py(156): self.allow_nan = allow_nan
|
|
encoder.py(157): self.sort_keys = sort_keys
|
|
encoder.py(158): self.indent = indent
|
|
encoder.py(159): if separators is not None:
|
|
encoder.py(161): if default is not None:
|
|
encoder.py(163): self.encoding = encoding
|
|
__init__.py(122): def dump(obj, fp, skipkeys=False, ensure_ascii=True, check_circular=True,
|
|
__init__.py(123): allow_nan=True, cls=None, indent=None, separators=None,
|
|
__init__.py(124): encoding='utf-8', default=None, sort_keys=False, **kw):
|
|
__init__.py(193): def dumps(obj, skipkeys=False, ensure_ascii=True, check_circular=True,
|
|
__init__.py(194): allow_nan=True, cls=None, indent=None, separators=None,
|
|
__init__.py(195): encoding='utf-8', default=None, sort_keys=False, **kw):
|
|
__init__.py(253): _default_decoder = JSONDecoder(encoding=None, object_hook=None,
|
|
__init__.py(254): object_pairs_hook=None)
|
|
--- modulename: decoder, funcname: __init__
|
|
decoder.py(349): self.encoding = encoding
|
|
decoder.py(350): self.object_hook = object_hook
|
|
decoder.py(351): self.object_pairs_hook = object_pairs_hook
|
|
decoder.py(352): self.parse_float = parse_float or float
|
|
decoder.py(353): self.parse_int = parse_int or int
|
|
decoder.py(354): self.parse_constant = parse_constant or _CONSTANTS.__getitem__
|
|
decoder.py(355): self.strict = strict
|
|
decoder.py(356): self.parse_object = JSONObject
|
|
decoder.py(357): self.parse_array = JSONArray
|
|
decoder.py(358): self.parse_string = scanstring
|
|
decoder.py(359): self.scan_once = scanner.make_scanner(self)
|
|
__init__.py(257): def load(fp, encoding=None, cls=None, object_hook=None, parse_float=None,
|
|
__init__.py(258): parse_int=None, parse_constant=None, object_pairs_hook=None, **kw):
|
|
__init__.py(293): def loads(s, encoding=None, cls=None, object_hook=None, parse_float=None,
|
|
__init__.py(294): parse_int=None, parse_constant=None, object_pairs_hook=None, **kw):
|
|
TL.py(5): import io
|
|
TL.py(6): from numbers import Number
|
|
--- modulename: numbers, funcname: <module>
|
|
numbers.py(6): TODO: Fill out more detailed documentation on the operators."""
|
|
numbers.py(8): from __future__ import division
|
|
numbers.py(9): from abc import ABCMeta, abstractmethod, abstractproperty
|
|
numbers.py(11): __all__ = ["Number", "Complex", "Real", "Rational", "Integral"]
|
|
numbers.py(13): class Number(object):
|
|
--- modulename: numbers, funcname: Number
|
|
numbers.py(13): class Number(object):
|
|
numbers.py(18): """
|
|
numbers.py(19): __metaclass__ = ABCMeta
|
|
numbers.py(20): __slots__ = ()
|
|
numbers.py(23): __hash__ = None
|
|
--- modulename: abc, funcname: __new__
|
|
abc.py(87): cls = super(ABCMeta, mcls).__new__(mcls, name, bases, namespace)
|
|
abc.py(89): abstracts = set(name
|
|
abc.py(90): for name, value in namespace.items()
|
|
--- modulename: abc, funcname: <genexpr>
|
|
abc.py(89): abstracts = set(name
|
|
abc.py(91): if getattr(value, "__isabstractmethod__", False))
|
|
abc.py(89): abstracts = set(name
|
|
abc.py(91): if getattr(value, "__isabstractmethod__", False))
|
|
abc.py(89): abstracts = set(name
|
|
abc.py(91): if getattr(value, "__isabstractmethod__", False))
|
|
abc.py(89): abstracts = set(name
|
|
abc.py(91): if getattr(value, "__isabstractmethod__", False))
|
|
abc.py(89): abstracts = set(name
|
|
abc.py(91): if getattr(value, "__isabstractmethod__", False))
|
|
abc.py(89): abstracts = set(name
|
|
abc.py(92): for base in bases:
|
|
abc.py(93): for name in getattr(base, "__abstractmethods__", set()):
|
|
abc.py(92): for base in bases:
|
|
abc.py(97): cls.__abstractmethods__ = frozenset(abstracts)
|
|
abc.py(99): cls._abc_registry = WeakSet()
|
|
--- modulename: _weakrefset, funcname: __init__
|
|
_weakrefset.py(37): self.data = set()
|
|
_weakrefset.py(38): def _remove(item, selfref=ref(self)):
|
|
_weakrefset.py(45): self._remove = _remove
|
|
_weakrefset.py(47): self._pending_removals = []
|
|
_weakrefset.py(48): self._iterating = set()
|
|
_weakrefset.py(49): if data is not None:
|
|
abc.py(100): cls._abc_cache = WeakSet()
|
|
--- modulename: _weakrefset, funcname: __init__
|
|
_weakrefset.py(37): self.data = set()
|
|
_weakrefset.py(38): def _remove(item, selfref=ref(self)):
|
|
_weakrefset.py(45): self._remove = _remove
|
|
_weakrefset.py(47): self._pending_removals = []
|
|
_weakrefset.py(48): self._iterating = set()
|
|
_weakrefset.py(49): if data is not None:
|
|
abc.py(101): cls._abc_negative_cache = WeakSet()
|
|
--- modulename: _weakrefset, funcname: __init__
|
|
_weakrefset.py(37): self.data = set()
|
|
_weakrefset.py(38): def _remove(item, selfref=ref(self)):
|
|
_weakrefset.py(45): self._remove = _remove
|
|
_weakrefset.py(47): self._pending_removals = []
|
|
_weakrefset.py(48): self._iterating = set()
|
|
_weakrefset.py(49): if data is not None:
|
|
abc.py(102): cls._abc_negative_cache_version = ABCMeta._abc_invalidation_counter
|
|
abc.py(103): return cls
|
|
numbers.py(34): class Complex(Number):
|
|
--- modulename: numbers, funcname: Complex
|
|
numbers.py(34): class Complex(Number):
|
|
numbers.py(43): """
|
|
numbers.py(45): __slots__ = ()
|
|
numbers.py(47): @abstractmethod
|
|
--- modulename: abc, funcname: abstractmethod
|
|
abc.py(32): funcobj.__isabstractmethod__ = True
|
|
abc.py(33): return funcobj
|
|
numbers.py(52): def __nonzero__(self):
|
|
numbers.py(56): @abstractproperty
|
|
numbers.py(64): @abstractproperty
|
|
numbers.py(72): @abstractmethod
|
|
--- modulename: abc, funcname: abstractmethod
|
|
abc.py(32): funcobj.__isabstractmethod__ = True
|
|
abc.py(33): return funcobj
|
|
numbers.py(77): @abstractmethod
|
|
--- modulename: abc, funcname: abstractmethod
|
|
abc.py(32): funcobj.__isabstractmethod__ = True
|
|
abc.py(33): return funcobj
|
|
numbers.py(82): @abstractmethod
|
|
--- modulename: abc, funcname: abstractmethod
|
|
abc.py(32): funcobj.__isabstractmethod__ = True
|
|
abc.py(33): return funcobj
|
|
numbers.py(87): @abstractmethod
|
|
--- modulename: abc, funcname: abstractmethod
|
|
abc.py(32): funcobj.__isabstractmethod__ = True
|
|
abc.py(33): return funcobj
|
|
numbers.py(92): def __sub__(self, other):
|
|
numbers.py(96): def __rsub__(self, other):
|
|
numbers.py(100): @abstractmethod
|
|
--- modulename: abc, funcname: abstractmethod
|
|
abc.py(32): funcobj.__isabstractmethod__ = True
|
|
abc.py(33): return funcobj
|
|
numbers.py(105): @abstractmethod
|
|
--- modulename: abc, funcname: abstractmethod
|
|
abc.py(32): funcobj.__isabstractmethod__ = True
|
|
abc.py(33): return funcobj
|
|
numbers.py(110): @abstractmethod
|
|
--- modulename: abc, funcname: abstractmethod
|
|
abc.py(32): funcobj.__isabstractmethod__ = True
|
|
abc.py(33): return funcobj
|
|
numbers.py(118): @abstractmethod
|
|
--- modulename: abc, funcname: abstractmethod
|
|
abc.py(32): funcobj.__isabstractmethod__ = True
|
|
abc.py(33): return funcobj
|
|
numbers.py(123): @abstractmethod
|
|
--- modulename: abc, funcname: abstractmethod
|
|
abc.py(32): funcobj.__isabstractmethod__ = True
|
|
abc.py(33): return funcobj
|
|
numbers.py(131): @abstractmethod
|
|
--- modulename: abc, funcname: abstractmethod
|
|
abc.py(32): funcobj.__isabstractmethod__ = True
|
|
abc.py(33): return funcobj
|
|
numbers.py(136): @abstractmethod
|
|
--- modulename: abc, funcname: abstractmethod
|
|
abc.py(32): funcobj.__isabstractmethod__ = True
|
|
abc.py(33): return funcobj
|
|
numbers.py(141): @abstractmethod
|
|
--- modulename: abc, funcname: abstractmethod
|
|
abc.py(32): funcobj.__isabstractmethod__ = True
|
|
abc.py(33): return funcobj
|
|
numbers.py(146): @abstractmethod
|
|
--- modulename: abc, funcname: abstractmethod
|
|
abc.py(32): funcobj.__isabstractmethod__ = True
|
|
abc.py(33): return funcobj
|
|
numbers.py(151): @abstractmethod
|
|
--- modulename: abc, funcname: abstractmethod
|
|
abc.py(32): funcobj.__isabstractmethod__ = True
|
|
abc.py(33): return funcobj
|
|
numbers.py(156): @abstractmethod
|
|
--- modulename: abc, funcname: abstractmethod
|
|
abc.py(32): funcobj.__isabstractmethod__ = True
|
|
abc.py(33): return funcobj
|
|
numbers.py(161): def __ne__(self, other):
|
|
--- modulename: abc, funcname: __new__
|
|
abc.py(87): cls = super(ABCMeta, mcls).__new__(mcls, name, bases, namespace)
|
|
abc.py(89): abstracts = set(name
|
|
abc.py(90): for name, value in namespace.items()
|
|
--- modulename: abc, funcname: <genexpr>
|
|
abc.py(89): abstracts = set(name
|
|
abc.py(91): if getattr(value, "__isabstractmethod__", False))
|
|
abc.py(89): abstracts = set(name
|
|
abc.py(91): if getattr(value, "__isabstractmethod__", False))
|
|
--- modulename: abc, funcname: <genexpr>
|
|
abc.py(89): abstracts = set(name
|
|
abc.py(91): if getattr(value, "__isabstractmethod__", False))
|
|
--- modulename: abc, funcname: <genexpr>
|
|
abc.py(89): abstracts = set(name
|
|
abc.py(91): if getattr(value, "__isabstractmethod__", False))
|
|
--- modulename: abc, funcname: <genexpr>
|
|
abc.py(89): abstracts = set(name
|
|
abc.py(91): if getattr(value, "__isabstractmethod__", False))
|
|
--- modulename: abc, funcname: <genexpr>
|
|
abc.py(89): abstracts = set(name
|
|
abc.py(91): if getattr(value, "__isabstractmethod__", False))
|
|
abc.py(89): abstracts = set(name
|
|
abc.py(91): if getattr(value, "__isabstractmethod__", False))
|
|
--- modulename: abc, funcname: <genexpr>
|
|
abc.py(89): abstracts = set(name
|
|
abc.py(91): if getattr(value, "__isabstractmethod__", False))
|
|
--- modulename: abc, funcname: <genexpr>
|
|
abc.py(89): abstracts = set(name
|
|
abc.py(91): if getattr(value, "__isabstractmethod__", False))
|
|
--- modulename: abc, funcname: <genexpr>
|
|
abc.py(89): abstracts = set(name
|
|
abc.py(91): if getattr(value, "__isabstractmethod__", False))
|
|
--- modulename: abc, funcname: <genexpr>
|
|
abc.py(89): abstracts = set(name
|
|
abc.py(91): if getattr(value, "__isabstractmethod__", False))
|
|
abc.py(89): abstracts = set(name
|
|
abc.py(91): if getattr(value, "__isabstractmethod__", False))
|
|
--- modulename: abc, funcname: <genexpr>
|
|
abc.py(89): abstracts = set(name
|
|
abc.py(91): if getattr(value, "__isabstractmethod__", False))
|
|
--- modulename: abc, funcname: <genexpr>
|
|
abc.py(89): abstracts = set(name
|
|
abc.py(91): if getattr(value, "__isabstractmethod__", False))
|
|
abc.py(89): abstracts = set(name
|
|
abc.py(91): if getattr(value, "__isabstractmethod__", False))
|
|
--- modulename: abc, funcname: <genexpr>
|
|
abc.py(89): abstracts = set(name
|
|
abc.py(91): if getattr(value, "__isabstractmethod__", False))
|
|
--- modulename: abc, funcname: <genexpr>
|
|
abc.py(89): abstracts = set(name
|
|
abc.py(91): if getattr(value, "__isabstractmethod__", False))
|
|
abc.py(89): abstracts = set(name
|
|
abc.py(91): if getattr(value, "__isabstractmethod__", False))
|
|
--- modulename: abc, funcname: <genexpr>
|
|
abc.py(89): abstracts = set(name
|
|
abc.py(91): if getattr(value, "__isabstractmethod__", False))
|
|
--- modulename: abc, funcname: <genexpr>
|
|
abc.py(89): abstracts = set(name
|
|
abc.py(91): if getattr(value, "__isabstractmethod__", False))
|
|
--- modulename: abc, funcname: <genexpr>
|
|
abc.py(89): abstracts = set(name
|
|
abc.py(91): if getattr(value, "__isabstractmethod__", False))
|
|
--- modulename: abc, funcname: <genexpr>
|
|
abc.py(89): abstracts = set(name
|
|
abc.py(91): if getattr(value, "__isabstractmethod__", False))
|
|
abc.py(89): abstracts = set(name
|
|
abc.py(91): if getattr(value, "__isabstractmethod__", False))
|
|
--- modulename: abc, funcname: <genexpr>
|
|
abc.py(89): abstracts = set(name
|
|
abc.py(91): if getattr(value, "__isabstractmethod__", False))
|
|
--- modulename: abc, funcname: <genexpr>
|
|
abc.py(89): abstracts = set(name
|
|
abc.py(91): if getattr(value, "__isabstractmethod__", False))
|
|
abc.py(89): abstracts = set(name
|
|
abc.py(92): for base in bases:
|
|
abc.py(93): for name in getattr(base, "__abstractmethods__", set()):
|
|
abc.py(92): for base in bases:
|
|
abc.py(97): cls.__abstractmethods__ = frozenset(abstracts)
|
|
abc.py(99): cls._abc_registry = WeakSet()
|
|
--- modulename: _weakrefset, funcname: __init__
|
|
_weakrefset.py(37): self.data = set()
|
|
_weakrefset.py(38): def _remove(item, selfref=ref(self)):
|
|
_weakrefset.py(45): self._remove = _remove
|
|
_weakrefset.py(47): self._pending_removals = []
|
|
_weakrefset.py(48): self._iterating = set()
|
|
_weakrefset.py(49): if data is not None:
|
|
abc.py(100): cls._abc_cache = WeakSet()
|
|
--- modulename: _weakrefset, funcname: __init__
|
|
_weakrefset.py(37): self.data = set()
|
|
_weakrefset.py(38): def _remove(item, selfref=ref(self)):
|
|
_weakrefset.py(45): self._remove = _remove
|
|
_weakrefset.py(47): self._pending_removals = []
|
|
_weakrefset.py(48): self._iterating = set()
|
|
_weakrefset.py(49): if data is not None:
|
|
abc.py(101): cls._abc_negative_cache = WeakSet()
|
|
--- modulename: _weakrefset, funcname: __init__
|
|
_weakrefset.py(37): self.data = set()
|
|
_weakrefset.py(38): def _remove(item, selfref=ref(self)):
|
|
_weakrefset.py(45): self._remove = _remove
|
|
_weakrefset.py(47): self._pending_removals = []
|
|
_weakrefset.py(48): self._iterating = set()
|
|
_weakrefset.py(49): if data is not None:
|
|
abc.py(102): cls._abc_negative_cache_version = ABCMeta._abc_invalidation_counter
|
|
abc.py(103): return cls
|
|
numbers.py(166): Complex.register(complex)
|
|
--- modulename: abc, funcname: register
|
|
abc.py(107): if not isinstance(subclass, (type, types.ClassType)):
|
|
abc.py(109): if issubclass(subclass, cls):
|
|
--- modulename: abc, funcname: __subclasscheck__
|
|
abc.py(151): if subclass in cls._abc_cache:
|
|
--- modulename: _weakrefset, funcname: __contains__
|
|
_weakrefset.py(71): try:
|
|
_weakrefset.py(72): wr = ref(item)
|
|
_weakrefset.py(75): return wr in self.data
|
|
abc.py(154): if cls._abc_negative_cache_version < ABCMeta._abc_invalidation_counter:
|
|
abc.py(158): elif subclass in cls._abc_negative_cache:
|
|
--- modulename: _weakrefset, funcname: __contains__
|
|
_weakrefset.py(71): try:
|
|
_weakrefset.py(72): wr = ref(item)
|
|
_weakrefset.py(75): return wr in self.data
|
|
abc.py(161): ok = cls.__subclasshook__(subclass)
|
|
abc.py(162): if ok is not NotImplemented:
|
|
abc.py(170): if cls in getattr(subclass, '__mro__', ()):
|
|
abc.py(174): for rcls in cls._abc_registry:
|
|
--- modulename: _weakrefset, funcname: __iter__
|
|
_weakrefset.py(59): with _IterationGuard(self):
|
|
--- modulename: _weakrefset, funcname: __init__
|
|
_weakrefset.py(18): self.weakcontainer = ref(weakcontainer)
|
|
--- modulename: _weakrefset, funcname: __enter__
|
|
_weakrefset.py(21): w = self.weakcontainer()
|
|
_weakrefset.py(22): if w is not None:
|
|
_weakrefset.py(23): w._iterating.add(self)
|
|
_weakrefset.py(24): return self
|
|
_weakrefset.py(60): for itemref in self.data:
|
|
--- modulename: _weakrefset, funcname: __exit__
|
|
_weakrefset.py(27): w = self.weakcontainer()
|
|
_weakrefset.py(28): if w is not None:
|
|
_weakrefset.py(29): s = w._iterating
|
|
_weakrefset.py(30): s.remove(self)
|
|
_weakrefset.py(31): if not s:
|
|
_weakrefset.py(32): w._commit_removals()
|
|
--- modulename: _weakrefset, funcname: _commit_removals
|
|
_weakrefset.py(53): l = self._pending_removals
|
|
_weakrefset.py(54): discard = self.data.discard
|
|
_weakrefset.py(55): while l:
|
|
abc.py(179): for scls in cls.__subclasses__():
|
|
abc.py(184): cls._abc_negative_cache.add(subclass)
|
|
--- modulename: _weakrefset, funcname: add
|
|
_weakrefset.py(84): if self._pending_removals:
|
|
_weakrefset.py(86): self.data.add(ref(item, self._remove))
|
|
abc.py(185): return False
|
|
abc.py(113): if issubclass(cls, subclass):
|
|
abc.py(116): cls._abc_registry.add(subclass)
|
|
--- modulename: _weakrefset, funcname: add
|
|
_weakrefset.py(84): if self._pending_removals:
|
|
_weakrefset.py(86): self.data.add(ref(item, self._remove))
|
|
abc.py(117): ABCMeta._abc_invalidation_counter += 1 # Invalidate negative cache
|
|
numbers.py(169): class Real(Complex):
|
|
--- modulename: numbers, funcname: Real
|
|
numbers.py(169): class Real(Complex):
|
|
numbers.py(176): """
|
|
numbers.py(178): __slots__ = ()
|
|
numbers.py(180): @abstractmethod
|
|
--- modulename: abc, funcname: abstractmethod
|
|
abc.py(32): funcobj.__isabstractmethod__ = True
|
|
abc.py(33): return funcobj
|
|
numbers.py(187): @abstractmethod
|
|
--- modulename: abc, funcname: abstractmethod
|
|
abc.py(32): funcobj.__isabstractmethod__ = True
|
|
abc.py(33): return funcobj
|
|
numbers.py(200): def __divmod__(self, other):
|
|
numbers.py(208): def __rdivmod__(self, other):
|
|
numbers.py(216): @abstractmethod
|
|
--- modulename: abc, funcname: abstractmethod
|
|
abc.py(32): funcobj.__isabstractmethod__ = True
|
|
abc.py(33): return funcobj
|
|
numbers.py(221): @abstractmethod
|
|
--- modulename: abc, funcname: abstractmethod
|
|
abc.py(32): funcobj.__isabstractmethod__ = True
|
|
abc.py(33): return funcobj
|
|
numbers.py(226): @abstractmethod
|
|
--- modulename: abc, funcname: abstractmethod
|
|
abc.py(32): funcobj.__isabstractmethod__ = True
|
|
abc.py(33): return funcobj
|
|
numbers.py(231): @abstractmethod
|
|
--- modulename: abc, funcname: abstractmethod
|
|
abc.py(32): funcobj.__isabstractmethod__ = True
|
|
abc.py(33): return funcobj
|
|
numbers.py(236): @abstractmethod
|
|
--- modulename: abc, funcname: abstractmethod
|
|
abc.py(32): funcobj.__isabstractmethod__ = True
|
|
abc.py(33): return funcobj
|
|
numbers.py(243): @abstractmethod
|
|
--- modulename: abc, funcname: abstractmethod
|
|
abc.py(32): funcobj.__isabstractmethod__ = True
|
|
abc.py(33): return funcobj
|
|
numbers.py(249): def __complex__(self):
|
|
numbers.py(253): @property
|
|
numbers.py(258): @property
|
|
numbers.py(263): def conjugate(self):
|
|
--- modulename: abc, funcname: __new__
|
|
abc.py(87): cls = super(ABCMeta, mcls).__new__(mcls, name, bases, namespace)
|
|
abc.py(89): abstracts = set(name
|
|
abc.py(90): for name, value in namespace.items()
|
|
--- modulename: abc, funcname: <genexpr>
|
|
abc.py(89): abstracts = set(name
|
|
abc.py(91): if getattr(value, "__isabstractmethod__", False))
|
|
abc.py(89): abstracts = set(name
|
|
abc.py(91): if getattr(value, "__isabstractmethod__", False))
|
|
abc.py(89): abstracts = set(name
|
|
abc.py(91): if getattr(value, "__isabstractmethod__", False))
|
|
--- modulename: abc, funcname: <genexpr>
|
|
abc.py(89): abstracts = set(name
|
|
abc.py(91): if getattr(value, "__isabstractmethod__", False))
|
|
abc.py(89): abstracts = set(name
|
|
abc.py(91): if getattr(value, "__isabstractmethod__", False))
|
|
abc.py(89): abstracts = set(name
|
|
abc.py(91): if getattr(value, "__isabstractmethod__", False))
|
|
--- modulename: abc, funcname: <genexpr>
|
|
abc.py(89): abstracts = set(name
|
|
abc.py(91): if getattr(value, "__isabstractmethod__", False))
|
|
abc.py(89): abstracts = set(name
|
|
abc.py(91): if getattr(value, "__isabstractmethod__", False))
|
|
abc.py(89): abstracts = set(name
|
|
abc.py(91): if getattr(value, "__isabstractmethod__", False))
|
|
abc.py(89): abstracts = set(name
|
|
abc.py(91): if getattr(value, "__isabstractmethod__", False))
|
|
--- modulename: abc, funcname: <genexpr>
|
|
abc.py(89): abstracts = set(name
|
|
abc.py(91): if getattr(value, "__isabstractmethod__", False))
|
|
--- modulename: abc, funcname: <genexpr>
|
|
abc.py(89): abstracts = set(name
|
|
abc.py(91): if getattr(value, "__isabstractmethod__", False))
|
|
abc.py(89): abstracts = set(name
|
|
abc.py(91): if getattr(value, "__isabstractmethod__", False))
|
|
--- modulename: abc, funcname: <genexpr>
|
|
abc.py(89): abstracts = set(name
|
|
abc.py(91): if getattr(value, "__isabstractmethod__", False))
|
|
--- modulename: abc, funcname: <genexpr>
|
|
abc.py(89): abstracts = set(name
|
|
abc.py(91): if getattr(value, "__isabstractmethod__", False))
|
|
--- modulename: abc, funcname: <genexpr>
|
|
abc.py(89): abstracts = set(name
|
|
abc.py(91): if getattr(value, "__isabstractmethod__", False))
|
|
abc.py(89): abstracts = set(name
|
|
abc.py(91): if getattr(value, "__isabstractmethod__", False))
|
|
--- modulename: abc, funcname: <genexpr>
|
|
abc.py(89): abstracts = set(name
|
|
abc.py(92): for base in bases:
|
|
abc.py(93): for name in getattr(base, "__abstractmethods__", set()):
|
|
abc.py(94): value = getattr(cls, name, None)
|
|
abc.py(95): if getattr(value, "__isabstractmethod__", False):
|
|
abc.py(93): for name in getattr(base, "__abstractmethods__", set()):
|
|
abc.py(94): value = getattr(cls, name, None)
|
|
abc.py(95): if getattr(value, "__isabstractmethod__", False):
|
|
abc.py(96): abstracts.add(name)
|
|
abc.py(93): for name in getattr(base, "__abstractmethods__", set()):
|
|
abc.py(94): value = getattr(cls, name, None)
|
|
abc.py(95): if getattr(value, "__isabstractmethod__", False):
|
|
abc.py(93): for name in getattr(base, "__abstractmethods__", set()):
|
|
abc.py(94): value = getattr(cls, name, None)
|
|
abc.py(95): if getattr(value, "__isabstractmethod__", False):
|
|
abc.py(96): abstracts.add(name)
|
|
abc.py(93): for name in getattr(base, "__abstractmethods__", set()):
|
|
abc.py(94): value = getattr(cls, name, None)
|
|
abc.py(95): if getattr(value, "__isabstractmethod__", False):
|
|
abc.py(96): abstracts.add(name)
|
|
abc.py(93): for name in getattr(base, "__abstractmethods__", set()):
|
|
abc.py(94): value = getattr(cls, name, None)
|
|
abc.py(95): if getattr(value, "__isabstractmethod__", False):
|
|
abc.py(96): abstracts.add(name)
|
|
abc.py(93): for name in getattr(base, "__abstractmethods__", set()):
|
|
abc.py(94): value = getattr(cls, name, None)
|
|
abc.py(95): if getattr(value, "__isabstractmethod__", False):
|
|
abc.py(96): abstracts.add(name)
|
|
abc.py(93): for name in getattr(base, "__abstractmethods__", set()):
|
|
abc.py(94): value = getattr(cls, name, None)
|
|
abc.py(95): if getattr(value, "__isabstractmethod__", False):
|
|
abc.py(96): abstracts.add(name)
|
|
abc.py(93): for name in getattr(base, "__abstractmethods__", set()):
|
|
abc.py(94): value = getattr(cls, name, None)
|
|
abc.py(95): if getattr(value, "__isabstractmethod__", False):
|
|
abc.py(93): for name in getattr(base, "__abstractmethods__", set()):
|
|
abc.py(94): value = getattr(cls, name, None)
|
|
abc.py(95): if getattr(value, "__isabstractmethod__", False):
|
|
abc.py(96): abstracts.add(name)
|
|
abc.py(93): for name in getattr(base, "__abstractmethods__", set()):
|
|
abc.py(94): value = getattr(cls, name, None)
|
|
abc.py(95): if getattr(value, "__isabstractmethod__", False):
|
|
abc.py(96): abstracts.add(name)
|
|
abc.py(93): for name in getattr(base, "__abstractmethods__", set()):
|
|
abc.py(94): value = getattr(cls, name, None)
|
|
abc.py(95): if getattr(value, "__isabstractmethod__", False):
|
|
abc.py(93): for name in getattr(base, "__abstractmethods__", set()):
|
|
abc.py(94): value = getattr(cls, name, None)
|
|
abc.py(95): if getattr(value, "__isabstractmethod__", False):
|
|
abc.py(96): abstracts.add(name)
|
|
abc.py(93): for name in getattr(base, "__abstractmethods__", set()):
|
|
abc.py(94): value = getattr(cls, name, None)
|
|
abc.py(95): if getattr(value, "__isabstractmethod__", False):
|
|
abc.py(96): abstracts.add(name)
|
|
abc.py(93): for name in getattr(base, "__abstractmethods__", set()):
|
|
abc.py(94): value = getattr(cls, name, None)
|
|
abc.py(95): if getattr(value, "__isabstractmethod__", False):
|
|
abc.py(96): abstracts.add(name)
|
|
abc.py(93): for name in getattr(base, "__abstractmethods__", set()):
|
|
abc.py(94): value = getattr(cls, name, None)
|
|
abc.py(95): if getattr(value, "__isabstractmethod__", False):
|
|
abc.py(96): abstracts.add(name)
|
|
abc.py(93): for name in getattr(base, "__abstractmethods__", set()):
|
|
abc.py(94): value = getattr(cls, name, None)
|
|
abc.py(95): if getattr(value, "__isabstractmethod__", False):
|
|
abc.py(96): abstracts.add(name)
|
|
abc.py(93): for name in getattr(base, "__abstractmethods__", set()):
|
|
abc.py(94): value = getattr(cls, name, None)
|
|
abc.py(95): if getattr(value, "__isabstractmethod__", False):
|
|
abc.py(96): abstracts.add(name)
|
|
abc.py(93): for name in getattr(base, "__abstractmethods__", set()):
|
|
abc.py(92): for base in bases:
|
|
abc.py(97): cls.__abstractmethods__ = frozenset(abstracts)
|
|
abc.py(99): cls._abc_registry = WeakSet()
|
|
--- modulename: _weakrefset, funcname: __init__
|
|
_weakrefset.py(37): self.data = set()
|
|
_weakrefset.py(38): def _remove(item, selfref=ref(self)):
|
|
_weakrefset.py(45): self._remove = _remove
|
|
_weakrefset.py(47): self._pending_removals = []
|
|
_weakrefset.py(48): self._iterating = set()
|
|
_weakrefset.py(49): if data is not None:
|
|
abc.py(100): cls._abc_cache = WeakSet()
|
|
--- modulename: _weakrefset, funcname: __init__
|
|
_weakrefset.py(37): self.data = set()
|
|
_weakrefset.py(38): def _remove(item, selfref=ref(self)):
|
|
_weakrefset.py(45): self._remove = _remove
|
|
_weakrefset.py(47): self._pending_removals = []
|
|
_weakrefset.py(48): self._iterating = set()
|
|
_weakrefset.py(49): if data is not None:
|
|
abc.py(101): cls._abc_negative_cache = WeakSet()
|
|
--- modulename: _weakrefset, funcname: __init__
|
|
_weakrefset.py(37): self.data = set()
|
|
_weakrefset.py(38): def _remove(item, selfref=ref(self)):
|
|
_weakrefset.py(45): self._remove = _remove
|
|
_weakrefset.py(47): self._pending_removals = []
|
|
_weakrefset.py(48): self._iterating = set()
|
|
_weakrefset.py(49): if data is not None:
|
|
abc.py(102): cls._abc_negative_cache_version = ABCMeta._abc_invalidation_counter
|
|
abc.py(103): return cls
|
|
numbers.py(267): Real.register(float)
|
|
--- modulename: abc, funcname: register
|
|
abc.py(107): if not isinstance(subclass, (type, types.ClassType)):
|
|
abc.py(109): if issubclass(subclass, cls):
|
|
--- modulename: abc, funcname: __subclasscheck__
|
|
abc.py(151): if subclass in cls._abc_cache:
|
|
--- modulename: _weakrefset, funcname: __contains__
|
|
_weakrefset.py(71): try:
|
|
_weakrefset.py(72): wr = ref(item)
|
|
_weakrefset.py(75): return wr in self.data
|
|
abc.py(154): if cls._abc_negative_cache_version < ABCMeta._abc_invalidation_counter:
|
|
abc.py(158): elif subclass in cls._abc_negative_cache:
|
|
--- modulename: _weakrefset, funcname: __contains__
|
|
_weakrefset.py(71): try:
|
|
_weakrefset.py(72): wr = ref(item)
|
|
_weakrefset.py(75): return wr in self.data
|
|
abc.py(161): ok = cls.__subclasshook__(subclass)
|
|
abc.py(162): if ok is not NotImplemented:
|
|
abc.py(170): if cls in getattr(subclass, '__mro__', ()):
|
|
abc.py(174): for rcls in cls._abc_registry:
|
|
--- modulename: _weakrefset, funcname: __iter__
|
|
_weakrefset.py(59): with _IterationGuard(self):
|
|
--- modulename: _weakrefset, funcname: __init__
|
|
_weakrefset.py(18): self.weakcontainer = ref(weakcontainer)
|
|
--- modulename: _weakrefset, funcname: __enter__
|
|
_weakrefset.py(21): w = self.weakcontainer()
|
|
_weakrefset.py(22): if w is not None:
|
|
_weakrefset.py(23): w._iterating.add(self)
|
|
_weakrefset.py(24): return self
|
|
_weakrefset.py(60): for itemref in self.data:
|
|
--- modulename: _weakrefset, funcname: __exit__
|
|
_weakrefset.py(27): w = self.weakcontainer()
|
|
_weakrefset.py(28): if w is not None:
|
|
_weakrefset.py(29): s = w._iterating
|
|
_weakrefset.py(30): s.remove(self)
|
|
_weakrefset.py(31): if not s:
|
|
_weakrefset.py(32): w._commit_removals()
|
|
--- modulename: _weakrefset, funcname: _commit_removals
|
|
_weakrefset.py(53): l = self._pending_removals
|
|
_weakrefset.py(54): discard = self.data.discard
|
|
_weakrefset.py(55): while l:
|
|
abc.py(179): for scls in cls.__subclasses__():
|
|
abc.py(184): cls._abc_negative_cache.add(subclass)
|
|
--- modulename: _weakrefset, funcname: add
|
|
_weakrefset.py(84): if self._pending_removals:
|
|
_weakrefset.py(86): self.data.add(ref(item, self._remove))
|
|
abc.py(185): return False
|
|
abc.py(113): if issubclass(cls, subclass):
|
|
abc.py(116): cls._abc_registry.add(subclass)
|
|
--- modulename: _weakrefset, funcname: add
|
|
_weakrefset.py(84): if self._pending_removals:
|
|
_weakrefset.py(86): self.data.add(ref(item, self._remove))
|
|
abc.py(117): ABCMeta._abc_invalidation_counter += 1 # Invalidate negative cache
|
|
numbers.py(270): class Rational(Real):
|
|
--- modulename: numbers, funcname: Rational
|
|
numbers.py(270): class Rational(Real):
|
|
numbers.py(271): """.numerator and .denominator should be in lowest terms."""
|
|
numbers.py(273): __slots__ = ()
|
|
numbers.py(275): @abstractproperty
|
|
numbers.py(279): @abstractproperty
|
|
numbers.py(284): def __float__(self):
|
|
--- modulename: abc, funcname: __new__
|
|
abc.py(87): cls = super(ABCMeta, mcls).__new__(mcls, name, bases, namespace)
|
|
abc.py(89): abstracts = set(name
|
|
abc.py(90): for name, value in namespace.items()
|
|
--- modulename: abc, funcname: <genexpr>
|
|
abc.py(89): abstracts = set(name
|
|
abc.py(91): if getattr(value, "__isabstractmethod__", False))
|
|
abc.py(89): abstracts = set(name
|
|
abc.py(91): if getattr(value, "__isabstractmethod__", False))
|
|
--- modulename: abc, funcname: <genexpr>
|
|
abc.py(89): abstracts = set(name
|
|
abc.py(91): if getattr(value, "__isabstractmethod__", False))
|
|
--- modulename: abc, funcname: <genexpr>
|
|
abc.py(89): abstracts = set(name
|
|
abc.py(91): if getattr(value, "__isabstractmethod__", False))
|
|
abc.py(89): abstracts = set(name
|
|
abc.py(91): if getattr(value, "__isabstractmethod__", False))
|
|
abc.py(89): abstracts = set(name
|
|
abc.py(91): if getattr(value, "__isabstractmethod__", False))
|
|
abc.py(89): abstracts = set(name
|
|
abc.py(92): for base in bases:
|
|
abc.py(93): for name in getattr(base, "__abstractmethods__", set()):
|
|
abc.py(94): value = getattr(cls, name, None)
|
|
abc.py(95): if getattr(value, "__isabstractmethod__", False):
|
|
abc.py(96): abstracts.add(name)
|
|
abc.py(93): for name in getattr(base, "__abstractmethods__", set()):
|
|
abc.py(94): value = getattr(cls, name, None)
|
|
abc.py(95): if getattr(value, "__isabstractmethod__", False):
|
|
abc.py(96): abstracts.add(name)
|
|
abc.py(93): for name in getattr(base, "__abstractmethods__", set()):
|
|
abc.py(94): value = getattr(cls, name, None)
|
|
abc.py(95): if getattr(value, "__isabstractmethod__", False):
|
|
abc.py(96): abstracts.add(name)
|
|
abc.py(93): for name in getattr(base, "__abstractmethods__", set()):
|
|
abc.py(94): value = getattr(cls, name, None)
|
|
abc.py(95): if getattr(value, "__isabstractmethod__", False):
|
|
abc.py(96): abstracts.add(name)
|
|
abc.py(93): for name in getattr(base, "__abstractmethods__", set()):
|
|
abc.py(94): value = getattr(cls, name, None)
|
|
abc.py(95): if getattr(value, "__isabstractmethod__", False):
|
|
abc.py(96): abstracts.add(name)
|
|
abc.py(93): for name in getattr(base, "__abstractmethods__", set()):
|
|
abc.py(94): value = getattr(cls, name, None)
|
|
abc.py(95): if getattr(value, "__isabstractmethod__", False):
|
|
abc.py(96): abstracts.add(name)
|
|
abc.py(93): for name in getattr(base, "__abstractmethods__", set()):
|
|
abc.py(94): value = getattr(cls, name, None)
|
|
abc.py(95): if getattr(value, "__isabstractmethod__", False):
|
|
abc.py(96): abstracts.add(name)
|
|
abc.py(93): for name in getattr(base, "__abstractmethods__", set()):
|
|
abc.py(94): value = getattr(cls, name, None)
|
|
abc.py(95): if getattr(value, "__isabstractmethod__", False):
|
|
abc.py(96): abstracts.add(name)
|
|
abc.py(93): for name in getattr(base, "__abstractmethods__", set()):
|
|
abc.py(94): value = getattr(cls, name, None)
|
|
abc.py(95): if getattr(value, "__isabstractmethod__", False):
|
|
abc.py(96): abstracts.add(name)
|
|
abc.py(93): for name in getattr(base, "__abstractmethods__", set()):
|
|
abc.py(94): value = getattr(cls, name, None)
|
|
abc.py(95): if getattr(value, "__isabstractmethod__", False):
|
|
abc.py(96): abstracts.add(name)
|
|
abc.py(93): for name in getattr(base, "__abstractmethods__", set()):
|
|
abc.py(94): value = getattr(cls, name, None)
|
|
abc.py(95): if getattr(value, "__isabstractmethod__", False):
|
|
abc.py(93): for name in getattr(base, "__abstractmethods__", set()):
|
|
abc.py(94): value = getattr(cls, name, None)
|
|
abc.py(95): if getattr(value, "__isabstractmethod__", False):
|
|
abc.py(96): abstracts.add(name)
|
|
abc.py(93): for name in getattr(base, "__abstractmethods__", set()):
|
|
abc.py(94): value = getattr(cls, name, None)
|
|
abc.py(95): if getattr(value, "__isabstractmethod__", False):
|
|
abc.py(96): abstracts.add(name)
|
|
abc.py(93): for name in getattr(base, "__abstractmethods__", set()):
|
|
abc.py(94): value = getattr(cls, name, None)
|
|
abc.py(95): if getattr(value, "__isabstractmethod__", False):
|
|
abc.py(96): abstracts.add(name)
|
|
abc.py(93): for name in getattr(base, "__abstractmethods__", set()):
|
|
abc.py(94): value = getattr(cls, name, None)
|
|
abc.py(95): if getattr(value, "__isabstractmethod__", False):
|
|
abc.py(96): abstracts.add(name)
|
|
abc.py(93): for name in getattr(base, "__abstractmethods__", set()):
|
|
abc.py(94): value = getattr(cls, name, None)
|
|
abc.py(95): if getattr(value, "__isabstractmethod__", False):
|
|
abc.py(96): abstracts.add(name)
|
|
abc.py(93): for name in getattr(base, "__abstractmethods__", set()):
|
|
abc.py(94): value = getattr(cls, name, None)
|
|
abc.py(95): if getattr(value, "__isabstractmethod__", False):
|
|
abc.py(96): abstracts.add(name)
|
|
abc.py(93): for name in getattr(base, "__abstractmethods__", set()):
|
|
abc.py(94): value = getattr(cls, name, None)
|
|
abc.py(95): if getattr(value, "__isabstractmethod__", False):
|
|
abc.py(96): abstracts.add(name)
|
|
abc.py(93): for name in getattr(base, "__abstractmethods__", set()):
|
|
abc.py(94): value = getattr(cls, name, None)
|
|
abc.py(95): if getattr(value, "__isabstractmethod__", False):
|
|
abc.py(96): abstracts.add(name)
|
|
abc.py(93): for name in getattr(base, "__abstractmethods__", set()):
|
|
abc.py(94): value = getattr(cls, name, None)
|
|
abc.py(95): if getattr(value, "__isabstractmethod__", False):
|
|
abc.py(96): abstracts.add(name)
|
|
abc.py(93): for name in getattr(base, "__abstractmethods__", set()):
|
|
abc.py(94): value = getattr(cls, name, None)
|
|
abc.py(95): if getattr(value, "__isabstractmethod__", False):
|
|
abc.py(96): abstracts.add(name)
|
|
abc.py(93): for name in getattr(base, "__abstractmethods__", set()):
|
|
abc.py(94): value = getattr(cls, name, None)
|
|
abc.py(95): if getattr(value, "__isabstractmethod__", False):
|
|
abc.py(96): abstracts.add(name)
|
|
abc.py(93): for name in getattr(base, "__abstractmethods__", set()):
|
|
abc.py(92): for base in bases:
|
|
abc.py(97): cls.__abstractmethods__ = frozenset(abstracts)
|
|
abc.py(99): cls._abc_registry = WeakSet()
|
|
--- modulename: _weakrefset, funcname: __init__
|
|
_weakrefset.py(37): self.data = set()
|
|
_weakrefset.py(38): def _remove(item, selfref=ref(self)):
|
|
_weakrefset.py(45): self._remove = _remove
|
|
_weakrefset.py(47): self._pending_removals = []
|
|
_weakrefset.py(48): self._iterating = set()
|
|
_weakrefset.py(49): if data is not None:
|
|
abc.py(100): cls._abc_cache = WeakSet()
|
|
--- modulename: _weakrefset, funcname: __init__
|
|
_weakrefset.py(37): self.data = set()
|
|
_weakrefset.py(38): def _remove(item, selfref=ref(self)):
|
|
_weakrefset.py(45): self._remove = _remove
|
|
_weakrefset.py(47): self._pending_removals = []
|
|
_weakrefset.py(48): self._iterating = set()
|
|
_weakrefset.py(49): if data is not None:
|
|
abc.py(101): cls._abc_negative_cache = WeakSet()
|
|
--- modulename: _weakrefset, funcname: __init__
|
|
_weakrefset.py(37): self.data = set()
|
|
_weakrefset.py(38): def _remove(item, selfref=ref(self)):
|
|
_weakrefset.py(45): self._remove = _remove
|
|
_weakrefset.py(47): self._pending_removals = []
|
|
_weakrefset.py(48): self._iterating = set()
|
|
_weakrefset.py(49): if data is not None:
|
|
abc.py(102): cls._abc_negative_cache_version = ABCMeta._abc_invalidation_counter
|
|
abc.py(103): return cls
|
|
numbers.py(295): class Integral(Rational):
|
|
--- modulename: numbers, funcname: Integral
|
|
numbers.py(295): class Integral(Rational):
|
|
numbers.py(296): """Integral adds a conversion to long and the bit-string operations."""
|
|
numbers.py(298): __slots__ = ()
|
|
numbers.py(300): @abstractmethod
|
|
--- modulename: abc, funcname: abstractmethod
|
|
abc.py(32): funcobj.__isabstractmethod__ = True
|
|
abc.py(33): return funcobj
|
|
numbers.py(305): def __index__(self):
|
|
numbers.py(309): @abstractmethod
|
|
numbers.py(310): def __pow__(self, exponent, modulus=None):
|
|
--- modulename: abc, funcname: abstractmethod
|
|
abc.py(32): funcobj.__isabstractmethod__ = True
|
|
abc.py(33): return funcobj
|
|
numbers.py(320): @abstractmethod
|
|
--- modulename: abc, funcname: abstractmethod
|
|
abc.py(32): funcobj.__isabstractmethod__ = True
|
|
abc.py(33): return funcobj
|
|
numbers.py(325): @abstractmethod
|
|
--- modulename: abc, funcname: abstractmethod
|
|
abc.py(32): funcobj.__isabstractmethod__ = True
|
|
abc.py(33): return funcobj
|
|
numbers.py(330): @abstractmethod
|
|
--- modulename: abc, funcname: abstractmethod
|
|
abc.py(32): funcobj.__isabstractmethod__ = True
|
|
abc.py(33): return funcobj
|
|
numbers.py(335): @abstractmethod
|
|
--- modulename: abc, funcname: abstractmethod
|
|
abc.py(32): funcobj.__isabstractmethod__ = True
|
|
abc.py(33): return funcobj
|
|
numbers.py(340): @abstractmethod
|
|
--- modulename: abc, funcname: abstractmethod
|
|
abc.py(32): funcobj.__isabstractmethod__ = True
|
|
abc.py(33): return funcobj
|
|
numbers.py(345): @abstractmethod
|
|
--- modulename: abc, funcname: abstractmethod
|
|
abc.py(32): funcobj.__isabstractmethod__ = True
|
|
abc.py(33): return funcobj
|
|
numbers.py(350): @abstractmethod
|
|
--- modulename: abc, funcname: abstractmethod
|
|
abc.py(32): funcobj.__isabstractmethod__ = True
|
|
abc.py(33): return funcobj
|
|
numbers.py(355): @abstractmethod
|
|
--- modulename: abc, funcname: abstractmethod
|
|
abc.py(32): funcobj.__isabstractmethod__ = True
|
|
abc.py(33): return funcobj
|
|
numbers.py(360): @abstractmethod
|
|
--- modulename: abc, funcname: abstractmethod
|
|
abc.py(32): funcobj.__isabstractmethod__ = True
|
|
abc.py(33): return funcobj
|
|
numbers.py(365): @abstractmethod
|
|
--- modulename: abc, funcname: abstractmethod
|
|
abc.py(32): funcobj.__isabstractmethod__ = True
|
|
abc.py(33): return funcobj
|
|
numbers.py(370): @abstractmethod
|
|
--- modulename: abc, funcname: abstractmethod
|
|
abc.py(32): funcobj.__isabstractmethod__ = True
|
|
abc.py(33): return funcobj
|
|
numbers.py(376): def __float__(self):
|
|
numbers.py(380): @property
|
|
numbers.py(385): @property
|
|
--- modulename: abc, funcname: __new__
|
|
abc.py(87): cls = super(ABCMeta, mcls).__new__(mcls, name, bases, namespace)
|
|
abc.py(89): abstracts = set(name
|
|
abc.py(90): for name, value in namespace.items()
|
|
--- modulename: abc, funcname: <genexpr>
|
|
abc.py(89): abstracts = set(name
|
|
abc.py(91): if getattr(value, "__isabstractmethod__", False))
|
|
--- modulename: abc, funcname: <genexpr>
|
|
abc.py(89): abstracts = set(name
|
|
abc.py(91): if getattr(value, "__isabstractmethod__", False))
|
|
--- modulename: abc, funcname: <genexpr>
|
|
abc.py(89): abstracts = set(name
|
|
abc.py(91): if getattr(value, "__isabstractmethod__", False))
|
|
abc.py(89): abstracts = set(name
|
|
abc.py(91): if getattr(value, "__isabstractmethod__", False))
|
|
--- modulename: abc, funcname: <genexpr>
|
|
abc.py(89): abstracts = set(name
|
|
abc.py(91): if getattr(value, "__isabstractmethod__", False))
|
|
--- modulename: abc, funcname: <genexpr>
|
|
abc.py(89): abstracts = set(name
|
|
abc.py(91): if getattr(value, "__isabstractmethod__", False))
|
|
abc.py(89): abstracts = set(name
|
|
abc.py(91): if getattr(value, "__isabstractmethod__", False))
|
|
abc.py(89): abstracts = set(name
|
|
abc.py(91): if getattr(value, "__isabstractmethod__", False))
|
|
--- modulename: abc, funcname: <genexpr>
|
|
abc.py(89): abstracts = set(name
|
|
abc.py(91): if getattr(value, "__isabstractmethod__", False))
|
|
--- modulename: abc, funcname: <genexpr>
|
|
abc.py(89): abstracts = set(name
|
|
abc.py(91): if getattr(value, "__isabstractmethod__", False))
|
|
--- modulename: abc, funcname: <genexpr>
|
|
abc.py(89): abstracts = set(name
|
|
abc.py(91): if getattr(value, "__isabstractmethod__", False))
|
|
abc.py(89): abstracts = set(name
|
|
abc.py(91): if getattr(value, "__isabstractmethod__", False))
|
|
--- modulename: abc, funcname: <genexpr>
|
|
abc.py(89): abstracts = set(name
|
|
abc.py(91): if getattr(value, "__isabstractmethod__", False))
|
|
--- modulename: abc, funcname: <genexpr>
|
|
abc.py(89): abstracts = set(name
|
|
abc.py(91): if getattr(value, "__isabstractmethod__", False))
|
|
--- modulename: abc, funcname: <genexpr>
|
|
abc.py(89): abstracts = set(name
|
|
abc.py(91): if getattr(value, "__isabstractmethod__", False))
|
|
--- modulename: abc, funcname: <genexpr>
|
|
abc.py(89): abstracts = set(name
|
|
abc.py(91): if getattr(value, "__isabstractmethod__", False))
|
|
abc.py(89): abstracts = set(name
|
|
abc.py(91): if getattr(value, "__isabstractmethod__", False))
|
|
--- modulename: abc, funcname: <genexpr>
|
|
abc.py(89): abstracts = set(name
|
|
abc.py(91): if getattr(value, "__isabstractmethod__", False))
|
|
abc.py(89): abstracts = set(name
|
|
abc.py(91): if getattr(value, "__isabstractmethod__", False))
|
|
abc.py(89): abstracts = set(name
|
|
abc.py(91): if getattr(value, "__isabstractmethod__", False))
|
|
--- modulename: abc, funcname: <genexpr>
|
|
abc.py(89): abstracts = set(name
|
|
abc.py(92): for base in bases:
|
|
abc.py(93): for name in getattr(base, "__abstractmethods__", set()):
|
|
abc.py(94): value = getattr(cls, name, None)
|
|
abc.py(95): if getattr(value, "__isabstractmethod__", False):
|
|
abc.py(96): abstracts.add(name)
|
|
abc.py(93): for name in getattr(base, "__abstractmethods__", set()):
|
|
abc.py(94): value = getattr(cls, name, None)
|
|
abc.py(95): if getattr(value, "__isabstractmethod__", False):
|
|
abc.py(93): for name in getattr(base, "__abstractmethods__", set()):
|
|
abc.py(94): value = getattr(cls, name, None)
|
|
abc.py(95): if getattr(value, "__isabstractmethod__", False):
|
|
abc.py(96): abstracts.add(name)
|
|
abc.py(93): for name in getattr(base, "__abstractmethods__", set()):
|
|
abc.py(94): value = getattr(cls, name, None)
|
|
abc.py(95): if getattr(value, "__isabstractmethod__", False):
|
|
abc.py(96): abstracts.add(name)
|
|
abc.py(93): for name in getattr(base, "__abstractmethods__", set()):
|
|
abc.py(94): value = getattr(cls, name, None)
|
|
abc.py(95): if getattr(value, "__isabstractmethod__", False):
|
|
abc.py(96): abstracts.add(name)
|
|
abc.py(93): for name in getattr(base, "__abstractmethods__", set()):
|
|
abc.py(94): value = getattr(cls, name, None)
|
|
abc.py(95): if getattr(value, "__isabstractmethod__", False):
|
|
abc.py(96): abstracts.add(name)
|
|
abc.py(93): for name in getattr(base, "__abstractmethods__", set()):
|
|
abc.py(94): value = getattr(cls, name, None)
|
|
abc.py(95): if getattr(value, "__isabstractmethod__", False):
|
|
abc.py(96): abstracts.add(name)
|
|
abc.py(93): for name in getattr(base, "__abstractmethods__", set()):
|
|
abc.py(94): value = getattr(cls, name, None)
|
|
abc.py(95): if getattr(value, "__isabstractmethod__", False):
|
|
abc.py(96): abstracts.add(name)
|
|
abc.py(93): for name in getattr(base, "__abstractmethods__", set()):
|
|
abc.py(94): value = getattr(cls, name, None)
|
|
abc.py(95): if getattr(value, "__isabstractmethod__", False):
|
|
abc.py(96): abstracts.add(name)
|
|
abc.py(93): for name in getattr(base, "__abstractmethods__", set()):
|
|
abc.py(94): value = getattr(cls, name, None)
|
|
abc.py(95): if getattr(value, "__isabstractmethod__", False):
|
|
abc.py(96): abstracts.add(name)
|
|
abc.py(93): for name in getattr(base, "__abstractmethods__", set()):
|
|
abc.py(94): value = getattr(cls, name, None)
|
|
abc.py(95): if getattr(value, "__isabstractmethod__", False):
|
|
abc.py(96): abstracts.add(name)
|
|
abc.py(93): for name in getattr(base, "__abstractmethods__", set()):
|
|
abc.py(94): value = getattr(cls, name, None)
|
|
abc.py(95): if getattr(value, "__isabstractmethod__", False):
|
|
abc.py(96): abstracts.add(name)
|
|
abc.py(93): for name in getattr(base, "__abstractmethods__", set()):
|
|
abc.py(94): value = getattr(cls, name, None)
|
|
abc.py(95): if getattr(value, "__isabstractmethod__", False):
|
|
abc.py(96): abstracts.add(name)
|
|
abc.py(93): for name in getattr(base, "__abstractmethods__", set()):
|
|
abc.py(94): value = getattr(cls, name, None)
|
|
abc.py(95): if getattr(value, "__isabstractmethod__", False):
|
|
abc.py(96): abstracts.add(name)
|
|
abc.py(93): for name in getattr(base, "__abstractmethods__", set()):
|
|
abc.py(94): value = getattr(cls, name, None)
|
|
abc.py(95): if getattr(value, "__isabstractmethod__", False):
|
|
abc.py(93): for name in getattr(base, "__abstractmethods__", set()):
|
|
abc.py(94): value = getattr(cls, name, None)
|
|
abc.py(95): if getattr(value, "__isabstractmethod__", False):
|
|
abc.py(96): abstracts.add(name)
|
|
abc.py(93): for name in getattr(base, "__abstractmethods__", set()):
|
|
abc.py(94): value = getattr(cls, name, None)
|
|
abc.py(95): if getattr(value, "__isabstractmethod__", False):
|
|
abc.py(96): abstracts.add(name)
|
|
abc.py(93): for name in getattr(base, "__abstractmethods__", set()):
|
|
abc.py(94): value = getattr(cls, name, None)
|
|
abc.py(95): if getattr(value, "__isabstractmethod__", False):
|
|
abc.py(96): abstracts.add(name)
|
|
abc.py(93): for name in getattr(base, "__abstractmethods__", set()):
|
|
abc.py(94): value = getattr(cls, name, None)
|
|
abc.py(95): if getattr(value, "__isabstractmethod__", False):
|
|
abc.py(96): abstracts.add(name)
|
|
abc.py(93): for name in getattr(base, "__abstractmethods__", set()):
|
|
abc.py(94): value = getattr(cls, name, None)
|
|
abc.py(95): if getattr(value, "__isabstractmethod__", False):
|
|
abc.py(96): abstracts.add(name)
|
|
abc.py(93): for name in getattr(base, "__abstractmethods__", set()):
|
|
abc.py(94): value = getattr(cls, name, None)
|
|
abc.py(95): if getattr(value, "__isabstractmethod__", False):
|
|
abc.py(96): abstracts.add(name)
|
|
abc.py(93): for name in getattr(base, "__abstractmethods__", set()):
|
|
abc.py(94): value = getattr(cls, name, None)
|
|
abc.py(95): if getattr(value, "__isabstractmethod__", False):
|
|
abc.py(96): abstracts.add(name)
|
|
abc.py(93): for name in getattr(base, "__abstractmethods__", set()):
|
|
abc.py(94): value = getattr(cls, name, None)
|
|
abc.py(95): if getattr(value, "__isabstractmethod__", False):
|
|
abc.py(96): abstracts.add(name)
|
|
abc.py(93): for name in getattr(base, "__abstractmethods__", set()):
|
|
abc.py(92): for base in bases:
|
|
abc.py(97): cls.__abstractmethods__ = frozenset(abstracts)
|
|
abc.py(99): cls._abc_registry = WeakSet()
|
|
--- modulename: _weakrefset, funcname: __init__
|
|
_weakrefset.py(37): self.data = set()
|
|
_weakrefset.py(38): def _remove(item, selfref=ref(self)):
|
|
_weakrefset.py(45): self._remove = _remove
|
|
_weakrefset.py(47): self._pending_removals = []
|
|
_weakrefset.py(48): self._iterating = set()
|
|
_weakrefset.py(49): if data is not None:
|
|
abc.py(100): cls._abc_cache = WeakSet()
|
|
--- modulename: _weakrefset, funcname: __init__
|
|
_weakrefset.py(37): self.data = set()
|
|
_weakrefset.py(38): def _remove(item, selfref=ref(self)):
|
|
_weakrefset.py(45): self._remove = _remove
|
|
_weakrefset.py(47): self._pending_removals = []
|
|
_weakrefset.py(48): self._iterating = set()
|
|
_weakrefset.py(49): if data is not None:
|
|
abc.py(101): cls._abc_negative_cache = WeakSet()
|
|
--- modulename: _weakrefset, funcname: __init__
|
|
_weakrefset.py(37): self.data = set()
|
|
_weakrefset.py(38): def _remove(item, selfref=ref(self)):
|
|
_weakrefset.py(45): self._remove = _remove
|
|
_weakrefset.py(47): self._pending_removals = []
|
|
_weakrefset.py(48): self._iterating = set()
|
|
_weakrefset.py(49): if data is not None:
|
|
abc.py(102): cls._abc_negative_cache_version = ABCMeta._abc_invalidation_counter
|
|
abc.py(103): return cls
|
|
numbers.py(390): Integral.register(int)
|
|
--- modulename: abc, funcname: register
|
|
abc.py(107): if not isinstance(subclass, (type, types.ClassType)):
|
|
abc.py(109): if issubclass(subclass, cls):
|
|
--- modulename: abc, funcname: __subclasscheck__
|
|
abc.py(151): if subclass in cls._abc_cache:
|
|
--- modulename: _weakrefset, funcname: __contains__
|
|
_weakrefset.py(71): try:
|
|
_weakrefset.py(72): wr = ref(item)
|
|
_weakrefset.py(75): return wr in self.data
|
|
abc.py(154): if cls._abc_negative_cache_version < ABCMeta._abc_invalidation_counter:
|
|
abc.py(158): elif subclass in cls._abc_negative_cache:
|
|
--- modulename: _weakrefset, funcname: __contains__
|
|
_weakrefset.py(71): try:
|
|
_weakrefset.py(72): wr = ref(item)
|
|
_weakrefset.py(75): return wr in self.data
|
|
abc.py(161): ok = cls.__subclasshook__(subclass)
|
|
abc.py(162): if ok is not NotImplemented:
|
|
abc.py(170): if cls in getattr(subclass, '__mro__', ()):
|
|
abc.py(174): for rcls in cls._abc_registry:
|
|
--- modulename: _weakrefset, funcname: __iter__
|
|
_weakrefset.py(59): with _IterationGuard(self):
|
|
--- modulename: _weakrefset, funcname: __init__
|
|
_weakrefset.py(18): self.weakcontainer = ref(weakcontainer)
|
|
--- modulename: _weakrefset, funcname: __enter__
|
|
_weakrefset.py(21): w = self.weakcontainer()
|
|
_weakrefset.py(22): if w is not None:
|
|
_weakrefset.py(23): w._iterating.add(self)
|
|
_weakrefset.py(24): return self
|
|
_weakrefset.py(60): for itemref in self.data:
|
|
--- modulename: _weakrefset, funcname: __exit__
|
|
_weakrefset.py(27): w = self.weakcontainer()
|
|
_weakrefset.py(28): if w is not None:
|
|
_weakrefset.py(29): s = w._iterating
|
|
_weakrefset.py(30): s.remove(self)
|
|
_weakrefset.py(31): if not s:
|
|
_weakrefset.py(32): w._commit_removals()
|
|
--- modulename: _weakrefset, funcname: _commit_removals
|
|
_weakrefset.py(53): l = self._pending_removals
|
|
_weakrefset.py(54): discard = self.data.discard
|
|
_weakrefset.py(55): while l:
|
|
abc.py(179): for scls in cls.__subclasses__():
|
|
abc.py(184): cls._abc_negative_cache.add(subclass)
|
|
--- modulename: _weakrefset, funcname: add
|
|
_weakrefset.py(84): if self._pending_removals:
|
|
_weakrefset.py(86): self.data.add(ref(item, self._remove))
|
|
abc.py(185): return False
|
|
abc.py(113): if issubclass(cls, subclass):
|
|
abc.py(116): cls._abc_registry.add(subclass)
|
|
--- modulename: _weakrefset, funcname: add
|
|
_weakrefset.py(84): if self._pending_removals:
|
|
_weakrefset.py(86): self.data.add(ref(item, self._remove))
|
|
abc.py(117): ABCMeta._abc_invalidation_counter += 1 # Invalidate negative cache
|
|
numbers.py(391): Integral.register(long)
|
|
--- modulename: abc, funcname: register
|
|
abc.py(107): if not isinstance(subclass, (type, types.ClassType)):
|
|
abc.py(109): if issubclass(subclass, cls):
|
|
--- modulename: abc, funcname: __subclasscheck__
|
|
abc.py(151): if subclass in cls._abc_cache:
|
|
--- modulename: _weakrefset, funcname: __contains__
|
|
_weakrefset.py(71): try:
|
|
_weakrefset.py(72): wr = ref(item)
|
|
_weakrefset.py(75): return wr in self.data
|
|
abc.py(154): if cls._abc_negative_cache_version < ABCMeta._abc_invalidation_counter:
|
|
abc.py(156): cls._abc_negative_cache = WeakSet()
|
|
--- modulename: _weakrefset, funcname: __init__
|
|
_weakrefset.py(37): self.data = set()
|
|
_weakrefset.py(38): def _remove(item, selfref=ref(self)):
|
|
_weakrefset.py(45): self._remove = _remove
|
|
_weakrefset.py(47): self._pending_removals = []
|
|
_weakrefset.py(48): self._iterating = set()
|
|
_weakrefset.py(49): if data is not None:
|
|
abc.py(157): cls._abc_negative_cache_version = ABCMeta._abc_invalidation_counter
|
|
abc.py(161): ok = cls.__subclasshook__(subclass)
|
|
abc.py(162): if ok is not NotImplemented:
|
|
abc.py(170): if cls in getattr(subclass, '__mro__', ()):
|
|
abc.py(174): for rcls in cls._abc_registry:
|
|
--- modulename: _weakrefset, funcname: __iter__
|
|
_weakrefset.py(59): with _IterationGuard(self):
|
|
--- modulename: _weakrefset, funcname: __init__
|
|
_weakrefset.py(18): self.weakcontainer = ref(weakcontainer)
|
|
--- modulename: _weakrefset, funcname: __enter__
|
|
_weakrefset.py(21): w = self.weakcontainer()
|
|
_weakrefset.py(22): if w is not None:
|
|
_weakrefset.py(23): w._iterating.add(self)
|
|
_weakrefset.py(24): return self
|
|
_weakrefset.py(60): for itemref in self.data:
|
|
_weakrefset.py(61): item = itemref()
|
|
_weakrefset.py(62): if item is not None:
|
|
_weakrefset.py(65): yield item
|
|
abc.py(175): if issubclass(subclass, rcls):
|
|
abc.py(174): for rcls in cls._abc_registry:
|
|
--- modulename: _weakrefset, funcname: __iter__
|
|
_weakrefset.py(60): for itemref in self.data:
|
|
--- modulename: _weakrefset, funcname: __exit__
|
|
_weakrefset.py(27): w = self.weakcontainer()
|
|
_weakrefset.py(28): if w is not None:
|
|
_weakrefset.py(29): s = w._iterating
|
|
_weakrefset.py(30): s.remove(self)
|
|
_weakrefset.py(31): if not s:
|
|
_weakrefset.py(32): w._commit_removals()
|
|
--- modulename: _weakrefset, funcname: _commit_removals
|
|
_weakrefset.py(53): l = self._pending_removals
|
|
_weakrefset.py(54): discard = self.data.discard
|
|
_weakrefset.py(55): while l:
|
|
abc.py(179): for scls in cls.__subclasses__():
|
|
abc.py(184): cls._abc_negative_cache.add(subclass)
|
|
--- modulename: _weakrefset, funcname: add
|
|
_weakrefset.py(84): if self._pending_removals:
|
|
_weakrefset.py(86): self.data.add(ref(item, self._remove))
|
|
abc.py(185): return False
|
|
abc.py(113): if issubclass(cls, subclass):
|
|
abc.py(116): cls._abc_registry.add(subclass)
|
|
--- modulename: _weakrefset, funcname: add
|
|
_weakrefset.py(84): if self._pending_removals:
|
|
_weakrefset.py(86): self.data.add(ref(item, self._remove))
|
|
abc.py(117): ABCMeta._abc_invalidation_counter += 1 # Invalidate negative cache
|
|
TL.py(7): from binascii import hexlify
|
|
TL.py(9): class TlConstructor:
|
|
--- modulename: TL, funcname: TlConstructor
|
|
TL.py(9): class TlConstructor:
|
|
TL.py(10): def __init__(self, json_dict):
|
|
TL.py(30): class TlMethod:
|
|
--- modulename: TL, funcname: TlMethod
|
|
TL.py(30): class TlMethod:
|
|
TL.py(31): def __init__(self, json_dict):
|
|
TL.py(38): class TLObject(dict):
|
|
--- modulename: TL, funcname: TLObject
|
|
TL.py(38): class TLObject(dict):
|
|
TL.py(39): def __init__(self, tl_elem):
|
|
TL.py(42): class TL:
|
|
--- modulename: TL, funcname: TL
|
|
TL.py(42): class TL:
|
|
TL.py(43): def __init__(self, filename):
|
|
TL.py(67): tl = TL(os.path.join(os.path.dirname(__file__), "TL_schema.JSON"))
|
|
--- modulename: posixpath, funcname: dirname
|
|
posixpath.py(129): i = p.rfind('/') + 1
|
|
posixpath.py(130): head = p[:i]
|
|
posixpath.py(131): if head and head != '/'*len(head):
|
|
posixpath.py(133): return head
|
|
--- modulename: posixpath, funcname: join
|
|
posixpath.py(73): path = a
|
|
posixpath.py(74): for b in p:
|
|
posixpath.py(75): if b.startswith('/'):
|
|
posixpath.py(77): elif path == '' or path.endswith('/'):
|
|
posixpath.py(78): path += b
|
|
posixpath.py(74): for b in p:
|
|
posixpath.py(81): return path
|
|
--- modulename: TL, funcname: __init__
|
|
TL.py(44): with open(filename, 'r') as f:
|
|
TL.py(45): TL_dict = json.load(f)
|
|
--- modulename: __init__, funcname: load
|
|
__init__.py(286): return loads(fp.read(),
|
|
__init__.py(287): encoding=encoding, cls=cls, object_hook=object_hook,
|
|
__init__.py(288): parse_float=parse_float, parse_int=parse_int,
|
|
__init__.py(289): parse_constant=parse_constant, object_pairs_hook=object_pairs_hook,
|
|
__init__.py(290): **kw)
|
|
--- modulename: __init__, funcname: loads
|
|
__init__.py(335): if (cls is None and encoding is None and object_hook is None and
|
|
__init__.py(336): parse_int is None and parse_float is None and
|
|
__init__.py(337): parse_constant is None and object_pairs_hook is None and not kw):
|
|
__init__.py(338): return _default_decoder.decode(s)
|
|
--- modulename: decoder, funcname: decode
|
|
decoder.py(366): obj, end = self.raw_decode(s, idx=_w(s, 0).end())
|
|
--- modulename: decoder, funcname: raw_decode
|
|
decoder.py(381): try:
|
|
decoder.py(382): obj, end = self.scan_once(s, idx)
|
|
decoder.py(385): return obj, end
|
|
decoder.py(367): end = _w(s, end).end()
|
|
decoder.py(368): if end != len(s):
|
|
decoder.py(370): return obj
|
|
TL.py(49): self.constructors = TL_dict['constructors']
|
|
TL.py(50): self.constructor_id = {}
|
|
TL.py(51): self.constructor_type = {}
|
|
TL.py(52): for elem in self.constructors:
|
|
TL.py(53): z = TlConstructor(elem)
|
|
--- modulename: TL, funcname: __init__
|
|
TL.py(11): self.id = int(json_dict['id'])
|
|
TL.py(12): self.type = json_dict['type']
|
|
TL.py(13): self.predicate = json_dict['predicate']
|
|
TL.py(14): self.params = []
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(54): self.constructor_id[z.id] = z
|
|
TL.py(55): self.constructor_type[z.predicate] = z
|
|
TL.py(52): for elem in self.constructors:
|
|
TL.py(53): z = TlConstructor(elem)
|
|
--- modulename: TL, funcname: __init__
|
|
TL.py(11): self.id = int(json_dict['id'])
|
|
TL.py(12): self.type = json_dict['type']
|
|
TL.py(13): self.predicate = json_dict['predicate']
|
|
TL.py(14): self.params = []
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(17): if param['type'] == "Vector<long>":
|
|
TL.py(20): elif param['type'] == "vector<%Message>":
|
|
TL.py(23): elif param['type'] == "vector<future_salt>":
|
|
TL.py(27): param['subtype'] = None
|
|
TL.py(28): self.params.append(param)
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(17): if param['type'] == "Vector<long>":
|
|
TL.py(20): elif param['type'] == "vector<%Message>":
|
|
TL.py(23): elif param['type'] == "vector<future_salt>":
|
|
TL.py(27): param['subtype'] = None
|
|
TL.py(28): self.params.append(param)
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(17): if param['type'] == "Vector<long>":
|
|
TL.py(20): elif param['type'] == "vector<%Message>":
|
|
TL.py(23): elif param['type'] == "vector<future_salt>":
|
|
TL.py(27): param['subtype'] = None
|
|
TL.py(28): self.params.append(param)
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(17): if param['type'] == "Vector<long>":
|
|
TL.py(18): param['type'] = "Vector t"
|
|
TL.py(19): param['subtype'] = "long"
|
|
TL.py(28): self.params.append(param)
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(54): self.constructor_id[z.id] = z
|
|
TL.py(55): self.constructor_type[z.predicate] = z
|
|
TL.py(52): for elem in self.constructors:
|
|
TL.py(53): z = TlConstructor(elem)
|
|
--- modulename: TL, funcname: __init__
|
|
TL.py(11): self.id = int(json_dict['id'])
|
|
TL.py(12): self.type = json_dict['type']
|
|
TL.py(13): self.predicate = json_dict['predicate']
|
|
TL.py(14): self.params = []
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(17): if param['type'] == "Vector<long>":
|
|
TL.py(20): elif param['type'] == "vector<%Message>":
|
|
TL.py(23): elif param['type'] == "vector<future_salt>":
|
|
TL.py(27): param['subtype'] = None
|
|
TL.py(28): self.params.append(param)
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(17): if param['type'] == "Vector<long>":
|
|
TL.py(20): elif param['type'] == "vector<%Message>":
|
|
TL.py(23): elif param['type'] == "vector<future_salt>":
|
|
TL.py(27): param['subtype'] = None
|
|
TL.py(28): self.params.append(param)
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(17): if param['type'] == "Vector<long>":
|
|
TL.py(20): elif param['type'] == "vector<%Message>":
|
|
TL.py(23): elif param['type'] == "vector<future_salt>":
|
|
TL.py(27): param['subtype'] = None
|
|
TL.py(28): self.params.append(param)
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(17): if param['type'] == "Vector<long>":
|
|
TL.py(20): elif param['type'] == "vector<%Message>":
|
|
TL.py(23): elif param['type'] == "vector<future_salt>":
|
|
TL.py(27): param['subtype'] = None
|
|
TL.py(28): self.params.append(param)
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(17): if param['type'] == "Vector<long>":
|
|
TL.py(20): elif param['type'] == "vector<%Message>":
|
|
TL.py(23): elif param['type'] == "vector<future_salt>":
|
|
TL.py(27): param['subtype'] = None
|
|
TL.py(28): self.params.append(param)
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(17): if param['type'] == "Vector<long>":
|
|
TL.py(20): elif param['type'] == "vector<%Message>":
|
|
TL.py(23): elif param['type'] == "vector<future_salt>":
|
|
TL.py(27): param['subtype'] = None
|
|
TL.py(28): self.params.append(param)
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(54): self.constructor_id[z.id] = z
|
|
TL.py(55): self.constructor_type[z.predicate] = z
|
|
TL.py(52): for elem in self.constructors:
|
|
TL.py(53): z = TlConstructor(elem)
|
|
--- modulename: TL, funcname: __init__
|
|
TL.py(11): self.id = int(json_dict['id'])
|
|
TL.py(12): self.type = json_dict['type']
|
|
TL.py(13): self.predicate = json_dict['predicate']
|
|
TL.py(14): self.params = []
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(17): if param['type'] == "Vector<long>":
|
|
TL.py(20): elif param['type'] == "vector<%Message>":
|
|
TL.py(23): elif param['type'] == "vector<future_salt>":
|
|
TL.py(27): param['subtype'] = None
|
|
TL.py(28): self.params.append(param)
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(17): if param['type'] == "Vector<long>":
|
|
TL.py(20): elif param['type'] == "vector<%Message>":
|
|
TL.py(23): elif param['type'] == "vector<future_salt>":
|
|
TL.py(27): param['subtype'] = None
|
|
TL.py(28): self.params.append(param)
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(17): if param['type'] == "Vector<long>":
|
|
TL.py(20): elif param['type'] == "vector<%Message>":
|
|
TL.py(23): elif param['type'] == "vector<future_salt>":
|
|
TL.py(27): param['subtype'] = None
|
|
TL.py(28): self.params.append(param)
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(17): if param['type'] == "Vector<long>":
|
|
TL.py(20): elif param['type'] == "vector<%Message>":
|
|
TL.py(23): elif param['type'] == "vector<future_salt>":
|
|
TL.py(27): param['subtype'] = None
|
|
TL.py(28): self.params.append(param)
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(17): if param['type'] == "Vector<long>":
|
|
TL.py(20): elif param['type'] == "vector<%Message>":
|
|
TL.py(23): elif param['type'] == "vector<future_salt>":
|
|
TL.py(27): param['subtype'] = None
|
|
TL.py(28): self.params.append(param)
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(17): if param['type'] == "Vector<long>":
|
|
TL.py(20): elif param['type'] == "vector<%Message>":
|
|
TL.py(23): elif param['type'] == "vector<future_salt>":
|
|
TL.py(27): param['subtype'] = None
|
|
TL.py(28): self.params.append(param)
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(17): if param['type'] == "Vector<long>":
|
|
TL.py(20): elif param['type'] == "vector<%Message>":
|
|
TL.py(23): elif param['type'] == "vector<future_salt>":
|
|
TL.py(27): param['subtype'] = None
|
|
TL.py(28): self.params.append(param)
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(54): self.constructor_id[z.id] = z
|
|
TL.py(55): self.constructor_type[z.predicate] = z
|
|
TL.py(52): for elem in self.constructors:
|
|
TL.py(53): z = TlConstructor(elem)
|
|
--- modulename: TL, funcname: __init__
|
|
TL.py(11): self.id = int(json_dict['id'])
|
|
TL.py(12): self.type = json_dict['type']
|
|
TL.py(13): self.predicate = json_dict['predicate']
|
|
TL.py(14): self.params = []
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(17): if param['type'] == "Vector<long>":
|
|
TL.py(20): elif param['type'] == "vector<%Message>":
|
|
TL.py(23): elif param['type'] == "vector<future_salt>":
|
|
TL.py(27): param['subtype'] = None
|
|
TL.py(28): self.params.append(param)
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(17): if param['type'] == "Vector<long>":
|
|
TL.py(20): elif param['type'] == "vector<%Message>":
|
|
TL.py(23): elif param['type'] == "vector<future_salt>":
|
|
TL.py(27): param['subtype'] = None
|
|
TL.py(28): self.params.append(param)
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(17): if param['type'] == "Vector<long>":
|
|
TL.py(20): elif param['type'] == "vector<%Message>":
|
|
TL.py(23): elif param['type'] == "vector<future_salt>":
|
|
TL.py(27): param['subtype'] = None
|
|
TL.py(28): self.params.append(param)
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(54): self.constructor_id[z.id] = z
|
|
TL.py(55): self.constructor_type[z.predicate] = z
|
|
TL.py(52): for elem in self.constructors:
|
|
TL.py(53): z = TlConstructor(elem)
|
|
--- modulename: TL, funcname: __init__
|
|
TL.py(11): self.id = int(json_dict['id'])
|
|
TL.py(12): self.type = json_dict['type']
|
|
TL.py(13): self.predicate = json_dict['predicate']
|
|
TL.py(14): self.params = []
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(17): if param['type'] == "Vector<long>":
|
|
TL.py(20): elif param['type'] == "vector<%Message>":
|
|
TL.py(23): elif param['type'] == "vector<future_salt>":
|
|
TL.py(27): param['subtype'] = None
|
|
TL.py(28): self.params.append(param)
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(17): if param['type'] == "Vector<long>":
|
|
TL.py(20): elif param['type'] == "vector<%Message>":
|
|
TL.py(23): elif param['type'] == "vector<future_salt>":
|
|
TL.py(27): param['subtype'] = None
|
|
TL.py(28): self.params.append(param)
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(17): if param['type'] == "Vector<long>":
|
|
TL.py(20): elif param['type'] == "vector<%Message>":
|
|
TL.py(23): elif param['type'] == "vector<future_salt>":
|
|
TL.py(27): param['subtype'] = None
|
|
TL.py(28): self.params.append(param)
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(54): self.constructor_id[z.id] = z
|
|
TL.py(55): self.constructor_type[z.predicate] = z
|
|
TL.py(52): for elem in self.constructors:
|
|
TL.py(53): z = TlConstructor(elem)
|
|
--- modulename: TL, funcname: __init__
|
|
TL.py(11): self.id = int(json_dict['id'])
|
|
TL.py(12): self.type = json_dict['type']
|
|
TL.py(13): self.predicate = json_dict['predicate']
|
|
TL.py(14): self.params = []
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(17): if param['type'] == "Vector<long>":
|
|
TL.py(20): elif param['type'] == "vector<%Message>":
|
|
TL.py(23): elif param['type'] == "vector<future_salt>":
|
|
TL.py(27): param['subtype'] = None
|
|
TL.py(28): self.params.append(param)
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(17): if param['type'] == "Vector<long>":
|
|
TL.py(20): elif param['type'] == "vector<%Message>":
|
|
TL.py(23): elif param['type'] == "vector<future_salt>":
|
|
TL.py(27): param['subtype'] = None
|
|
TL.py(28): self.params.append(param)
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(17): if param['type'] == "Vector<long>":
|
|
TL.py(20): elif param['type'] == "vector<%Message>":
|
|
TL.py(23): elif param['type'] == "vector<future_salt>":
|
|
TL.py(27): param['subtype'] = None
|
|
TL.py(28): self.params.append(param)
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(17): if param['type'] == "Vector<long>":
|
|
TL.py(20): elif param['type'] == "vector<%Message>":
|
|
TL.py(23): elif param['type'] == "vector<future_salt>":
|
|
TL.py(27): param['subtype'] = None
|
|
TL.py(28): self.params.append(param)
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(17): if param['type'] == "Vector<long>":
|
|
TL.py(20): elif param['type'] == "vector<%Message>":
|
|
TL.py(23): elif param['type'] == "vector<future_salt>":
|
|
TL.py(27): param['subtype'] = None
|
|
TL.py(28): self.params.append(param)
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(17): if param['type'] == "Vector<long>":
|
|
TL.py(20): elif param['type'] == "vector<%Message>":
|
|
TL.py(23): elif param['type'] == "vector<future_salt>":
|
|
TL.py(27): param['subtype'] = None
|
|
TL.py(28): self.params.append(param)
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(54): self.constructor_id[z.id] = z
|
|
TL.py(55): self.constructor_type[z.predicate] = z
|
|
TL.py(52): for elem in self.constructors:
|
|
TL.py(53): z = TlConstructor(elem)
|
|
--- modulename: TL, funcname: __init__
|
|
TL.py(11): self.id = int(json_dict['id'])
|
|
TL.py(12): self.type = json_dict['type']
|
|
TL.py(13): self.predicate = json_dict['predicate']
|
|
TL.py(14): self.params = []
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(17): if param['type'] == "Vector<long>":
|
|
TL.py(20): elif param['type'] == "vector<%Message>":
|
|
TL.py(23): elif param['type'] == "vector<future_salt>":
|
|
TL.py(27): param['subtype'] = None
|
|
TL.py(28): self.params.append(param)
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(17): if param['type'] == "Vector<long>":
|
|
TL.py(20): elif param['type'] == "vector<%Message>":
|
|
TL.py(23): elif param['type'] == "vector<future_salt>":
|
|
TL.py(27): param['subtype'] = None
|
|
TL.py(28): self.params.append(param)
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(17): if param['type'] == "Vector<long>":
|
|
TL.py(20): elif param['type'] == "vector<%Message>":
|
|
TL.py(23): elif param['type'] == "vector<future_salt>":
|
|
TL.py(27): param['subtype'] = None
|
|
TL.py(28): self.params.append(param)
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(17): if param['type'] == "Vector<long>":
|
|
TL.py(20): elif param['type'] == "vector<%Message>":
|
|
TL.py(23): elif param['type'] == "vector<future_salt>":
|
|
TL.py(27): param['subtype'] = None
|
|
TL.py(28): self.params.append(param)
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(54): self.constructor_id[z.id] = z
|
|
TL.py(55): self.constructor_type[z.predicate] = z
|
|
TL.py(52): for elem in self.constructors:
|
|
TL.py(53): z = TlConstructor(elem)
|
|
--- modulename: TL, funcname: __init__
|
|
TL.py(11): self.id = int(json_dict['id'])
|
|
TL.py(12): self.type = json_dict['type']
|
|
TL.py(13): self.predicate = json_dict['predicate']
|
|
TL.py(14): self.params = []
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(17): if param['type'] == "Vector<long>":
|
|
TL.py(20): elif param['type'] == "vector<%Message>":
|
|
TL.py(23): elif param['type'] == "vector<future_salt>":
|
|
TL.py(27): param['subtype'] = None
|
|
TL.py(28): self.params.append(param)
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(17): if param['type'] == "Vector<long>":
|
|
TL.py(20): elif param['type'] == "vector<%Message>":
|
|
TL.py(23): elif param['type'] == "vector<future_salt>":
|
|
TL.py(27): param['subtype'] = None
|
|
TL.py(28): self.params.append(param)
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(17): if param['type'] == "Vector<long>":
|
|
TL.py(20): elif param['type'] == "vector<%Message>":
|
|
TL.py(23): elif param['type'] == "vector<future_salt>":
|
|
TL.py(27): param['subtype'] = None
|
|
TL.py(28): self.params.append(param)
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(54): self.constructor_id[z.id] = z
|
|
TL.py(55): self.constructor_type[z.predicate] = z
|
|
TL.py(52): for elem in self.constructors:
|
|
TL.py(53): z = TlConstructor(elem)
|
|
--- modulename: TL, funcname: __init__
|
|
TL.py(11): self.id = int(json_dict['id'])
|
|
TL.py(12): self.type = json_dict['type']
|
|
TL.py(13): self.predicate = json_dict['predicate']
|
|
TL.py(14): self.params = []
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(17): if param['type'] == "Vector<long>":
|
|
TL.py(20): elif param['type'] == "vector<%Message>":
|
|
TL.py(23): elif param['type'] == "vector<future_salt>":
|
|
TL.py(27): param['subtype'] = None
|
|
TL.py(28): self.params.append(param)
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(17): if param['type'] == "Vector<long>":
|
|
TL.py(20): elif param['type'] == "vector<%Message>":
|
|
TL.py(23): elif param['type'] == "vector<future_salt>":
|
|
TL.py(27): param['subtype'] = None
|
|
TL.py(28): self.params.append(param)
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(17): if param['type'] == "Vector<long>":
|
|
TL.py(20): elif param['type'] == "vector<%Message>":
|
|
TL.py(23): elif param['type'] == "vector<future_salt>":
|
|
TL.py(27): param['subtype'] = None
|
|
TL.py(28): self.params.append(param)
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(54): self.constructor_id[z.id] = z
|
|
TL.py(55): self.constructor_type[z.predicate] = z
|
|
TL.py(52): for elem in self.constructors:
|
|
TL.py(53): z = TlConstructor(elem)
|
|
--- modulename: TL, funcname: __init__
|
|
TL.py(11): self.id = int(json_dict['id'])
|
|
TL.py(12): self.type = json_dict['type']
|
|
TL.py(13): self.predicate = json_dict['predicate']
|
|
TL.py(14): self.params = []
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(17): if param['type'] == "Vector<long>":
|
|
TL.py(20): elif param['type'] == "vector<%Message>":
|
|
TL.py(23): elif param['type'] == "vector<future_salt>":
|
|
TL.py(27): param['subtype'] = None
|
|
TL.py(28): self.params.append(param)
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(17): if param['type'] == "Vector<long>":
|
|
TL.py(20): elif param['type'] == "vector<%Message>":
|
|
TL.py(23): elif param['type'] == "vector<future_salt>":
|
|
TL.py(27): param['subtype'] = None
|
|
TL.py(28): self.params.append(param)
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(17): if param['type'] == "Vector<long>":
|
|
TL.py(20): elif param['type'] == "vector<%Message>":
|
|
TL.py(23): elif param['type'] == "vector<future_salt>":
|
|
TL.py(27): param['subtype'] = None
|
|
TL.py(28): self.params.append(param)
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(54): self.constructor_id[z.id] = z
|
|
TL.py(55): self.constructor_type[z.predicate] = z
|
|
TL.py(52): for elem in self.constructors:
|
|
TL.py(53): z = TlConstructor(elem)
|
|
--- modulename: TL, funcname: __init__
|
|
TL.py(11): self.id = int(json_dict['id'])
|
|
TL.py(12): self.type = json_dict['type']
|
|
TL.py(13): self.predicate = json_dict['predicate']
|
|
TL.py(14): self.params = []
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(17): if param['type'] == "Vector<long>":
|
|
TL.py(20): elif param['type'] == "vector<%Message>":
|
|
TL.py(23): elif param['type'] == "vector<future_salt>":
|
|
TL.py(27): param['subtype'] = None
|
|
TL.py(28): self.params.append(param)
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(17): if param['type'] == "Vector<long>":
|
|
TL.py(20): elif param['type'] == "vector<%Message>":
|
|
TL.py(23): elif param['type'] == "vector<future_salt>":
|
|
TL.py(27): param['subtype'] = None
|
|
TL.py(28): self.params.append(param)
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(54): self.constructor_id[z.id] = z
|
|
TL.py(55): self.constructor_type[z.predicate] = z
|
|
TL.py(52): for elem in self.constructors:
|
|
TL.py(53): z = TlConstructor(elem)
|
|
--- modulename: TL, funcname: __init__
|
|
TL.py(11): self.id = int(json_dict['id'])
|
|
TL.py(12): self.type = json_dict['type']
|
|
TL.py(13): self.predicate = json_dict['predicate']
|
|
TL.py(14): self.params = []
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(17): if param['type'] == "Vector<long>":
|
|
TL.py(20): elif param['type'] == "vector<%Message>":
|
|
TL.py(23): elif param['type'] == "vector<future_salt>":
|
|
TL.py(27): param['subtype'] = None
|
|
TL.py(28): self.params.append(param)
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(17): if param['type'] == "Vector<long>":
|
|
TL.py(20): elif param['type'] == "vector<%Message>":
|
|
TL.py(23): elif param['type'] == "vector<future_salt>":
|
|
TL.py(27): param['subtype'] = None
|
|
TL.py(28): self.params.append(param)
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(54): self.constructor_id[z.id] = z
|
|
TL.py(55): self.constructor_type[z.predicate] = z
|
|
TL.py(52): for elem in self.constructors:
|
|
TL.py(53): z = TlConstructor(elem)
|
|
--- modulename: TL, funcname: __init__
|
|
TL.py(11): self.id = int(json_dict['id'])
|
|
TL.py(12): self.type = json_dict['type']
|
|
TL.py(13): self.predicate = json_dict['predicate']
|
|
TL.py(14): self.params = []
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(54): self.constructor_id[z.id] = z
|
|
TL.py(55): self.constructor_type[z.predicate] = z
|
|
TL.py(52): for elem in self.constructors:
|
|
TL.py(53): z = TlConstructor(elem)
|
|
--- modulename: TL, funcname: __init__
|
|
TL.py(11): self.id = int(json_dict['id'])
|
|
TL.py(12): self.type = json_dict['type']
|
|
TL.py(13): self.predicate = json_dict['predicate']
|
|
TL.py(14): self.params = []
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(54): self.constructor_id[z.id] = z
|
|
TL.py(55): self.constructor_type[z.predicate] = z
|
|
TL.py(52): for elem in self.constructors:
|
|
TL.py(53): z = TlConstructor(elem)
|
|
--- modulename: TL, funcname: __init__
|
|
TL.py(11): self.id = int(json_dict['id'])
|
|
TL.py(12): self.type = json_dict['type']
|
|
TL.py(13): self.predicate = json_dict['predicate']
|
|
TL.py(14): self.params = []
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(17): if param['type'] == "Vector<long>":
|
|
TL.py(20): elif param['type'] == "vector<%Message>":
|
|
TL.py(23): elif param['type'] == "vector<future_salt>":
|
|
TL.py(27): param['subtype'] = None
|
|
TL.py(28): self.params.append(param)
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(17): if param['type'] == "Vector<long>":
|
|
TL.py(20): elif param['type'] == "vector<%Message>":
|
|
TL.py(23): elif param['type'] == "vector<future_salt>":
|
|
TL.py(27): param['subtype'] = None
|
|
TL.py(28): self.params.append(param)
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(17): if param['type'] == "Vector<long>":
|
|
TL.py(20): elif param['type'] == "vector<%Message>":
|
|
TL.py(23): elif param['type'] == "vector<future_salt>":
|
|
TL.py(27): param['subtype'] = None
|
|
TL.py(28): self.params.append(param)
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(54): self.constructor_id[z.id] = z
|
|
TL.py(55): self.constructor_type[z.predicate] = z
|
|
TL.py(52): for elem in self.constructors:
|
|
TL.py(53): z = TlConstructor(elem)
|
|
--- modulename: TL, funcname: __init__
|
|
TL.py(11): self.id = int(json_dict['id'])
|
|
TL.py(12): self.type = json_dict['type']
|
|
TL.py(13): self.predicate = json_dict['predicate']
|
|
TL.py(14): self.params = []
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(17): if param['type'] == "Vector<long>":
|
|
TL.py(20): elif param['type'] == "vector<%Message>":
|
|
TL.py(23): elif param['type'] == "vector<future_salt>":
|
|
TL.py(27): param['subtype'] = None
|
|
TL.py(28): self.params.append(param)
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(17): if param['type'] == "Vector<long>":
|
|
TL.py(20): elif param['type'] == "vector<%Message>":
|
|
TL.py(23): elif param['type'] == "vector<future_salt>":
|
|
TL.py(27): param['subtype'] = None
|
|
TL.py(28): self.params.append(param)
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(17): if param['type'] == "Vector<long>":
|
|
TL.py(20): elif param['type'] == "vector<%Message>":
|
|
TL.py(23): elif param['type'] == "vector<future_salt>":
|
|
TL.py(27): param['subtype'] = None
|
|
TL.py(28): self.params.append(param)
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(54): self.constructor_id[z.id] = z
|
|
TL.py(55): self.constructor_type[z.predicate] = z
|
|
TL.py(52): for elem in self.constructors:
|
|
TL.py(53): z = TlConstructor(elem)
|
|
--- modulename: TL, funcname: __init__
|
|
TL.py(11): self.id = int(json_dict['id'])
|
|
TL.py(12): self.type = json_dict['type']
|
|
TL.py(13): self.predicate = json_dict['predicate']
|
|
TL.py(14): self.params = []
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(17): if param['type'] == "Vector<long>":
|
|
TL.py(20): elif param['type'] == "vector<%Message>":
|
|
TL.py(23): elif param['type'] == "vector<future_salt>":
|
|
TL.py(27): param['subtype'] = None
|
|
TL.py(28): self.params.append(param)
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(17): if param['type'] == "Vector<long>":
|
|
TL.py(20): elif param['type'] == "vector<%Message>":
|
|
TL.py(23): elif param['type'] == "vector<future_salt>":
|
|
TL.py(27): param['subtype'] = None
|
|
TL.py(28): self.params.append(param)
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(17): if param['type'] == "Vector<long>":
|
|
TL.py(20): elif param['type'] == "vector<%Message>":
|
|
TL.py(23): elif param['type'] == "vector<future_salt>":
|
|
TL.py(24): param['type'] = "vector"
|
|
TL.py(25): param['subtype'] = "future_salt"
|
|
TL.py(28): self.params.append(param)
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(54): self.constructor_id[z.id] = z
|
|
TL.py(55): self.constructor_type[z.predicate] = z
|
|
TL.py(52): for elem in self.constructors:
|
|
TL.py(53): z = TlConstructor(elem)
|
|
--- modulename: TL, funcname: __init__
|
|
TL.py(11): self.id = int(json_dict['id'])
|
|
TL.py(12): self.type = json_dict['type']
|
|
TL.py(13): self.predicate = json_dict['predicate']
|
|
TL.py(14): self.params = []
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(17): if param['type'] == "Vector<long>":
|
|
TL.py(20): elif param['type'] == "vector<%Message>":
|
|
TL.py(23): elif param['type'] == "vector<future_salt>":
|
|
TL.py(27): param['subtype'] = None
|
|
TL.py(28): self.params.append(param)
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(17): if param['type'] == "Vector<long>":
|
|
TL.py(20): elif param['type'] == "vector<%Message>":
|
|
TL.py(23): elif param['type'] == "vector<future_salt>":
|
|
TL.py(27): param['subtype'] = None
|
|
TL.py(28): self.params.append(param)
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(54): self.constructor_id[z.id] = z
|
|
TL.py(55): self.constructor_type[z.predicate] = z
|
|
TL.py(52): for elem in self.constructors:
|
|
TL.py(53): z = TlConstructor(elem)
|
|
--- modulename: TL, funcname: __init__
|
|
TL.py(11): self.id = int(json_dict['id'])
|
|
TL.py(12): self.type = json_dict['type']
|
|
TL.py(13): self.predicate = json_dict['predicate']
|
|
TL.py(14): self.params = []
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(17): if param['type'] == "Vector<long>":
|
|
TL.py(20): elif param['type'] == "vector<%Message>":
|
|
TL.py(23): elif param['type'] == "vector<future_salt>":
|
|
TL.py(27): param['subtype'] = None
|
|
TL.py(28): self.params.append(param)
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(54): self.constructor_id[z.id] = z
|
|
TL.py(55): self.constructor_type[z.predicate] = z
|
|
TL.py(52): for elem in self.constructors:
|
|
TL.py(53): z = TlConstructor(elem)
|
|
--- modulename: TL, funcname: __init__
|
|
TL.py(11): self.id = int(json_dict['id'])
|
|
TL.py(12): self.type = json_dict['type']
|
|
TL.py(13): self.predicate = json_dict['predicate']
|
|
TL.py(14): self.params = []
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(17): if param['type'] == "Vector<long>":
|
|
TL.py(20): elif param['type'] == "vector<%Message>":
|
|
TL.py(23): elif param['type'] == "vector<future_salt>":
|
|
TL.py(27): param['subtype'] = None
|
|
TL.py(28): self.params.append(param)
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(54): self.constructor_id[z.id] = z
|
|
TL.py(55): self.constructor_type[z.predicate] = z
|
|
TL.py(52): for elem in self.constructors:
|
|
TL.py(53): z = TlConstructor(elem)
|
|
--- modulename: TL, funcname: __init__
|
|
TL.py(11): self.id = int(json_dict['id'])
|
|
TL.py(12): self.type = json_dict['type']
|
|
TL.py(13): self.predicate = json_dict['predicate']
|
|
TL.py(14): self.params = []
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(17): if param['type'] == "Vector<long>":
|
|
TL.py(20): elif param['type'] == "vector<%Message>":
|
|
TL.py(23): elif param['type'] == "vector<future_salt>":
|
|
TL.py(27): param['subtype'] = None
|
|
TL.py(28): self.params.append(param)
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(17): if param['type'] == "Vector<long>":
|
|
TL.py(20): elif param['type'] == "vector<%Message>":
|
|
TL.py(23): elif param['type'] == "vector<future_salt>":
|
|
TL.py(27): param['subtype'] = None
|
|
TL.py(28): self.params.append(param)
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(17): if param['type'] == "Vector<long>":
|
|
TL.py(20): elif param['type'] == "vector<%Message>":
|
|
TL.py(23): elif param['type'] == "vector<future_salt>":
|
|
TL.py(27): param['subtype'] = None
|
|
TL.py(28): self.params.append(param)
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(54): self.constructor_id[z.id] = z
|
|
TL.py(55): self.constructor_type[z.predicate] = z
|
|
TL.py(52): for elem in self.constructors:
|
|
TL.py(53): z = TlConstructor(elem)
|
|
--- modulename: TL, funcname: __init__
|
|
TL.py(11): self.id = int(json_dict['id'])
|
|
TL.py(12): self.type = json_dict['type']
|
|
TL.py(13): self.predicate = json_dict['predicate']
|
|
TL.py(14): self.params = []
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(17): if param['type'] == "Vector<long>":
|
|
TL.py(20): elif param['type'] == "vector<%Message>":
|
|
TL.py(21): param['type'] = "vector"
|
|
TL.py(22): param['subtype'] = "message"
|
|
TL.py(28): self.params.append(param)
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(54): self.constructor_id[z.id] = z
|
|
TL.py(55): self.constructor_type[z.predicate] = z
|
|
TL.py(52): for elem in self.constructors:
|
|
TL.py(53): z = TlConstructor(elem)
|
|
--- modulename: TL, funcname: __init__
|
|
TL.py(11): self.id = int(json_dict['id'])
|
|
TL.py(12): self.type = json_dict['type']
|
|
TL.py(13): self.predicate = json_dict['predicate']
|
|
TL.py(14): self.params = []
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(17): if param['type'] == "Vector<long>":
|
|
TL.py(20): elif param['type'] == "vector<%Message>":
|
|
TL.py(23): elif param['type'] == "vector<future_salt>":
|
|
TL.py(27): param['subtype'] = None
|
|
TL.py(28): self.params.append(param)
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(17): if param['type'] == "Vector<long>":
|
|
TL.py(20): elif param['type'] == "vector<%Message>":
|
|
TL.py(23): elif param['type'] == "vector<future_salt>":
|
|
TL.py(27): param['subtype'] = None
|
|
TL.py(28): self.params.append(param)
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(17): if param['type'] == "Vector<long>":
|
|
TL.py(20): elif param['type'] == "vector<%Message>":
|
|
TL.py(23): elif param['type'] == "vector<future_salt>":
|
|
TL.py(27): param['subtype'] = None
|
|
TL.py(28): self.params.append(param)
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(17): if param['type'] == "Vector<long>":
|
|
TL.py(20): elif param['type'] == "vector<%Message>":
|
|
TL.py(23): elif param['type'] == "vector<future_salt>":
|
|
TL.py(27): param['subtype'] = None
|
|
TL.py(28): self.params.append(param)
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(54): self.constructor_id[z.id] = z
|
|
TL.py(55): self.constructor_type[z.predicate] = z
|
|
TL.py(52): for elem in self.constructors:
|
|
TL.py(53): z = TlConstructor(elem)
|
|
--- modulename: TL, funcname: __init__
|
|
TL.py(11): self.id = int(json_dict['id'])
|
|
TL.py(12): self.type = json_dict['type']
|
|
TL.py(13): self.predicate = json_dict['predicate']
|
|
TL.py(14): self.params = []
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(17): if param['type'] == "Vector<long>":
|
|
TL.py(20): elif param['type'] == "vector<%Message>":
|
|
TL.py(23): elif param['type'] == "vector<future_salt>":
|
|
TL.py(27): param['subtype'] = None
|
|
TL.py(28): self.params.append(param)
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(54): self.constructor_id[z.id] = z
|
|
TL.py(55): self.constructor_type[z.predicate] = z
|
|
TL.py(52): for elem in self.constructors:
|
|
TL.py(53): z = TlConstructor(elem)
|
|
--- modulename: TL, funcname: __init__
|
|
TL.py(11): self.id = int(json_dict['id'])
|
|
TL.py(12): self.type = json_dict['type']
|
|
TL.py(13): self.predicate = json_dict['predicate']
|
|
TL.py(14): self.params = []
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(17): if param['type'] == "Vector<long>":
|
|
TL.py(20): elif param['type'] == "vector<%Message>":
|
|
TL.py(23): elif param['type'] == "vector<future_salt>":
|
|
TL.py(27): param['subtype'] = None
|
|
TL.py(28): self.params.append(param)
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(54): self.constructor_id[z.id] = z
|
|
TL.py(55): self.constructor_type[z.predicate] = z
|
|
TL.py(52): for elem in self.constructors:
|
|
TL.py(53): z = TlConstructor(elem)
|
|
--- modulename: TL, funcname: __init__
|
|
TL.py(11): self.id = int(json_dict['id'])
|
|
TL.py(12): self.type = json_dict['type']
|
|
TL.py(13): self.predicate = json_dict['predicate']
|
|
TL.py(14): self.params = []
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(17): if param['type'] == "Vector<long>":
|
|
TL.py(18): param['type'] = "Vector t"
|
|
TL.py(19): param['subtype'] = "long"
|
|
TL.py(28): self.params.append(param)
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(54): self.constructor_id[z.id] = z
|
|
TL.py(55): self.constructor_type[z.predicate] = z
|
|
TL.py(52): for elem in self.constructors:
|
|
TL.py(53): z = TlConstructor(elem)
|
|
--- modulename: TL, funcname: __init__
|
|
TL.py(11): self.id = int(json_dict['id'])
|
|
TL.py(12): self.type = json_dict['type']
|
|
TL.py(13): self.predicate = json_dict['predicate']
|
|
TL.py(14): self.params = []
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(17): if param['type'] == "Vector<long>":
|
|
TL.py(20): elif param['type'] == "vector<%Message>":
|
|
TL.py(23): elif param['type'] == "vector<future_salt>":
|
|
TL.py(27): param['subtype'] = None
|
|
TL.py(28): self.params.append(param)
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(17): if param['type'] == "Vector<long>":
|
|
TL.py(20): elif param['type'] == "vector<%Message>":
|
|
TL.py(23): elif param['type'] == "vector<future_salt>":
|
|
TL.py(27): param['subtype'] = None
|
|
TL.py(28): self.params.append(param)
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(17): if param['type'] == "Vector<long>":
|
|
TL.py(20): elif param['type'] == "vector<%Message>":
|
|
TL.py(23): elif param['type'] == "vector<future_salt>":
|
|
TL.py(27): param['subtype'] = None
|
|
TL.py(28): self.params.append(param)
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(54): self.constructor_id[z.id] = z
|
|
TL.py(55): self.constructor_type[z.predicate] = z
|
|
TL.py(52): for elem in self.constructors:
|
|
TL.py(53): z = TlConstructor(elem)
|
|
--- modulename: TL, funcname: __init__
|
|
TL.py(11): self.id = int(json_dict['id'])
|
|
TL.py(12): self.type = json_dict['type']
|
|
TL.py(13): self.predicate = json_dict['predicate']
|
|
TL.py(14): self.params = []
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(17): if param['type'] == "Vector<long>":
|
|
TL.py(20): elif param['type'] == "vector<%Message>":
|
|
TL.py(23): elif param['type'] == "vector<future_salt>":
|
|
TL.py(27): param['subtype'] = None
|
|
TL.py(28): self.params.append(param)
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(17): if param['type'] == "Vector<long>":
|
|
TL.py(20): elif param['type'] == "vector<%Message>":
|
|
TL.py(23): elif param['type'] == "vector<future_salt>":
|
|
TL.py(27): param['subtype'] = None
|
|
TL.py(28): self.params.append(param)
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(17): if param['type'] == "Vector<long>":
|
|
TL.py(20): elif param['type'] == "vector<%Message>":
|
|
TL.py(23): elif param['type'] == "vector<future_salt>":
|
|
TL.py(27): param['subtype'] = None
|
|
TL.py(28): self.params.append(param)
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(17): if param['type'] == "Vector<long>":
|
|
TL.py(20): elif param['type'] == "vector<%Message>":
|
|
TL.py(23): elif param['type'] == "vector<future_salt>":
|
|
TL.py(27): param['subtype'] = None
|
|
TL.py(28): self.params.append(param)
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(54): self.constructor_id[z.id] = z
|
|
TL.py(55): self.constructor_type[z.predicate] = z
|
|
TL.py(52): for elem in self.constructors:
|
|
TL.py(53): z = TlConstructor(elem)
|
|
--- modulename: TL, funcname: __init__
|
|
TL.py(11): self.id = int(json_dict['id'])
|
|
TL.py(12): self.type = json_dict['type']
|
|
TL.py(13): self.predicate = json_dict['predicate']
|
|
TL.py(14): self.params = []
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(17): if param['type'] == "Vector<long>":
|
|
TL.py(18): param['type'] = "Vector t"
|
|
TL.py(19): param['subtype'] = "long"
|
|
TL.py(28): self.params.append(param)
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(54): self.constructor_id[z.id] = z
|
|
TL.py(55): self.constructor_type[z.predicate] = z
|
|
TL.py(52): for elem in self.constructors:
|
|
TL.py(53): z = TlConstructor(elem)
|
|
--- modulename: TL, funcname: __init__
|
|
TL.py(11): self.id = int(json_dict['id'])
|
|
TL.py(12): self.type = json_dict['type']
|
|
TL.py(13): self.predicate = json_dict['predicate']
|
|
TL.py(14): self.params = []
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(17): if param['type'] == "Vector<long>":
|
|
TL.py(18): param['type'] = "Vector t"
|
|
TL.py(19): param['subtype'] = "long"
|
|
TL.py(28): self.params.append(param)
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(54): self.constructor_id[z.id] = z
|
|
TL.py(55): self.constructor_type[z.predicate] = z
|
|
TL.py(52): for elem in self.constructors:
|
|
TL.py(53): z = TlConstructor(elem)
|
|
--- modulename: TL, funcname: __init__
|
|
TL.py(11): self.id = int(json_dict['id'])
|
|
TL.py(12): self.type = json_dict['type']
|
|
TL.py(13): self.predicate = json_dict['predicate']
|
|
TL.py(14): self.params = []
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(17): if param['type'] == "Vector<long>":
|
|
TL.py(20): elif param['type'] == "vector<%Message>":
|
|
TL.py(23): elif param['type'] == "vector<future_salt>":
|
|
TL.py(27): param['subtype'] = None
|
|
TL.py(28): self.params.append(param)
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(17): if param['type'] == "Vector<long>":
|
|
TL.py(20): elif param['type'] == "vector<%Message>":
|
|
TL.py(23): elif param['type'] == "vector<future_salt>":
|
|
TL.py(27): param['subtype'] = None
|
|
TL.py(28): self.params.append(param)
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(54): self.constructor_id[z.id] = z
|
|
TL.py(55): self.constructor_type[z.predicate] = z
|
|
TL.py(52): for elem in self.constructors:
|
|
TL.py(53): z = TlConstructor(elem)
|
|
--- modulename: TL, funcname: __init__
|
|
TL.py(11): self.id = int(json_dict['id'])
|
|
TL.py(12): self.type = json_dict['type']
|
|
TL.py(13): self.predicate = json_dict['predicate']
|
|
TL.py(14): self.params = []
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(17): if param['type'] == "Vector<long>":
|
|
TL.py(18): param['type'] = "Vector t"
|
|
TL.py(19): param['subtype'] = "long"
|
|
TL.py(28): self.params.append(param)
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(17): if param['type'] == "Vector<long>":
|
|
TL.py(20): elif param['type'] == "vector<%Message>":
|
|
TL.py(23): elif param['type'] == "vector<future_salt>":
|
|
TL.py(27): param['subtype'] = None
|
|
TL.py(28): self.params.append(param)
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(54): self.constructor_id[z.id] = z
|
|
TL.py(55): self.constructor_type[z.predicate] = z
|
|
TL.py(52): for elem in self.constructors:
|
|
TL.py(53): z = TlConstructor(elem)
|
|
--- modulename: TL, funcname: __init__
|
|
TL.py(11): self.id = int(json_dict['id'])
|
|
TL.py(12): self.type = json_dict['type']
|
|
TL.py(13): self.predicate = json_dict['predicate']
|
|
TL.py(14): self.params = []
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(17): if param['type'] == "Vector<long>":
|
|
TL.py(20): elif param['type'] == "vector<%Message>":
|
|
TL.py(23): elif param['type'] == "vector<future_salt>":
|
|
TL.py(27): param['subtype'] = None
|
|
TL.py(28): self.params.append(param)
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(17): if param['type'] == "Vector<long>":
|
|
TL.py(20): elif param['type'] == "vector<%Message>":
|
|
TL.py(23): elif param['type'] == "vector<future_salt>":
|
|
TL.py(27): param['subtype'] = None
|
|
TL.py(28): self.params.append(param)
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(17): if param['type'] == "Vector<long>":
|
|
TL.py(20): elif param['type'] == "vector<%Message>":
|
|
TL.py(23): elif param['type'] == "vector<future_salt>":
|
|
TL.py(27): param['subtype'] = None
|
|
TL.py(28): self.params.append(param)
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(17): if param['type'] == "Vector<long>":
|
|
TL.py(20): elif param['type'] == "vector<%Message>":
|
|
TL.py(23): elif param['type'] == "vector<future_salt>":
|
|
TL.py(27): param['subtype'] = None
|
|
TL.py(28): self.params.append(param)
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(54): self.constructor_id[z.id] = z
|
|
TL.py(55): self.constructor_type[z.predicate] = z
|
|
TL.py(52): for elem in self.constructors:
|
|
TL.py(53): z = TlConstructor(elem)
|
|
--- modulename: TL, funcname: __init__
|
|
TL.py(11): self.id = int(json_dict['id'])
|
|
TL.py(12): self.type = json_dict['type']
|
|
TL.py(13): self.predicate = json_dict['predicate']
|
|
TL.py(14): self.params = []
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(17): if param['type'] == "Vector<long>":
|
|
TL.py(20): elif param['type'] == "vector<%Message>":
|
|
TL.py(23): elif param['type'] == "vector<future_salt>":
|
|
TL.py(27): param['subtype'] = None
|
|
TL.py(28): self.params.append(param)
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(17): if param['type'] == "Vector<long>":
|
|
TL.py(20): elif param['type'] == "vector<%Message>":
|
|
TL.py(23): elif param['type'] == "vector<future_salt>":
|
|
TL.py(27): param['subtype'] = None
|
|
TL.py(28): self.params.append(param)
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(17): if param['type'] == "Vector<long>":
|
|
TL.py(20): elif param['type'] == "vector<%Message>":
|
|
TL.py(23): elif param['type'] == "vector<future_salt>":
|
|
TL.py(27): param['subtype'] = None
|
|
TL.py(28): self.params.append(param)
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(54): self.constructor_id[z.id] = z
|
|
TL.py(55): self.constructor_type[z.predicate] = z
|
|
TL.py(52): for elem in self.constructors:
|
|
TL.py(53): z = TlConstructor(elem)
|
|
--- modulename: TL, funcname: __init__
|
|
TL.py(11): self.id = int(json_dict['id'])
|
|
TL.py(12): self.type = json_dict['type']
|
|
TL.py(13): self.predicate = json_dict['predicate']
|
|
TL.py(14): self.params = []
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(17): if param['type'] == "Vector<long>":
|
|
TL.py(20): elif param['type'] == "vector<%Message>":
|
|
TL.py(23): elif param['type'] == "vector<future_salt>":
|
|
TL.py(27): param['subtype'] = None
|
|
TL.py(28): self.params.append(param)
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(17): if param['type'] == "Vector<long>":
|
|
TL.py(20): elif param['type'] == "vector<%Message>":
|
|
TL.py(23): elif param['type'] == "vector<future_salt>":
|
|
TL.py(27): param['subtype'] = None
|
|
TL.py(28): self.params.append(param)
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(17): if param['type'] == "Vector<long>":
|
|
TL.py(20): elif param['type'] == "vector<%Message>":
|
|
TL.py(23): elif param['type'] == "vector<future_salt>":
|
|
TL.py(27): param['subtype'] = None
|
|
TL.py(28): self.params.append(param)
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(17): if param['type'] == "Vector<long>":
|
|
TL.py(20): elif param['type'] == "vector<%Message>":
|
|
TL.py(23): elif param['type'] == "vector<future_salt>":
|
|
TL.py(27): param['subtype'] = None
|
|
TL.py(28): self.params.append(param)
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(17): if param['type'] == "Vector<long>":
|
|
TL.py(20): elif param['type'] == "vector<%Message>":
|
|
TL.py(23): elif param['type'] == "vector<future_salt>":
|
|
TL.py(27): param['subtype'] = None
|
|
TL.py(28): self.params.append(param)
|
|
TL.py(16): for param in json_dict['params']:
|
|
TL.py(54): self.constructor_id[z.id] = z
|
|
TL.py(55): self.constructor_type[z.predicate] = z
|
|
TL.py(52): for elem in self.constructors:
|
|
TL.py(57): self.methods = TL_dict['methods']
|
|
TL.py(58): self.method_id = {}
|
|
TL.py(59): self.method_name = {}
|
|
TL.py(60): for elem in self.methods:
|
|
TL.py(61): z = TlMethod(elem)
|
|
--- modulename: TL, funcname: __init__
|
|
TL.py(32): self.id = int(json_dict['id'])
|
|
TL.py(33): self.type = json_dict['type']
|
|
TL.py(34): self.method = json_dict['method']
|
|
TL.py(35): self.params = json_dict['params']
|
|
TL.py(62): self.method_id[z.id] = z
|
|
TL.py(63): self.method_name[z.method] = z
|
|
TL.py(60): for elem in self.methods:
|
|
TL.py(61): z = TlMethod(elem)
|
|
--- modulename: TL, funcname: __init__
|
|
TL.py(32): self.id = int(json_dict['id'])
|
|
TL.py(33): self.type = json_dict['type']
|
|
TL.py(34): self.method = json_dict['method']
|
|
TL.py(35): self.params = json_dict['params']
|
|
TL.py(62): self.method_id[z.id] = z
|
|
TL.py(63): self.method_name[z.method] = z
|
|
TL.py(60): for elem in self.methods:
|
|
TL.py(61): z = TlMethod(elem)
|
|
--- modulename: TL, funcname: __init__
|
|
TL.py(32): self.id = int(json_dict['id'])
|
|
TL.py(33): self.type = json_dict['type']
|
|
TL.py(34): self.method = json_dict['method']
|
|
TL.py(35): self.params = json_dict['params']
|
|
TL.py(62): self.method_id[z.id] = z
|
|
TL.py(63): self.method_name[z.method] = z
|
|
TL.py(60): for elem in self.methods:
|
|
TL.py(61): z = TlMethod(elem)
|
|
--- modulename: TL, funcname: __init__
|
|
TL.py(32): self.id = int(json_dict['id'])
|
|
TL.py(33): self.type = json_dict['type']
|
|
TL.py(34): self.method = json_dict['method']
|
|
TL.py(35): self.params = json_dict['params']
|
|
TL.py(62): self.method_id[z.id] = z
|
|
TL.py(63): self.method_name[z.method] = z
|
|
TL.py(60): for elem in self.methods:
|
|
TL.py(61): z = TlMethod(elem)
|
|
--- modulename: TL, funcname: __init__
|
|
TL.py(32): self.id = int(json_dict['id'])
|
|
TL.py(33): self.type = json_dict['type']
|
|
TL.py(34): self.method = json_dict['method']
|
|
TL.py(35): self.params = json_dict['params']
|
|
TL.py(62): self.method_id[z.id] = z
|
|
TL.py(63): self.method_name[z.method] = z
|
|
TL.py(60): for elem in self.methods:
|
|
TL.py(61): z = TlMethod(elem)
|
|
--- modulename: TL, funcname: __init__
|
|
TL.py(32): self.id = int(json_dict['id'])
|
|
TL.py(33): self.type = json_dict['type']
|
|
TL.py(34): self.method = json_dict['method']
|
|
TL.py(35): self.params = json_dict['params']
|
|
TL.py(62): self.method_id[z.id] = z
|
|
TL.py(63): self.method_name[z.method] = z
|
|
TL.py(60): for elem in self.methods:
|
|
TL.py(61): z = TlMethod(elem)
|
|
--- modulename: TL, funcname: __init__
|
|
TL.py(32): self.id = int(json_dict['id'])
|
|
TL.py(33): self.type = json_dict['type']
|
|
TL.py(34): self.method = json_dict['method']
|
|
TL.py(35): self.params = json_dict['params']
|
|
TL.py(62): self.method_id[z.id] = z
|
|
TL.py(63): self.method_name[z.method] = z
|
|
TL.py(60): for elem in self.methods:
|
|
TL.py(61): z = TlMethod(elem)
|
|
--- modulename: TL, funcname: __init__
|
|
TL.py(32): self.id = int(json_dict['id'])
|
|
TL.py(33): self.type = json_dict['type']
|
|
TL.py(34): self.method = json_dict['method']
|
|
TL.py(35): self.params = json_dict['params']
|
|
TL.py(62): self.method_id[z.id] = z
|
|
TL.py(63): self.method_name[z.method] = z
|
|
TL.py(60): for elem in self.methods:
|
|
TL.py(61): z = TlMethod(elem)
|
|
--- modulename: TL, funcname: __init__
|
|
TL.py(32): self.id = int(json_dict['id'])
|
|
TL.py(33): self.type = json_dict['type']
|
|
TL.py(34): self.method = json_dict['method']
|
|
TL.py(35): self.params = json_dict['params']
|
|
TL.py(62): self.method_id[z.id] = z
|
|
TL.py(63): self.method_name[z.method] = z
|
|
TL.py(60): for elem in self.methods:
|
|
TL.py(70): def serialize_obj(type_, **kwargs):
|
|
TL.py(82): def serialize_method(type_, **kwargs):
|
|
TL.py(94): def serialize_param(bytes_io, type_, value):
|
|
TL.py(117): def deserialize(bytes_io, type_=None, subtype=None):
|
|
mtproto.py(26): def crc32(data):
|
|
mtproto.py(29): def vis(bs):
|
|
mtproto.py(43): class Session:
|
|
--- modulename: mtproto, funcname: Session
|
|
mtproto.py(43): class Session:
|
|
mtproto.py(44): """ Manages TCP Transport. encryption and message frames """
|
|
mtproto.py(45): def __init__(self, ip, port, auth_key=None, server_salt=None):
|
|
mtproto.py(58): def __del__(self):
|
|
mtproto.py(62): def send_message(self, message_data):
|
|
mtproto.py(94): def recv_message(self):
|
|
mtproto.py(129): def method_call(self, method, **kwargs):
|
|
mtproto.py(139): def create_auth_key(self):
|
|
mtproto.py(266): def aes_calculate(self, msg_key, direction="to server"):
|
|
testing.py(14): config = configparser.ConfigParser()
|
|
--- modulename: ConfigParser, funcname: __init__
|
|
ConfigParser.py(234): self._dict = dict_type
|
|
ConfigParser.py(235): self._sections = self._dict()
|
|
--- modulename: collections, funcname: __init__
|
|
collections.py(44): if len(args) > 1:
|
|
collections.py(46): try:
|
|
collections.py(47): self.__root
|
|
collections.py(48): except AttributeError:
|
|
collections.py(49): self.__root = root = [] # sentinel node
|
|
collections.py(50): root[:] = [root, root, None]
|
|
collections.py(51): self.__map = {}
|
|
collections.py(52): self.__update(*args, **kwds)
|
|
--- modulename: abc, funcname: __subclasscheck__
|
|
abc.py(151): if subclass in cls._abc_cache:
|
|
--- modulename: _weakrefset, funcname: __contains__
|
|
_weakrefset.py(71): try:
|
|
_weakrefset.py(72): wr = ref(item)
|
|
_weakrefset.py(75): return wr in self.data
|
|
abc.py(154): if cls._abc_negative_cache_version < ABCMeta._abc_invalidation_counter:
|
|
abc.py(156): cls._abc_negative_cache = WeakSet()
|
|
--- modulename: _weakrefset, funcname: __init__
|
|
_weakrefset.py(37): self.data = set()
|
|
_weakrefset.py(38): def _remove(item, selfref=ref(self)):
|
|
_weakrefset.py(45): self._remove = _remove
|
|
_weakrefset.py(47): self._pending_removals = []
|
|
_weakrefset.py(48): self._iterating = set()
|
|
_weakrefset.py(49): if data is not None:
|
|
abc.py(157): cls._abc_negative_cache_version = ABCMeta._abc_invalidation_counter
|
|
abc.py(161): ok = cls.__subclasshook__(subclass)
|
|
--- modulename: _abcoll, funcname: __subclasshook__
|
|
_abcoll.py(100): if cls is Sized:
|
|
_abcoll.py(103): return NotImplemented
|
|
abc.py(162): if ok is not NotImplemented:
|
|
abc.py(170): if cls in getattr(subclass, '__mro__', ()):
|
|
abc.py(174): for rcls in cls._abc_registry:
|
|
--- modulename: _weakrefset, funcname: __iter__
|
|
_weakrefset.py(59): with _IterationGuard(self):
|
|
--- modulename: _weakrefset, funcname: __init__
|
|
_weakrefset.py(18): self.weakcontainer = ref(weakcontainer)
|
|
--- modulename: _weakrefset, funcname: __enter__
|
|
_weakrefset.py(21): w = self.weakcontainer()
|
|
_weakrefset.py(22): if w is not None:
|
|
_weakrefset.py(23): w._iterating.add(self)
|
|
_weakrefset.py(24): return self
|
|
_weakrefset.py(60): for itemref in self.data:
|
|
_weakrefset.py(61): item = itemref()
|
|
_weakrefset.py(62): if item is not None:
|
|
_weakrefset.py(65): yield item
|
|
abc.py(175): if issubclass(subclass, rcls):
|
|
abc.py(174): for rcls in cls._abc_registry:
|
|
--- modulename: _weakrefset, funcname: __iter__
|
|
_weakrefset.py(60): for itemref in self.data:
|
|
_weakrefset.py(61): item = itemref()
|
|
_weakrefset.py(62): if item is not None:
|
|
_weakrefset.py(65): yield item
|
|
abc.py(175): if issubclass(subclass, rcls):
|
|
abc.py(176): cls._abc_cache.add(subclass)
|
|
--- modulename: _weakrefset, funcname: add
|
|
_weakrefset.py(84): if self._pending_removals:
|
|
_weakrefset.py(86): self.data.add(ref(item, self._remove))
|
|
abc.py(177): return True
|
|
--- modulename: _weakrefset, funcname: __iter__
|
|
--- modulename: _weakrefset, funcname: __exit__
|
|
_weakrefset.py(27): w = self.weakcontainer()
|
|
_weakrefset.py(28): if w is not None:
|
|
_weakrefset.py(29): s = w._iterating
|
|
_weakrefset.py(30): s.remove(self)
|
|
_weakrefset.py(31): if not s:
|
|
_weakrefset.py(32): w._commit_removals()
|
|
--- modulename: _weakrefset, funcname: _commit_removals
|
|
_weakrefset.py(53): l = self._pending_removals
|
|
_weakrefset.py(54): discard = self.data.discard
|
|
_weakrefset.py(55): while l:
|
|
--- modulename: _abcoll, funcname: update
|
|
_abcoll.py(532): if len(args) > 2:
|
|
_abcoll.py(535): elif not args:
|
|
_abcoll.py(537): self = args[0]
|
|
_abcoll.py(538): other = args[1] if len(args) >= 2 else ()
|
|
_abcoll.py(540): if isinstance(other, Mapping):
|
|
--- modulename: abc, funcname: __instancecheck__
|
|
abc.py(131): subclass = getattr(instance, '__class__', None)
|
|
abc.py(132): if subclass is not None and subclass in cls._abc_cache:
|
|
--- modulename: _weakrefset, funcname: __contains__
|
|
_weakrefset.py(71): try:
|
|
_weakrefset.py(72): wr = ref(item)
|
|
_weakrefset.py(75): return wr in self.data
|
|
abc.py(134): subtype = type(instance)
|
|
abc.py(136): if subtype is _InstanceType:
|
|
abc.py(138): if subtype is subclass or subclass is None:
|
|
abc.py(139): if (cls._abc_negative_cache_version ==
|
|
abc.py(140): ABCMeta._abc_invalidation_counter and
|
|
abc.py(144): return cls.__subclasscheck__(subtype)
|
|
--- modulename: abc, funcname: __subclasscheck__
|
|
abc.py(151): if subclass in cls._abc_cache:
|
|
--- modulename: _weakrefset, funcname: __contains__
|
|
_weakrefset.py(71): try:
|
|
_weakrefset.py(72): wr = ref(item)
|
|
_weakrefset.py(75): return wr in self.data
|
|
abc.py(154): if cls._abc_negative_cache_version < ABCMeta._abc_invalidation_counter:
|
|
abc.py(156): cls._abc_negative_cache = WeakSet()
|
|
--- modulename: _weakrefset, funcname: __init__
|
|
_weakrefset.py(37): self.data = set()
|
|
_weakrefset.py(38): def _remove(item, selfref=ref(self)):
|
|
_weakrefset.py(45): self._remove = _remove
|
|
_weakrefset.py(47): self._pending_removals = []
|
|
_weakrefset.py(48): self._iterating = set()
|
|
_weakrefset.py(49): if data is not None:
|
|
abc.py(157): cls._abc_negative_cache_version = ABCMeta._abc_invalidation_counter
|
|
abc.py(161): ok = cls.__subclasshook__(subclass)
|
|
--- modulename: _abcoll, funcname: __subclasshook__
|
|
_abcoll.py(100): if cls is Sized:
|
|
_abcoll.py(103): return NotImplemented
|
|
abc.py(162): if ok is not NotImplemented:
|
|
abc.py(170): if cls in getattr(subclass, '__mro__', ()):
|
|
abc.py(174): for rcls in cls._abc_registry:
|
|
--- modulename: _weakrefset, funcname: __iter__
|
|
_weakrefset.py(59): with _IterationGuard(self):
|
|
--- modulename: _weakrefset, funcname: __init__
|
|
_weakrefset.py(18): self.weakcontainer = ref(weakcontainer)
|
|
--- modulename: _weakrefset, funcname: __enter__
|
|
_weakrefset.py(21): w = self.weakcontainer()
|
|
_weakrefset.py(22): if w is not None:
|
|
_weakrefset.py(23): w._iterating.add(self)
|
|
_weakrefset.py(24): return self
|
|
_weakrefset.py(60): for itemref in self.data:
|
|
--- modulename: _weakrefset, funcname: __exit__
|
|
_weakrefset.py(27): w = self.weakcontainer()
|
|
_weakrefset.py(28): if w is not None:
|
|
_weakrefset.py(29): s = w._iterating
|
|
_weakrefset.py(30): s.remove(self)
|
|
_weakrefset.py(31): if not s:
|
|
_weakrefset.py(32): w._commit_removals()
|
|
--- modulename: _weakrefset, funcname: _commit_removals
|
|
_weakrefset.py(53): l = self._pending_removals
|
|
_weakrefset.py(54): discard = self.data.discard
|
|
_weakrefset.py(55): while l:
|
|
abc.py(179): for scls in cls.__subclasses__():
|
|
abc.py(180): if issubclass(subclass, scls):
|
|
--- modulename: abc, funcname: __subclasscheck__
|
|
abc.py(151): if subclass in cls._abc_cache:
|
|
--- modulename: _weakrefset, funcname: __contains__
|
|
_weakrefset.py(71): try:
|
|
_weakrefset.py(72): wr = ref(item)
|
|
_weakrefset.py(75): return wr in self.data
|
|
abc.py(154): if cls._abc_negative_cache_version < ABCMeta._abc_invalidation_counter:
|
|
abc.py(158): elif subclass in cls._abc_negative_cache:
|
|
--- modulename: _weakrefset, funcname: __contains__
|
|
_weakrefset.py(71): try:
|
|
_weakrefset.py(72): wr = ref(item)
|
|
_weakrefset.py(75): return wr in self.data
|
|
abc.py(161): ok = cls.__subclasshook__(subclass)
|
|
--- modulename: _abcoll, funcname: __subclasshook__
|
|
_abcoll.py(100): if cls is Sized:
|
|
_abcoll.py(103): return NotImplemented
|
|
abc.py(162): if ok is not NotImplemented:
|
|
abc.py(170): if cls in getattr(subclass, '__mro__', ()):
|
|
abc.py(174): for rcls in cls._abc_registry:
|
|
--- modulename: _weakrefset, funcname: __iter__
|
|
_weakrefset.py(59): with _IterationGuard(self):
|
|
--- modulename: _weakrefset, funcname: __init__
|
|
_weakrefset.py(18): self.weakcontainer = ref(weakcontainer)
|
|
--- modulename: _weakrefset, funcname: __enter__
|
|
_weakrefset.py(21): w = self.weakcontainer()
|
|
_weakrefset.py(22): if w is not None:
|
|
_weakrefset.py(23): w._iterating.add(self)
|
|
_weakrefset.py(24): return self
|
|
_weakrefset.py(60): for itemref in self.data:
|
|
_weakrefset.py(61): item = itemref()
|
|
_weakrefset.py(62): if item is not None:
|
|
_weakrefset.py(65): yield item
|
|
abc.py(175): if issubclass(subclass, rcls):
|
|
abc.py(174): for rcls in cls._abc_registry:
|
|
--- modulename: _weakrefset, funcname: __iter__
|
|
_weakrefset.py(60): for itemref in self.data:
|
|
_weakrefset.py(61): item = itemref()
|
|
_weakrefset.py(62): if item is not None:
|
|
_weakrefset.py(65): yield item
|
|
abc.py(175): if issubclass(subclass, rcls):
|
|
abc.py(174): for rcls in cls._abc_registry:
|
|
--- modulename: _weakrefset, funcname: __iter__
|
|
_weakrefset.py(60): for itemref in self.data:
|
|
--- modulename: _weakrefset, funcname: __exit__
|
|
_weakrefset.py(27): w = self.weakcontainer()
|
|
_weakrefset.py(28): if w is not None:
|
|
_weakrefset.py(29): s = w._iterating
|
|
_weakrefset.py(30): s.remove(self)
|
|
_weakrefset.py(31): if not s:
|
|
_weakrefset.py(32): w._commit_removals()
|
|
--- modulename: _weakrefset, funcname: _commit_removals
|
|
_weakrefset.py(53): l = self._pending_removals
|
|
_weakrefset.py(54): discard = self.data.discard
|
|
_weakrefset.py(55): while l:
|
|
abc.py(179): for scls in cls.__subclasses__():
|
|
abc.py(184): cls._abc_negative_cache.add(subclass)
|
|
--- modulename: _weakrefset, funcname: add
|
|
_weakrefset.py(84): if self._pending_removals:
|
|
_weakrefset.py(86): self.data.add(ref(item, self._remove))
|
|
abc.py(185): return False
|
|
abc.py(179): for scls in cls.__subclasses__():
|
|
abc.py(184): cls._abc_negative_cache.add(subclass)
|
|
--- modulename: _weakrefset, funcname: add
|
|
_weakrefset.py(84): if self._pending_removals:
|
|
_weakrefset.py(86): self.data.add(ref(item, self._remove))
|
|
abc.py(185): return False
|
|
_abcoll.py(543): elif hasattr(other, "keys"):
|
|
_abcoll.py(547): for key, value in other:
|
|
_abcoll.py(549): for key, value in kwds.items():
|
|
ConfigParser.py(236): self._defaults = self._dict()
|
|
--- modulename: collections, funcname: __init__
|
|
collections.py(44): if len(args) > 1:
|
|
collections.py(46): try:
|
|
collections.py(47): self.__root
|
|
collections.py(48): except AttributeError:
|
|
collections.py(49): self.__root = root = [] # sentinel node
|
|
collections.py(50): root[:] = [root, root, None]
|
|
collections.py(51): self.__map = {}
|
|
collections.py(52): self.__update(*args, **kwds)
|
|
--- modulename: abc, funcname: __subclasscheck__
|
|
abc.py(151): if subclass in cls._abc_cache:
|
|
--- modulename: _weakrefset, funcname: __contains__
|
|
_weakrefset.py(71): try:
|
|
_weakrefset.py(72): wr = ref(item)
|
|
_weakrefset.py(75): return wr in self.data
|
|
abc.py(152): return True
|
|
--- modulename: _abcoll, funcname: update
|
|
_abcoll.py(532): if len(args) > 2:
|
|
_abcoll.py(535): elif not args:
|
|
_abcoll.py(537): self = args[0]
|
|
_abcoll.py(538): other = args[1] if len(args) >= 2 else ()
|
|
_abcoll.py(540): if isinstance(other, Mapping):
|
|
--- modulename: abc, funcname: __instancecheck__
|
|
abc.py(131): subclass = getattr(instance, '__class__', None)
|
|
abc.py(132): if subclass is not None and subclass in cls._abc_cache:
|
|
--- modulename: _weakrefset, funcname: __contains__
|
|
_weakrefset.py(71): try:
|
|
_weakrefset.py(72): wr = ref(item)
|
|
_weakrefset.py(75): return wr in self.data
|
|
abc.py(134): subtype = type(instance)
|
|
abc.py(136): if subtype is _InstanceType:
|
|
abc.py(138): if subtype is subclass or subclass is None:
|
|
abc.py(139): if (cls._abc_negative_cache_version ==
|
|
abc.py(140): ABCMeta._abc_invalidation_counter and
|
|
abc.py(141): subtype in cls._abc_negative_cache):
|
|
--- modulename: _weakrefset, funcname: __contains__
|
|
_weakrefset.py(71): try:
|
|
_weakrefset.py(72): wr = ref(item)
|
|
_weakrefset.py(75): return wr in self.data
|
|
abc.py(142): return False
|
|
_abcoll.py(543): elif hasattr(other, "keys"):
|
|
_abcoll.py(547): for key, value in other:
|
|
_abcoll.py(549): for key, value in kwds.items():
|
|
ConfigParser.py(237): if allow_no_value:
|
|
ConfigParser.py(240): self._optcre = self.OPTCRE
|
|
ConfigParser.py(241): if defaults:
|
|
testing.py(16): if not config.read('credentials'):
|
|
--- modulename: ConfigParser, funcname: read
|
|
ConfigParser.py(297): if isinstance(filenames, basestring):
|
|
ConfigParser.py(298): filenames = [filenames]
|
|
ConfigParser.py(299): read_ok = []
|
|
ConfigParser.py(300): for filename in filenames:
|
|
ConfigParser.py(301): try:
|
|
ConfigParser.py(302): fp = open(filename)
|
|
ConfigParser.py(305): self._read(fp, filename)
|
|
--- modulename: ConfigParser, funcname: _read
|
|
ConfigParser.py(474): cursect = None # None, or a dictionary
|
|
ConfigParser.py(475): optname = None
|
|
ConfigParser.py(476): lineno = 0
|
|
ConfigParser.py(477): e = None # None, or an exception
|
|
ConfigParser.py(478): while True:
|
|
ConfigParser.py(479): line = fp.readline()
|
|
ConfigParser.py(480): if not line:
|
|
ConfigParser.py(482): lineno = lineno + 1
|
|
ConfigParser.py(484): if line.strip() == '' or line[0] in '#;':
|
|
ConfigParser.py(486): if line.split(None, 1)[0].lower() == 'rem' and line[0] in "rR":
|
|
ConfigParser.py(490): if line[0].isspace() and cursect is not None and optname:
|
|
ConfigParser.py(497): mo = self.SECTCRE.match(line)
|
|
ConfigParser.py(498): if mo:
|
|
ConfigParser.py(499): sectname = mo.group('header')
|
|
ConfigParser.py(500): if sectname in self._sections:
|
|
ConfigParser.py(502): elif sectname == DEFAULTSECT:
|
|
ConfigParser.py(505): cursect = self._dict()
|
|
--- modulename: collections, funcname: __init__
|
|
collections.py(44): if len(args) > 1:
|
|
collections.py(46): try:
|
|
collections.py(47): self.__root
|
|
collections.py(48): except AttributeError:
|
|
collections.py(49): self.__root = root = [] # sentinel node
|
|
collections.py(50): root[:] = [root, root, None]
|
|
collections.py(51): self.__map = {}
|
|
collections.py(52): self.__update(*args, **kwds)
|
|
--- modulename: abc, funcname: __subclasscheck__
|
|
abc.py(151): if subclass in cls._abc_cache:
|
|
--- modulename: _weakrefset, funcname: __contains__
|
|
_weakrefset.py(71): try:
|
|
_weakrefset.py(72): wr = ref(item)
|
|
_weakrefset.py(75): return wr in self.data
|
|
abc.py(152): return True
|
|
--- modulename: _abcoll, funcname: update
|
|
_abcoll.py(532): if len(args) > 2:
|
|
_abcoll.py(535): elif not args:
|
|
_abcoll.py(537): self = args[0]
|
|
_abcoll.py(538): other = args[1] if len(args) >= 2 else ()
|
|
_abcoll.py(540): if isinstance(other, Mapping):
|
|
--- modulename: abc, funcname: __instancecheck__
|
|
abc.py(131): subclass = getattr(instance, '__class__', None)
|
|
abc.py(132): if subclass is not None and subclass in cls._abc_cache:
|
|
--- modulename: _weakrefset, funcname: __contains__
|
|
_weakrefset.py(71): try:
|
|
_weakrefset.py(72): wr = ref(item)
|
|
_weakrefset.py(75): return wr in self.data
|
|
abc.py(134): subtype = type(instance)
|
|
abc.py(136): if subtype is _InstanceType:
|
|
abc.py(138): if subtype is subclass or subclass is None:
|
|
abc.py(139): if (cls._abc_negative_cache_version ==
|
|
abc.py(140): ABCMeta._abc_invalidation_counter and
|
|
abc.py(141): subtype in cls._abc_negative_cache):
|
|
--- modulename: _weakrefset, funcname: __contains__
|
|
_weakrefset.py(71): try:
|
|
_weakrefset.py(72): wr = ref(item)
|
|
_weakrefset.py(75): return wr in self.data
|
|
abc.py(142): return False
|
|
_abcoll.py(543): elif hasattr(other, "keys"):
|
|
_abcoll.py(547): for key, value in other:
|
|
_abcoll.py(549): for key, value in kwds.items():
|
|
ConfigParser.py(506): cursect['__name__'] = sectname
|
|
--- modulename: collections, funcname: __setitem__
|
|
collections.py(58): if key not in self:
|
|
collections.py(59): root = self.__root
|
|
collections.py(60): last = root[0]
|
|
collections.py(61): last[1] = root[0] = self.__map[key] = [last, root, key]
|
|
collections.py(62): return dict_setitem(self, key, value)
|
|
ConfigParser.py(507): self._sections[sectname] = cursect
|
|
--- modulename: collections, funcname: __setitem__
|
|
collections.py(58): if key not in self:
|
|
collections.py(59): root = self.__root
|
|
collections.py(60): last = root[0]
|
|
collections.py(61): last[1] = root[0] = self.__map[key] = [last, root, key]
|
|
collections.py(62): return dict_setitem(self, key, value)
|
|
ConfigParser.py(509): optname = None
|
|
ConfigParser.py(478): while True:
|
|
ConfigParser.py(479): line = fp.readline()
|
|
ConfigParser.py(480): if not line:
|
|
ConfigParser.py(482): lineno = lineno + 1
|
|
ConfigParser.py(484): if line.strip() == '' or line[0] in '#;':
|
|
ConfigParser.py(486): if line.split(None, 1)[0].lower() == 'rem' and line[0] in "rR":
|
|
ConfigParser.py(490): if line[0].isspace() and cursect is not None and optname:
|
|
ConfigParser.py(497): mo = self.SECTCRE.match(line)
|
|
ConfigParser.py(498): if mo:
|
|
ConfigParser.py(511): elif cursect is None:
|
|
ConfigParser.py(515): mo = self._optcre.match(line)
|
|
ConfigParser.py(516): if mo:
|
|
ConfigParser.py(517): optname, vi, optval = mo.group('option', 'vi', 'value')
|
|
ConfigParser.py(518): optname = self.optionxform(optname.rstrip())
|
|
--- modulename: ConfigParser, funcname: optionxform
|
|
ConfigParser.py(374): return optionstr.lower()
|
|
ConfigParser.py(521): if optval is not None:
|
|
ConfigParser.py(522): if vi in ('=', ':') and ';' in optval:
|
|
ConfigParser.py(528): optval = optval.strip()
|
|
ConfigParser.py(530): if optval == '""':
|
|
ConfigParser.py(532): cursect[optname] = [optval]
|
|
--- modulename: collections, funcname: __setitem__
|
|
collections.py(58): if key not in self:
|
|
collections.py(59): root = self.__root
|
|
collections.py(60): last = root[0]
|
|
collections.py(61): last[1] = root[0] = self.__map[key] = [last, root, key]
|
|
collections.py(62): return dict_setitem(self, key, value)
|
|
ConfigParser.py(478): while True:
|
|
ConfigParser.py(479): line = fp.readline()
|
|
ConfigParser.py(480): if not line:
|
|
ConfigParser.py(482): lineno = lineno + 1
|
|
ConfigParser.py(484): if line.strip() == '' or line[0] in '#;':
|
|
ConfigParser.py(486): if line.split(None, 1)[0].lower() == 'rem' and line[0] in "rR":
|
|
ConfigParser.py(490): if line[0].isspace() and cursect is not None and optname:
|
|
ConfigParser.py(497): mo = self.SECTCRE.match(line)
|
|
ConfigParser.py(498): if mo:
|
|
ConfigParser.py(511): elif cursect is None:
|
|
ConfigParser.py(515): mo = self._optcre.match(line)
|
|
ConfigParser.py(516): if mo:
|
|
ConfigParser.py(517): optname, vi, optval = mo.group('option', 'vi', 'value')
|
|
ConfigParser.py(518): optname = self.optionxform(optname.rstrip())
|
|
--- modulename: ConfigParser, funcname: optionxform
|
|
ConfigParser.py(374): return optionstr.lower()
|
|
ConfigParser.py(521): if optval is not None:
|
|
ConfigParser.py(522): if vi in ('=', ':') and ';' in optval:
|
|
ConfigParser.py(528): optval = optval.strip()
|
|
ConfigParser.py(530): if optval == '""':
|
|
ConfigParser.py(532): cursect[optname] = [optval]
|
|
--- modulename: collections, funcname: __setitem__
|
|
collections.py(58): if key not in self:
|
|
collections.py(59): root = self.__root
|
|
collections.py(60): last = root[0]
|
|
collections.py(61): last[1] = root[0] = self.__map[key] = [last, root, key]
|
|
collections.py(62): return dict_setitem(self, key, value)
|
|
ConfigParser.py(478): while True:
|
|
ConfigParser.py(479): line = fp.readline()
|
|
ConfigParser.py(480): if not line:
|
|
ConfigParser.py(482): lineno = lineno + 1
|
|
ConfigParser.py(484): if line.strip() == '' or line[0] in '#;':
|
|
ConfigParser.py(486): if line.split(None, 1)[0].lower() == 'rem' and line[0] in "rR":
|
|
ConfigParser.py(490): if line[0].isspace() and cursect is not None and optname:
|
|
ConfigParser.py(497): mo = self.SECTCRE.match(line)
|
|
ConfigParser.py(498): if mo:
|
|
ConfigParser.py(511): elif cursect is None:
|
|
ConfigParser.py(515): mo = self._optcre.match(line)
|
|
ConfigParser.py(516): if mo:
|
|
ConfigParser.py(517): optname, vi, optval = mo.group('option', 'vi', 'value')
|
|
ConfigParser.py(518): optname = self.optionxform(optname.rstrip())
|
|
--- modulename: ConfigParser, funcname: optionxform
|
|
ConfigParser.py(374): return optionstr.lower()
|
|
ConfigParser.py(521): if optval is not None:
|
|
ConfigParser.py(522): if vi in ('=', ':') and ';' in optval:
|
|
ConfigParser.py(528): optval = optval.strip()
|
|
ConfigParser.py(530): if optval == '""':
|
|
ConfigParser.py(532): cursect[optname] = [optval]
|
|
--- modulename: collections, funcname: __setitem__
|
|
collections.py(58): if key not in self:
|
|
collections.py(59): root = self.__root
|
|
collections.py(60): last = root[0]
|
|
collections.py(61): last[1] = root[0] = self.__map[key] = [last, root, key]
|
|
collections.py(62): return dict_setitem(self, key, value)
|
|
ConfigParser.py(478): while True:
|
|
ConfigParser.py(479): line = fp.readline()
|
|
ConfigParser.py(480): if not line:
|
|
ConfigParser.py(482): lineno = lineno + 1
|
|
ConfigParser.py(484): if line.strip() == '' or line[0] in '#;':
|
|
ConfigParser.py(486): if line.split(None, 1)[0].lower() == 'rem' and line[0] in "rR":
|
|
ConfigParser.py(490): if line[0].isspace() and cursect is not None and optname:
|
|
ConfigParser.py(497): mo = self.SECTCRE.match(line)
|
|
ConfigParser.py(498): if mo:
|
|
ConfigParser.py(511): elif cursect is None:
|
|
ConfigParser.py(515): mo = self._optcre.match(line)
|
|
ConfigParser.py(516): if mo:
|
|
ConfigParser.py(517): optname, vi, optval = mo.group('option', 'vi', 'value')
|
|
ConfigParser.py(518): optname = self.optionxform(optname.rstrip())
|
|
--- modulename: ConfigParser, funcname: optionxform
|
|
ConfigParser.py(374): return optionstr.lower()
|
|
ConfigParser.py(521): if optval is not None:
|
|
ConfigParser.py(522): if vi in ('=', ':') and ';' in optval:
|
|
ConfigParser.py(528): optval = optval.strip()
|
|
ConfigParser.py(530): if optval == '""':
|
|
ConfigParser.py(532): cursect[optname] = [optval]
|
|
--- modulename: collections, funcname: __setitem__
|
|
collections.py(58): if key not in self:
|
|
collections.py(59): root = self.__root
|
|
collections.py(60): last = root[0]
|
|
collections.py(61): last[1] = root[0] = self.__map[key] = [last, root, key]
|
|
collections.py(62): return dict_setitem(self, key, value)
|
|
ConfigParser.py(478): while True:
|
|
ConfigParser.py(479): line = fp.readline()
|
|
ConfigParser.py(480): if not line:
|
|
ConfigParser.py(481): break
|
|
ConfigParser.py(545): if e:
|
|
ConfigParser.py(549): all_sections = [self._defaults]
|
|
ConfigParser.py(550): all_sections.extend(self._sections.values())
|
|
--- modulename: collections, funcname: values
|
|
collections.py(106): return [self[key] for key in self]
|
|
--- modulename: collections, funcname: __iter__
|
|
collections.py(76): root = self.__root
|
|
collections.py(77): curr = root[1] # start at the first node
|
|
collections.py(78): while curr is not root:
|
|
collections.py(79): yield curr[2] # yield the curr[KEY]
|
|
collections.py(106): return [self[key] for key in self]
|
|
--- modulename: collections, funcname: __iter__
|
|
collections.py(80): curr = curr[1] # move to next node
|
|
collections.py(78): while curr is not root:
|
|
ConfigParser.py(551): for options in all_sections:
|
|
ConfigParser.py(552): for name, val in options.items():
|
|
--- modulename: collections, funcname: items
|
|
collections.py(110): return [(key, self[key]) for key in self]
|
|
--- modulename: collections, funcname: __iter__
|
|
collections.py(76): root = self.__root
|
|
collections.py(77): curr = root[1] # start at the first node
|
|
collections.py(78): while curr is not root:
|
|
ConfigParser.py(551): for options in all_sections:
|
|
ConfigParser.py(552): for name, val in options.items():
|
|
--- modulename: collections, funcname: items
|
|
collections.py(110): return [(key, self[key]) for key in self]
|
|
--- modulename: collections, funcname: __iter__
|
|
collections.py(76): root = self.__root
|
|
collections.py(77): curr = root[1] # start at the first node
|
|
collections.py(78): while curr is not root:
|
|
collections.py(79): yield curr[2] # yield the curr[KEY]
|
|
collections.py(110): return [(key, self[key]) for key in self]
|
|
--- modulename: collections, funcname: __iter__
|
|
collections.py(80): curr = curr[1] # move to next node
|
|
collections.py(78): while curr is not root:
|
|
collections.py(79): yield curr[2] # yield the curr[KEY]
|
|
collections.py(110): return [(key, self[key]) for key in self]
|
|
--- modulename: collections, funcname: __iter__
|
|
collections.py(80): curr = curr[1] # move to next node
|
|
collections.py(78): while curr is not root:
|
|
collections.py(79): yield curr[2] # yield the curr[KEY]
|
|
collections.py(110): return [(key, self[key]) for key in self]
|
|
--- modulename: collections, funcname: __iter__
|
|
collections.py(80): curr = curr[1] # move to next node
|
|
collections.py(78): while curr is not root:
|
|
collections.py(79): yield curr[2] # yield the curr[KEY]
|
|
collections.py(110): return [(key, self[key]) for key in self]
|
|
--- modulename: collections, funcname: __iter__
|
|
collections.py(80): curr = curr[1] # move to next node
|
|
collections.py(78): while curr is not root:
|
|
collections.py(79): yield curr[2] # yield the curr[KEY]
|
|
collections.py(110): return [(key, self[key]) for key in self]
|
|
--- modulename: collections, funcname: __iter__
|
|
collections.py(80): curr = curr[1] # move to next node
|
|
collections.py(78): while curr is not root:
|
|
ConfigParser.py(553): if isinstance(val, list):
|
|
ConfigParser.py(552): for name, val in options.items():
|
|
ConfigParser.py(553): if isinstance(val, list):
|
|
ConfigParser.py(554): options[name] = '\n'.join(val)
|
|
--- modulename: collections, funcname: __setitem__
|
|
collections.py(58): if key not in self:
|
|
collections.py(62): return dict_setitem(self, key, value)
|
|
ConfigParser.py(552): for name, val in options.items():
|
|
ConfigParser.py(553): if isinstance(val, list):
|
|
ConfigParser.py(554): options[name] = '\n'.join(val)
|
|
--- modulename: collections, funcname: __setitem__
|
|
collections.py(58): if key not in self:
|
|
collections.py(62): return dict_setitem(self, key, value)
|
|
ConfigParser.py(552): for name, val in options.items():
|
|
ConfigParser.py(553): if isinstance(val, list):
|
|
ConfigParser.py(554): options[name] = '\n'.join(val)
|
|
--- modulename: collections, funcname: __setitem__
|
|
collections.py(58): if key not in self:
|
|
collections.py(62): return dict_setitem(self, key, value)
|
|
ConfigParser.py(552): for name, val in options.items():
|
|
ConfigParser.py(553): if isinstance(val, list):
|
|
ConfigParser.py(554): options[name] = '\n'.join(val)
|
|
--- modulename: collections, funcname: __setitem__
|
|
collections.py(58): if key not in self:
|
|
collections.py(62): return dict_setitem(self, key, value)
|
|
ConfigParser.py(552): for name, val in options.items():
|
|
ConfigParser.py(551): for options in all_sections:
|
|
ConfigParser.py(306): fp.close()
|
|
ConfigParser.py(307): read_ok.append(filename)
|
|
ConfigParser.py(300): for filename in filenames:
|
|
ConfigParser.py(308): return read_ok
|
|
testing.py(19): ip = config.get('App data', 'ip_address')
|
|
--- modulename: ConfigParser, funcname: get
|
|
ConfigParser.py(602): sectiondict = {}
|
|
ConfigParser.py(603): try:
|
|
ConfigParser.py(604): sectiondict = self._sections[section]
|
|
ConfigParser.py(609): vardict = {}
|
|
ConfigParser.py(610): if vars:
|
|
ConfigParser.py(613): d = _Chainmap(vardict, sectiondict, self._defaults)
|
|
--- modulename: ConfigParser, funcname: __init__
|
|
ConfigParser.py(568): self._maps = maps
|
|
ConfigParser.py(614): option = self.optionxform(option)
|
|
--- modulename: ConfigParser, funcname: optionxform
|
|
ConfigParser.py(374): return optionstr.lower()
|
|
ConfigParser.py(615): try:
|
|
ConfigParser.py(616): value = d[option]
|
|
--- modulename: ConfigParser, funcname: __getitem__
|
|
ConfigParser.py(571): for mapping in self._maps:
|
|
ConfigParser.py(572): try:
|
|
ConfigParser.py(573): return mapping[key]
|
|
ConfigParser.py(574): except KeyError:
|
|
ConfigParser.py(575): pass
|
|
ConfigParser.py(571): for mapping in self._maps:
|
|
ConfigParser.py(572): try:
|
|
ConfigParser.py(573): return mapping[key]
|
|
ConfigParser.py(620): if raw or value is None:
|
|
ConfigParser.py(623): return self._interpolate(section, option, value, d)
|
|
--- modulename: ConfigParser, funcname: _interpolate
|
|
ConfigParser.py(659): value = rawval
|
|
ConfigParser.py(660): depth = MAX_INTERPOLATION_DEPTH
|
|
ConfigParser.py(661): while depth: # Loop through this until it's done
|
|
ConfigParser.py(662): depth -= 1
|
|
ConfigParser.py(663): if value and "%(" in value:
|
|
ConfigParser.py(671): break
|
|
ConfigParser.py(672): if value and "%(" in value:
|
|
ConfigParser.py(674): return value
|
|
testing.py(20): port = config.getint('App data', 'port')
|
|
--- modulename: ConfigParser, funcname: getint
|
|
ConfigParser.py(359): return self._get(section, int, option)
|
|
--- modulename: ConfigParser, funcname: _get
|
|
ConfigParser.py(356): return conv(self.get(section, option))
|
|
--- modulename: ConfigParser, funcname: get
|
|
ConfigParser.py(602): sectiondict = {}
|
|
ConfigParser.py(603): try:
|
|
ConfigParser.py(604): sectiondict = self._sections[section]
|
|
ConfigParser.py(609): vardict = {}
|
|
ConfigParser.py(610): if vars:
|
|
ConfigParser.py(613): d = _Chainmap(vardict, sectiondict, self._defaults)
|
|
--- modulename: ConfigParser, funcname: __init__
|
|
ConfigParser.py(568): self._maps = maps
|
|
ConfigParser.py(614): option = self.optionxform(option)
|
|
--- modulename: ConfigParser, funcname: optionxform
|
|
ConfigParser.py(374): return optionstr.lower()
|
|
ConfigParser.py(615): try:
|
|
ConfigParser.py(616): value = d[option]
|
|
--- modulename: ConfigParser, funcname: __getitem__
|
|
ConfigParser.py(571): for mapping in self._maps:
|
|
ConfigParser.py(572): try:
|
|
ConfigParser.py(573): return mapping[key]
|
|
ConfigParser.py(574): except KeyError:
|
|
ConfigParser.py(575): pass
|
|
ConfigParser.py(571): for mapping in self._maps:
|
|
ConfigParser.py(572): try:
|
|
ConfigParser.py(573): return mapping[key]
|
|
ConfigParser.py(620): if raw or value is None:
|
|
ConfigParser.py(623): return self._interpolate(section, option, value, d)
|
|
--- modulename: ConfigParser, funcname: _interpolate
|
|
ConfigParser.py(659): value = rawval
|
|
ConfigParser.py(660): depth = MAX_INTERPOLATION_DEPTH
|
|
ConfigParser.py(661): while depth: # Loop through this until it's done
|
|
ConfigParser.py(662): depth -= 1
|
|
ConfigParser.py(663): if value and "%(" in value:
|
|
ConfigParser.py(671): break
|
|
ConfigParser.py(672): if value and "%(" in value:
|
|
ConfigParser.py(674): return value
|
|
testing.py(22): Session = mtproto.Session(ip, port)
|
|
--- modulename: mtproto, funcname: __init__
|
|
mtproto.py(47): self.sock = socket.socket()
|
|
--- modulename: socket, funcname: __init__
|
|
socket.py(186): if _sock is None:
|
|
socket.py(187): _sock = _realsocket(family, type, proto)
|
|
socket.py(188): self._sock = _sock
|
|
socket.py(189): for method in _delegate_methods:
|
|
socket.py(190): setattr(self, method, getattr(_sock, method))
|
|
socket.py(189): for method in _delegate_methods:
|
|
socket.py(190): setattr(self, method, getattr(_sock, method))
|
|
socket.py(189): for method in _delegate_methods:
|
|
socket.py(190): setattr(self, method, getattr(_sock, method))
|
|
socket.py(189): for method in _delegate_methods:
|
|
socket.py(190): setattr(self, method, getattr(_sock, method))
|
|
socket.py(189): for method in _delegate_methods:
|
|
socket.py(190): setattr(self, method, getattr(_sock, method))
|
|
socket.py(189): for method in _delegate_methods:
|
|
socket.py(190): setattr(self, method, getattr(_sock, method))
|
|
socket.py(189): for method in _delegate_methods:
|
|
mtproto.py(48): self.sock.connect((ip, port))
|
|
--- modulename: socket, funcname: meth
|
|
socket.py(224): return getattr(self._sock,name)(*args)
|
|
mtproto.py(49): self.number = 0
|
|
mtproto.py(50): self.timedelta = 0
|
|
mtproto.py(51): self.session_id = os.urandom(8)
|
|
mtproto.py(52): self.auth_key = auth_key
|
|
mtproto.py(53): self.auth_key_id = SHA.new(self.auth_key).digest()[-8:] if self.auth_key else None
|
|
mtproto.py(54): self.sock.settimeout(5.0)
|
|
--- modulename: socket, funcname: meth
|
|
socket.py(224): return getattr(self._sock,name)(*args)
|
|
mtproto.py(55): self.MAX_RETRY = 5;
|
|
mtproto.py(56): self.AUTH_MAX_RETRY = 5;
|
|
testing.py(24): Session.create_auth_key()
|
|
--- modulename: mtproto, funcname: create_auth_key
|
|
mtproto.py(141): nonce = os.urandom(16)
|
|
mtproto.py(142): print("Requesting pq")
|
|
Requesting pq
|
|
mtproto.py(144): ResPQ = self.method_call('req_pq', nonce=nonce)
|
|
--- modulename: mtproto, funcname: method_call
|
|
mtproto.py(130): for i in range(1, self.MAX_RETRY):
|
|
mtproto.py(131): try:
|
|
mtproto.py(132): self.send_message(TL.serialize_method(method, **kwargs))
|
|
--- modulename: TL, funcname: serialize_method
|
|
TL.py(83): bytes_io = io.BytesIO()
|
|
TL.py(84): try:
|
|
TL.py(85): tl_method = tl.method_name[type_]
|
|
TL.py(88): bytes_io.write(struct.pack('<i', tl_method.id))
|
|
TL.py(89): for arg in tl_method.params:
|
|
TL.py(90): serialize_param(bytes_io, type_=arg['type'], value=kwargs[arg['name']])
|
|
--- modulename: TL, funcname: serialize_param
|
|
TL.py(95): if type_ == "int":
|
|
TL.py(99): elif type_ == "long":
|
|
TL.py(102): elif type_ in ["int128", "int256"]:
|
|
TL.py(103): assert isinstance(value, bytes)
|
|
TL.py(104): bytes_io.write(value)
|
|
TL.py(89): for arg in tl_method.params:
|
|
TL.py(91): return bytes_io.getvalue()
|
|
--- modulename: mtproto, funcname: send_message
|
|
mtproto.py(67): message_id = struct.pack('<Q', int((time()+self.timedelta)*2**30)*4)
|
|
mtproto.py(68): if self.auth_key is None or self.server_salt is None:
|
|
mtproto.py(72): struct.pack('<I', len(message_data)) +
|
|
mtproto.py(73): message_data)
|
|
mtproto.py(89): step1 = struct.pack('<II', len(message)+12, self.number) + message
|
|
mtproto.py(90): step2 = step1 + struct.pack('<I', crc32(step1))
|
|
--- modulename: mtproto, funcname: crc32
|
|
mtproto.py(27): return originalcrc32(data) & 0xffffffff
|
|
mtproto.py(91): self.sock.send(step2)
|
|
mtproto.py(92): self.number += 1
|
|
mtproto.py(133): server_answer = self.recv_message()
|
|
--- modulename: mtproto, funcname: recv_message
|
|
mtproto.py(98): packet_length_data = self.sock.recv(4) # reads how many bytes to read
|
|
mtproto.py(100): if len(packet_length_data) < 4:
|
|
mtproto.py(102): packet_length = struct.unpack("<I", packet_length_data)[0]
|
|
mtproto.py(103): packet = self.sock.recv(packet_length - 4) # read the rest of bytes from socket
|
|
mtproto.py(105): if not crc32(packet_length_data + packet[0:-4]) == struct.unpack('<I', packet[-4:])[0]:
|
|
--- modulename: mtproto, funcname: crc32
|
|
mtproto.py(27): return originalcrc32(data) & 0xffffffff
|
|
mtproto.py(107): x = struct.unpack("<I", packet[:4])
|
|
mtproto.py(108): auth_key_id = packet[4:12]
|
|
mtproto.py(109): if auth_key_id == b'\x00\x00\x00\x00\x00\x00\x00\x00':
|
|
mtproto.py(111): (message_id, message_length) = struct.unpack("<8sI", packet[12:24])
|
|
mtproto.py(112): print(len(packet[12:24]))
|
|
12
|
|
mtproto.py(113): data = packet[24:24+message_length]
|
|
mtproto.py(127): return data
|
|
mtproto.py(137): return TL.deserialize(io.BytesIO(server_answer))
|
|
--- modulename: TL, funcname: deserialize
|
|
TL.py(121): assert isinstance(bytes_io, io.BytesIO)
|
|
TL.py(123): if type_ == 'int': x = struct.unpack('<i', bytes_io.read(4))[0]
|
|
TL.py(124): elif type_ == '#': x = struct.unpack('<I', bytes_io.read(4))[0]
|
|
TL.py(125): elif type_ == 'long': x = struct.unpack('<q', bytes_io.read(8))[0]
|
|
TL.py(126): elif type_ == 'double': x = struct.unpack('<d', bytes_io.read(8))[0]
|
|
TL.py(127): elif type_ == 'int128': x = bytes_io.read(16)
|
|
TL.py(128): elif type_ == 'int256': x = bytes_io.read(32)
|
|
TL.py(129): elif type_ == 'string' or type_ == 'bytes':
|
|
TL.py(142): elif type_ == 'vector':
|
|
TL.py(148): try:
|
|
TL.py(150): tl_elem = tl.constructor_type[type_]
|
|
TL.py(151): except KeyError:
|
|
TL.py(153): Idata = bytes_io.read(4)
|
|
TL.py(154): i = struct.unpack('<i', Idata)[0] # read type ID
|
|
TL.py(155): print(hexlify(bytes_io.getvalue()))
|
|
63241605e5ef3e8ce303933c9d1ef62cee6849bede86f1ba6db0f1d69f93b9ede74ec06c0813b8b9585102c27700000015c4b51c01000000216be86c022bb4c3
|
|
TL.py(156): try:
|
|
TL.py(157): tl_elem = tl.constructor_id[i]
|
|
TL.py(162): base_boxed_types = ["Vector t", "Int", "Long", "Double", "String", "Int128", "Int256"]
|
|
TL.py(163): if tl_elem.type in base_boxed_types:
|
|
TL.py(166): x = TLObject(tl_elem)
|
|
--- modulename: TL, funcname: __init__
|
|
TL.py(40): self.name = tl_elem.predicate
|
|
TL.py(167): for arg in tl_elem.params:
|
|
TL.py(168): x[arg['name']] = deserialize(bytes_io, type_=arg['type'], subtype=arg['subtype'])
|
|
--- modulename: TL, funcname: deserialize
|
|
TL.py(121): assert isinstance(bytes_io, io.BytesIO)
|
|
TL.py(123): if type_ == 'int': x = struct.unpack('<i', bytes_io.read(4))[0]
|
|
TL.py(124): elif type_ == '#': x = struct.unpack('<I', bytes_io.read(4))[0]
|
|
TL.py(125): elif type_ == 'long': x = struct.unpack('<q', bytes_io.read(8))[0]
|
|
TL.py(126): elif type_ == 'double': x = struct.unpack('<d', bytes_io.read(8))[0]
|
|
TL.py(127): elif type_ == 'int128': x = bytes_io.read(16)
|
|
TL.py(169): return x
|
|
TL.py(167): for arg in tl_elem.params:
|
|
TL.py(168): x[arg['name']] = deserialize(bytes_io, type_=arg['type'], subtype=arg['subtype'])
|
|
--- modulename: TL, funcname: deserialize
|
|
TL.py(121): assert isinstance(bytes_io, io.BytesIO)
|
|
TL.py(123): if type_ == 'int': x = struct.unpack('<i', bytes_io.read(4))[0]
|
|
TL.py(124): elif type_ == '#': x = struct.unpack('<I', bytes_io.read(4))[0]
|
|
TL.py(125): elif type_ == 'long': x = struct.unpack('<q', bytes_io.read(8))[0]
|
|
TL.py(126): elif type_ == 'double': x = struct.unpack('<d', bytes_io.read(8))[0]
|
|
TL.py(127): elif type_ == 'int128': x = bytes_io.read(16)
|
|
TL.py(169): return x
|
|
TL.py(167): for arg in tl_elem.params:
|
|
TL.py(168): x[arg['name']] = deserialize(bytes_io, type_=arg['type'], subtype=arg['subtype'])
|
|
--- modulename: TL, funcname: deserialize
|
|
TL.py(121): assert isinstance(bytes_io, io.BytesIO)
|
|
TL.py(123): if type_ == 'int': x = struct.unpack('<i', bytes_io.read(4))[0]
|
|
TL.py(124): elif type_ == '#': x = struct.unpack('<I', bytes_io.read(4))[0]
|
|
TL.py(125): elif type_ == 'long': x = struct.unpack('<q', bytes_io.read(8))[0]
|
|
TL.py(126): elif type_ == 'double': x = struct.unpack('<d', bytes_io.read(8))[0]
|
|
TL.py(127): elif type_ == 'int128': x = bytes_io.read(16)
|
|
TL.py(128): elif type_ == 'int256': x = bytes_io.read(32)
|
|
TL.py(129): elif type_ == 'string' or type_ == 'bytes':
|
|
TL.py(130): l = struct.unpack('<B', bytes_io.read(1))[0]
|
|
TL.py(131): assert l <= 254 # In general, 0xFF byte is not allowed here
|
|
TL.py(132): if l == 254:
|
|
TL.py(139): x = bytes_io.read(l)
|
|
TL.py(140): bytes_io.read(-(l+1) % 4) # skip padding bytes
|
|
TL.py(141): assert isinstance(x, bytes)
|
|
TL.py(169): return x
|
|
TL.py(167): for arg in tl_elem.params:
|
|
TL.py(168): x[arg['name']] = deserialize(bytes_io, type_=arg['type'], subtype=arg['subtype'])
|
|
--- modulename: TL, funcname: deserialize
|
|
TL.py(121): assert isinstance(bytes_io, io.BytesIO)
|
|
TL.py(123): if type_ == 'int': x = struct.unpack('<i', bytes_io.read(4))[0]
|
|
TL.py(124): elif type_ == '#': x = struct.unpack('<I', bytes_io.read(4))[0]
|
|
TL.py(125): elif type_ == 'long': x = struct.unpack('<q', bytes_io.read(8))[0]
|
|
TL.py(126): elif type_ == 'double': x = struct.unpack('<d', bytes_io.read(8))[0]
|
|
TL.py(127): elif type_ == 'int128': x = bytes_io.read(16)
|
|
TL.py(128): elif type_ == 'int256': x = bytes_io.read(32)
|
|
TL.py(129): elif type_ == 'string' or type_ == 'bytes':
|
|
TL.py(142): elif type_ == 'vector':
|
|
TL.py(148): try:
|
|
TL.py(150): tl_elem = tl.constructor_type[type_]
|
|
TL.py(151): except KeyError:
|
|
TL.py(153): Idata = bytes_io.read(4)
|
|
TL.py(154): i = struct.unpack('<i', Idata)[0] # read type ID
|
|
TL.py(155): print(hexlify(bytes_io.getvalue()))
|
|
63241605e5ef3e8ce303933c9d1ef62cee6849bede86f1ba6db0f1d69f93b9ede74ec06c0813b8b9585102c27700000015c4b51c01000000216be86c022bb4c3
|
|
TL.py(156): try:
|
|
TL.py(157): tl_elem = tl.constructor_id[i]
|
|
TL.py(162): base_boxed_types = ["Vector t", "Int", "Long", "Double", "String", "Int128", "Int256"]
|
|
TL.py(163): if tl_elem.type in base_boxed_types:
|
|
TL.py(164): x = deserialize(bytes_io, type_=tl_elem.predicate, subtype=subtype)
|
|
--- modulename: TL, funcname: deserialize
|
|
TL.py(121): assert isinstance(bytes_io, io.BytesIO)
|
|
TL.py(123): if type_ == 'int': x = struct.unpack('<i', bytes_io.read(4))[0]
|
|
TL.py(124): elif type_ == '#': x = struct.unpack('<I', bytes_io.read(4))[0]
|
|
TL.py(125): elif type_ == 'long': x = struct.unpack('<q', bytes_io.read(8))[0]
|
|
TL.py(126): elif type_ == 'double': x = struct.unpack('<d', bytes_io.read(8))[0]
|
|
TL.py(127): elif type_ == 'int128': x = bytes_io.read(16)
|
|
TL.py(128): elif type_ == 'int256': x = bytes_io.read(32)
|
|
TL.py(129): elif type_ == 'string' or type_ == 'bytes':
|
|
TL.py(142): elif type_ == 'vector':
|
|
TL.py(143): assert subtype is not None
|
|
TL.py(144): count = struct.unpack('<l', bytes_io.read(4))[0]
|
|
TL.py(145): x = [deserialize(bytes_io, type_=subtype) for i in range(count)]
|
|
--- modulename: TL, funcname: deserialize
|
|
TL.py(121): assert isinstance(bytes_io, io.BytesIO)
|
|
TL.py(123): if type_ == 'int': x = struct.unpack('<i', bytes_io.read(4))[0]
|
|
TL.py(124): elif type_ == '#': x = struct.unpack('<I', bytes_io.read(4))[0]
|
|
TL.py(125): elif type_ == 'long': x = struct.unpack('<q', bytes_io.read(8))[0]
|
|
TL.py(169): return x
|
|
TL.py(145): x = [deserialize(bytes_io, type_=subtype) for i in range(count)]
|
|
TL.py(169): return x
|
|
TL.py(169): return x
|
|
TL.py(167): for arg in tl_elem.params:
|
|
TL.py(169): return x
|
|
mtproto.py(145): server_nonce = ResPQ['server_nonce']
|
|
mtproto.py(146): exit()
|
|
--- modulename: site, funcname: __call__
|
|
site.py(371): try:
|
|
site.py(372): sys.stdin.close()
|
|
site.py(375): raise SystemExit(code)
|
|
--- modulename: trace, funcname: _unsettrace
|
|
trace.py(80): sys.settrace(None)
|