Is there a simple way to solve a linear congruence modulo an integer with large prime factors in Sage? solve_mod function cannot handle such large moduli apparently.