~\sqrt{x}~

~\frac{a}{b}~

~10^{18}~

~\displaystyle \sum_{i=1}^{n} x~ ~\displaystyle \prod x~

~\alpha~ ~\beta~ ~\delta~ ~\gamma~ ~\Delta~ ~\neg~ ~\ne~ ~\ll~ ~\not~ ~\star~ ~\infty~

$$\displaystyle \sum_{i=1}^{n} x$$

$$\begin{vmatrix} a & b \\ c & d \end{vmatrix}$$

$$Hello$$

~a \, b \quad c \! d \: e \; f \qquad g~

/*
    www.youtube.com/YugiHackerChannel 
    linktr.ee/YugiHacker
*/
#include<bits/stdc++.h>
#define el cout<<"\n"
#define f0(i,n) for(int i=0;i&lt;n;++i)
#define f1(i,n) for(int i=1;i<=n;++i)
#define maxn
using namespace std;

main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);

}

/*
    www.youtube.com/YugiHackerChannel 
    linktr.ee/YugiHacker
*/
#include<bits/stdc++.h>
#define el cout<<"\n"
#define f0(i,n) for(int i=0;i&lt;n;++i)
#define f1(i,n) for(int i=1;i<=n;++i)
#define maxn
using namespace std;
main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);

}

/*
     www.youtube.com/YugiHackerChannel
     oj.vnoi.info/user/YugiHackerKhongCopCode
*/
#include<bits/stdc++.h>
#define el cout<<"\n"
#define f0(i,n) for(int i=0;i<n;++i)
#define f1(i,n) for(int i=1;i<=n;++i)
#define maxn
using namespace std;
main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    cin >> n >> m >> M;
    n = __gcd(n, m);
    matrix ans;
    ans.a[0][0] = ans.a[0][1] = ans.a[1][0] = 1;
    ans = ans.Pow(n-1);
    coot << ans.a[0][0];
}

Heading 1

Heading 2

Heding 3

----------

Test spoiler

~\tag~ ~\begin{what}~ ~\end{something}~

~a + b = 3 \tag{*}~

~\begin{gather} a \\ b \end{gather}~

Bold Italic ItalicBold