#include<bits/stdc++.h>
#define ll long long
#define max(a,b) (a>b?a:b)
#define min(a,b) (a<b?a:b)
using namespace std;
const int M=505,mod=998244353,bite=13331;
int n,f[M][M],maxx,q[M];
ll da[M]={0,2,3,5,8,14,24,43,77,140,256,472,874,1628,3045,5719,10780,20388,38674,73562,140268,268066,513350,984911,1892875,3643570,7023562,13557020,26200182,50691978,98182666,190353370,369393466,717457656,396388012,716573193,290531451,307156634,93953944,196348119,504192010,409284137,947139393,768626866,434076154,812804346,558961319,574822495,342285469,950637047,107752343,222860076,13088813,477169480,692423261,990468997,672661561,209393637,596339201,369321715,459936819,70124282,63865292,930323100,99513452,160117378,861955549,344957835,759375609,42795599,905110575,744686445,213148536,104991276,783604889,485221126,244677512,439758559,891893148,110573830,716919797,159877268,382375870,453347658,307613111,711407681,128116415,702373376,822510392,228945977,673880423,840654720,235063344,603953851,358567566,817781848,90522047,582111637,799970244,204694094,134540874,138731484,973346708,247305117,77009431,285961292,201454234,595955925,406752785,255403451,760905485,693614764,692207093,922328618,862676768,921574433,68908810,533887654,307857440,294814258,187251509,184089740,65565289,543941313,135331539,242495544,934371708,536380678,853787151,466372957,230784341,754760605,633678516,124816915,492868438,308329195,326578462,135798551,490325164,375281100,469374200,875860384,602753814,986101394,346545424,267232676,993773680,215974985,44193403,384133670,250810076,902160598,929747736,768111270,122497948,698019482,293349624,144330252,888194185,525453292,750906747,536181867,968149032,411194658,990290826,590152109,538550766,971255813,366584201,560209517,598084887,311936229,781641220,458955899,402406443,713323527,776297712,742216055,932085457,302170322,19623665,24748207,680855742,750414540,310566657,553464897,417238830,92366985,795595206,741496196,927483410,71064178,636522746,19080252,547670022,288025309,917846088,625641766,181836118,114770484,146907823,247090738,879493040,552390932,986855645,902025189,169699838,845783254,117214220,339063732,897456945,2118487,344522511,268067528,578532804,927547151,734751749,478314216,446420279,118147769,422396584,505195020,756668597,440560598,450429728,61407131,269142921,602344885,436067749,982052025,286258984,220205361,324089479,917753836,881981585,755936863,719471276,609882877,702908366,655139783,68482749,868657685,947946305,312218051,919710376,588035592,171458565,79347328,574333545,857717612,60887941,155353429,338835743,799335208,987353826,614391474,400670173,710049062,702893530,508993231,93115899,959373639,476199090,463093454,761094570,19769023,803836290,886228963,829043328,338447969,240888284,683169468,829282705,384088188,548318461,43121525,899194291,288911941,807408556,311019273,863258330,354164348,843170448,896319616,5239565,220841235,52943986,802682579,146046512,195408470,127930633,564697150,26955982,342687614,870769952,164852748,103908361,189754545,947534814,53690253,401931884,702680524,742721149,517715492,27874280,56296504,469818441,396471892,748391891,890145552,663190093,882467272,794002878,247983607,106376468,27106836,524695336,794742772,643857145,450333871,569893739,890909955,844355831,625757478,607279504,507108760,718517938,235956121,39096193,875332955,239875862,5139750,777442962,567374497,966122701,993195396,688980012,229495685,533012908,497087076,154460547,223263020,821136270,268970758,269469502,360165055,283261096,465853703,378096291,791482740,117499999,536407899,807073792,810162118,79667522,44920768,428231423,684443779,369501296,96039185,235163138,374024956,135325541,988510924,165602287,645086720,156908954,236179149,70956764,900664169,659557602,15457325,128979393,451144067,972244988,693753005,540634477,402922603,142990598,636171242,181919622,738676951,456381874,108592416,95170797,917815721,527716049,847325136,751217478,73815650,894561304,890397532,585103537,503673697,683965041,948898703,120776773,814927768,294212996,2151928,524818590,473346376,216925299,812242295,986122612,411415822,62627910,775422942,162998918,764990023,920812224,88740741,723208435,398939973,61432616,544845324,903539101,702978911,589107099,483803359,941289278,502359768,13538614,50633610,934013943,894334159,571412686,659098859,522395786,366966777,334800953,769093368,320318164,366593154,486334841,996961001,996904876,508426537,352566780,287576907,253156487,251180765,980602209,448314443,144620566,341516929,424595780,442215742,393113874,215377538,287948411,595603581,499846255,170825514,570221849,618752223,823311399,401920002,726729665,898791294,41863456,645984207,339770270,126937771,877303831,726621070,996638970,139309576,964867836,650891974,543113825,590106655,496375434,151374929,371386675,53713112,142856999,896460576,255444012,229016955,67044173,420767314,325247133,541187708,840266505,182446770,297457229,893640298,235378471,415667646,931224550,138600798,328512411,485991554,740312302,290530861,87363605,341812118,741752583,399804309,178649420};
ll ans,a[M];
map<ll,int> p;
void dfs(int x,int y)
{
	if(f[x][y])return;
	f[x][y]=1;
	ans=(ans+1)%mod;
	if(!max(x,y))return;
	for(int i=1;i<=max(x,y);++i)
		dfs(x%i,y%i);
}
int main()
{
//	freopen("mod.in","r",stdin);
//	freopen("mod.out","w",stdout);
	scanf("%d",&n);
	for(int i=1;i<=n;++i)
		scanf("%d",&a[i]);
	if(n<=2)
	{
		dfs(a[1],a[2]);
		printf("%lld",ans);
		return 0;
	 } 
	 printf("%lld",da[n]);
	return 0;
}
/*
2 3 5 8 14 24 43 77
1 1 2 3  5  8 13 21 34

*/